./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/list-ext_flag.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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/list-ext-properties/list-ext_flag.i -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 3747e65f01c1fbd6eb9d2ad39b0ceed8be631bde45acb074c0903963e660faab --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 20:51:47,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 20:51:47,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 20:51:47,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 20:51:47,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 20:51:47,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 20:51:47,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 20:51:47,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 20:51:47,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 20:51:47,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 20:51:47,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 20:51:47,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 20:51:47,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 20:51:47,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 20:51:47,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 20:51:47,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 20:51:47,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 20:51:47,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 20:51:47,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 20:51:47,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 20:51:47,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 20:51:47,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 20:51:47,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 20:51:47,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 20:51:47,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 20:51:47,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 20:51:47,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 20:51:47,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 20:51:47,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 20:51:47,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 20:51:47,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 20:51:47,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 20:51:47,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 20:51:47,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 20:51:47,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 20:51:47,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 20:51:47,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 20:51:47,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 20:51:47,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 20:51:47,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 20:51:47,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 20:51:47,318 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 20:51:47,340 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 20:51:47,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 20:51:47,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 20:51:47,343 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 20:51:47,343 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 20:51:47,343 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 20:51:47,344 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 20:51:47,344 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 20:51:47,344 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 20:51:47,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 20:51:47,345 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 20:51:47,345 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 20:51:47,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 20:51:47,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 20:51:47,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 20:51:47,346 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 20:51:47,346 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 20:51:47,346 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 20:51:47,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 20:51:47,346 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 20:51:47,346 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 20:51:47,346 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 20:51:47,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 20:51:47,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 20:51:47,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 20:51:47,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:51:47,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 20:51:47,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 20:51:47,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 20:51:47,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 20:51:47,348 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 20:51:47,348 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 -> 3747e65f01c1fbd6eb9d2ad39b0ceed8be631bde45acb074c0903963e660faab [2021-12-18 20:51:47,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 20:51:47,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 20:51:47,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 20:51:47,593 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 20:51:47,594 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 20:51:47,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2021-12-18 20:51:47,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3ddde3bc/f0362d6c2e0d4e75853458c74a60cd44/FLAG181b117d8 [2021-12-18 20:51:48,003 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 20:51:48,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2021-12-18 20:51:48,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3ddde3bc/f0362d6c2e0d4e75853458c74a60cd44/FLAG181b117d8 [2021-12-18 20:51:48,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3ddde3bc/f0362d6c2e0d4e75853458c74a60cd44 [2021-12-18 20:51:48,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 20:51:48,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 20:51:48,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 20:51:48,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 20:51:48,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 20:51:48,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:51:48" (1/1) ... [2021-12-18 20:51:48,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b184da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48, skipping insertion in model container [2021-12-18 20:51:48,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:51:48" (1/1) ... [2021-12-18 20:51:48,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 20:51:48,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 20:51:48,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_flag.i[23527,23540] [2021-12-18 20:51:48,245 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:51:48,250 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 20:51:48,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_flag.i[23527,23540] [2021-12-18 20:51:48,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:51:48,291 INFO L208 MainTranslator]: Completed translation [2021-12-18 20:51:48,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48 WrapperNode [2021-12-18 20:51:48,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 20:51:48,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 20:51:48,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 20:51:48,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 20:51:48,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48" (1/1) ... [2021-12-18 20:51:48,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48" (1/1) ... [2021-12-18 20:51:48,335 INFO L137 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2021-12-18 20:51:48,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 20:51:48,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 20:51:48,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 20:51:48,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 20:51:48,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48" (1/1) ... [2021-12-18 20:51:48,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48" (1/1) ... [2021-12-18 20:51:48,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48" (1/1) ... [2021-12-18 20:51:48,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48" (1/1) ... [2021-12-18 20:51:48,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48" (1/1) ... [2021-12-18 20:51:48,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48" (1/1) ... [2021-12-18 20:51:48,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48" (1/1) ... [2021-12-18 20:51:48,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 20:51:48,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 20:51:48,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 20:51:48,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 20:51:48,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48" (1/1) ... [2021-12-18 20:51:48,392 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:51:48,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:51:48,410 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) [2021-12-18 20:51:48,458 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 [2021-12-18 20:51:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-18 20:51:48,472 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-18 20:51:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 20:51:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 20:51:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 20:51:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 20:51:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 20:51:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 20:51:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 20:51:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 20:51:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 20:51:48,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 20:51:48,586 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 20:51:48,587 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 20:51:48,650 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-18 20:51:48,892 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 20:51:48,898 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 20:51:48,899 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-18 20:51:48,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:51:48 BoogieIcfgContainer [2021-12-18 20:51:48,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 20:51:48,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 20:51:48,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 20:51:48,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 20:51:48,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:51:48" (1/3) ... [2021-12-18 20:51:48,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1bde07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:51:48, skipping insertion in model container [2021-12-18 20:51:48,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:48" (2/3) ... [2021-12-18 20:51:48,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1bde07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:51:48, skipping insertion in model container [2021-12-18 20:51:48,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:51:48" (3/3) ... [2021-12-18 20:51:48,909 INFO L111 eAbstractionObserver]: Analyzing ICFG list-ext_flag.i [2021-12-18 20:51:48,913 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 20:51:48,914 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2021-12-18 20:51:48,953 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 20:51:48,962 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 20:51:48,962 INFO L340 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2021-12-18 20:51:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 55 states have (on average 2.109090909090909) internal successors, (116), 102 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-18 20:51:48,984 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:48,984 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-18 20:51:48,985 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:48,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2021-12-18 20:51:49,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:49,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427634531] [2021-12-18 20:51:49,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:49,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:49,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:49,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427634531] [2021-12-18 20:51:49,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427634531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:49,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:49,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:51:49,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260671090] [2021-12-18 20:51:49,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:49,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:51:49,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:49,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:51:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:51:49,153 INFO L87 Difference]: Start difference. First operand has 104 states, 55 states have (on average 2.109090909090909) internal successors, (116), 102 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:49,270 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2021-12-18 20:51:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:51:49,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-18 20:51:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:49,278 INFO L225 Difference]: With dead ends: 123 [2021-12-18 20:51:49,278 INFO L226 Difference]: Without dead ends: 116 [2021-12-18 20:51:49,279 INFO L932 BasicCegarLoop]: 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 [2021-12-18 20:51:49,282 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 98 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:49,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 85 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:51:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-18 20:51:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2021-12-18 20:51:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 52 states have (on average 2.0) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-12-18 20:51:49,315 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 4 [2021-12-18 20:51:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:49,315 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-12-18 20:51:49,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-12-18 20:51:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-18 20:51:49,316 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:49,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-18 20:51:49,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 20:51:49,317 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2021-12-18 20:51:49,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:49,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812294070] [2021-12-18 20:51:49,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:49,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:49,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:49,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812294070] [2021-12-18 20:51:49,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812294070] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:49,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:49,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:51:49,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083733684] [2021-12-18 20:51:49,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:49,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:51:49,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:49,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:51:49,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:51:49,368 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:49,408 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2021-12-18 20:51:49,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:51:49,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-18 20:51:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:49,410 INFO L225 Difference]: With dead ends: 95 [2021-12-18 20:51:49,410 INFO L226 Difference]: Without dead ends: 95 [2021-12-18 20:51:49,410 INFO L932 BasicCegarLoop]: 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 [2021-12-18 20:51:49,411 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:49,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 65 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:51:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-18 20:51:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-18 20:51:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 94 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) [2021-12-18 20:51:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2021-12-18 20:51:49,416 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 4 [2021-12-18 20:51:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:49,417 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2021-12-18 20:51:49,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2021-12-18 20:51:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 20:51:49,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:49,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:49,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 20:51:49,418 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:49,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2065304377, now seen corresponding path program 1 times [2021-12-18 20:51:49,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:49,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358785746] [2021-12-18 20:51:49,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:49,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:49,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:49,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358785746] [2021-12-18 20:51:49,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358785746] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:49,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:49,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:51:49,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850597978] [2021-12-18 20:51:49,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:49,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:51:49,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:49,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:51:49,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:51:49,460 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:49,557 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2021-12-18 20:51:49,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:51:49,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-12-18 20:51:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:49,560 INFO L225 Difference]: With dead ends: 105 [2021-12-18 20:51:49,561 INFO L226 Difference]: Without dead ends: 105 [2021-12-18 20:51:49,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:51:49,566 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 166 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:49,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 52 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:51:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-18 20:51:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2021-12-18 20:51:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 86 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2021-12-18 20:51:49,581 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 9 [2021-12-18 20:51:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:49,581 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2021-12-18 20:51:49,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2021-12-18 20:51:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 20:51:49,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:49,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:49,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 20:51:49,583 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:49,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2065304378, now seen corresponding path program 1 times [2021-12-18 20:51:49,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:49,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762126451] [2021-12-18 20:51:49,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:49,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:49,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:49,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762126451] [2021-12-18 20:51:49,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762126451] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:49,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:49,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:51:49,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459580280] [2021-12-18 20:51:49,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:49,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:51:49,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:49,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:51:49,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:51:49,651 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:49,753 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2021-12-18 20:51:49,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:51:49,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-12-18 20:51:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:49,754 INFO L225 Difference]: With dead ends: 123 [2021-12-18 20:51:49,754 INFO L226 Difference]: Without dead ends: 123 [2021-12-18 20:51:49,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:51:49,755 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 176 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:49,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 62 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:51:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-18 20:51:49,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2021-12-18 20:51:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 107 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2021-12-18 20:51:49,759 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 9 [2021-12-18 20:51:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:49,759 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2021-12-18 20:51:49,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2021-12-18 20:51:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 20:51:49,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:49,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:49,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 20:51:49,761 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:49,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:49,761 INFO L85 PathProgramCache]: Analyzing trace with hash 990774777, now seen corresponding path program 1 times [2021-12-18 20:51:49,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:49,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063489737] [2021-12-18 20:51:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:49,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:49,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:49,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063489737] [2021-12-18 20:51:49,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063489737] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:49,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:49,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 20:51:49,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368788128] [2021-12-18 20:51:49,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:49,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:51:49,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:49,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:51:49,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:51:49,812 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:49,903 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2021-12-18 20:51:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:51:49,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 20:51:49,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:49,906 INFO L225 Difference]: With dead ends: 156 [2021-12-18 20:51:49,906 INFO L226 Difference]: Without dead ends: 156 [2021-12-18 20:51:49,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:51:49,907 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 42 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:49,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 250 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:51:49,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-18 20:51:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2021-12-18 20:51:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 112 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) [2021-12-18 20:51:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2021-12-18 20:51:49,911 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 15 [2021-12-18 20:51:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:49,911 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2021-12-18 20:51:49,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2021-12-18 20:51:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 20:51:49,912 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:49,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:49,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 20:51:49,912 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:49,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:49,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1321200184, now seen corresponding path program 1 times [2021-12-18 20:51:49,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:49,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308023074] [2021-12-18 20:51:49,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:49,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:49,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:49,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308023074] [2021-12-18 20:51:49,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308023074] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:49,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:49,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 20:51:49,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365994591] [2021-12-18 20:51:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:49,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:51:49,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:51:49,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:51:49,961 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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) [2021-12-18 20:51:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:50,124 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2021-12-18 20:51:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:51:50,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 [2021-12-18 20:51:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:50,125 INFO L225 Difference]: With dead ends: 169 [2021-12-18 20:51:50,126 INFO L226 Difference]: Without dead ends: 169 [2021-12-18 20:51:50,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:51:50,126 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 138 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:50,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 221 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:51:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-18 20:51:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 113. [2021-12-18 20:51:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2021-12-18 20:51:50,130 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 17 [2021-12-18 20:51:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:50,130 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2021-12-18 20:51:50,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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) [2021-12-18 20:51:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2021-12-18 20:51:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 20:51:50,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:50,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:50,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 20:51:50,132 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:50,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1496225836, now seen corresponding path program 1 times [2021-12-18 20:51:50,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:50,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670823025] [2021-12-18 20:51:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:50,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:50,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:50,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670823025] [2021-12-18 20:51:50,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670823025] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:50,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:50,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:51:50,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355839652] [2021-12-18 20:51:50,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:50,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:51:50,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:50,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:51:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:51:50,166 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:50,236 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2021-12-18 20:51:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:51:50,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-18 20:51:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:50,237 INFO L225 Difference]: With dead ends: 122 [2021-12-18 20:51:50,237 INFO L226 Difference]: Without dead ends: 122 [2021-12-18 20:51:50,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:51:50,238 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 154 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:50,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 84 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:51:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-18 20:51:50,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2021-12-18 20:51:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 113 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) [2021-12-18 20:51:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2021-12-18 20:51:50,241 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 19 [2021-12-18 20:51:50,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:50,241 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2021-12-18 20:51:50,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2021-12-18 20:51:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:51:50,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:50,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:50,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 20:51:50,243 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:50,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:50,243 INFO L85 PathProgramCache]: Analyzing trace with hash 893457289, now seen corresponding path program 1 times [2021-12-18 20:51:50,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:50,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127816094] [2021-12-18 20:51:50,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:50,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:50,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:50,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127816094] [2021-12-18 20:51:50,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127816094] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:50,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:50,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:51:50,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591266138] [2021-12-18 20:51:50,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:50,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:51:50,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:50,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:51:50,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:51:50,305 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:50,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:50,419 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2021-12-18 20:51:50,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:51:50,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:51:50,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:50,420 INFO L225 Difference]: With dead ends: 151 [2021-12-18 20:51:50,420 INFO L226 Difference]: Without dead ends: 141 [2021-12-18 20:51:50,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:51:50,421 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 84 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:50,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 201 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:51:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-18 20:51:50,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2021-12-18 20:51:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 118 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2021-12-18 20:51:50,424 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 22 [2021-12-18 20:51:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:50,425 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2021-12-18 20:51:50,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2021-12-18 20:51:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:51:50,425 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:50,425 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:50,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 20:51:50,426 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1991608044, now seen corresponding path program 1 times [2021-12-18 20:51:50,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:50,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913979324] [2021-12-18 20:51:50,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:50,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:50,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:50,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913979324] [2021-12-18 20:51:50,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913979324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:50,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:50,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 20:51:50,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351259719] [2021-12-18 20:51:50,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:50,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:51:50,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:50,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:51:50,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:51:50,465 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:50,593 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2021-12-18 20:51:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:51:50,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:51:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:50,594 INFO L225 Difference]: With dead ends: 120 [2021-12-18 20:51:50,594 INFO L226 Difference]: Without dead ends: 120 [2021-12-18 20:51:50,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:51:50,595 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 118 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:50,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 185 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:51:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-18 20:51:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2021-12-18 20:51:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 116 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2021-12-18 20:51:50,604 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 22 [2021-12-18 20:51:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:50,605 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2021-12-18 20:51:50,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2021-12-18 20:51:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:51:50,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:50,609 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:50,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 20:51:50,609 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:50,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:50,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1991608043, now seen corresponding path program 1 times [2021-12-18 20:51:50,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:50,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878651132] [2021-12-18 20:51:50,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:50,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:50,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:50,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878651132] [2021-12-18 20:51:50,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878651132] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:50,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:50,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 20:51:50,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141856682] [2021-12-18 20:51:50,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:50,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:51:50,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:50,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:51:50,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:51:50,713 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:50,873 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2021-12-18 20:51:50,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 20:51:50,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:51:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:50,876 INFO L225 Difference]: With dead ends: 117 [2021-12-18 20:51:50,876 INFO L226 Difference]: Without dead ends: 117 [2021-12-18 20:51:50,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-18 20:51:50,877 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 71 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:50,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 253 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:51:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-18 20:51:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2021-12-18 20:51:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.369047619047619) internal successors, (115), 99 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) [2021-12-18 20:51:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2021-12-18 20:51:50,882 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 22 [2021-12-18 20:51:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:50,883 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2021-12-18 20:51:50,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2021-12-18 20:51:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 20:51:50,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:50,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:50,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 20:51:50,884 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:50,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:50,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1076428849, now seen corresponding path program 1 times [2021-12-18 20:51:50,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:50,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544252651] [2021-12-18 20:51:50,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:50,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:51:50,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:50,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544252651] [2021-12-18 20:51:50,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544252651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:50,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:50,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 20:51:50,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169760901] [2021-12-18 20:51:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:50,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 20:51:50,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:50,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 20:51:50,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:51:50,989 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:51,144 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2021-12-18 20:51:51,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:51:51,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-18 20:51:51,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:51,145 INFO L225 Difference]: With dead ends: 107 [2021-12-18 20:51:51,145 INFO L226 Difference]: Without dead ends: 98 [2021-12-18 20:51:51,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-18 20:51:51,146 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 117 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:51,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 296 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:51:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-18 20:51:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2021-12-18 20:51:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 88 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) [2021-12-18 20:51:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2021-12-18 20:51:51,148 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 25 [2021-12-18 20:51:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:51,148 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2021-12-18 20:51:51,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2021-12-18 20:51:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 20:51:51,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:51,149 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:51,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 20:51:51,150 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:51,150 INFO L85 PathProgramCache]: Analyzing trace with hash 762143636, now seen corresponding path program 1 times [2021-12-18 20:51:51,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:51,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863367060] [2021-12-18 20:51:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:51,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:51,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:51,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863367060] [2021-12-18 20:51:51,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863367060] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:51:51,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817973472] [2021-12-18 20:51:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:51,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:51:51,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:51:51,202 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) [2021-12-18 20:51:51,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 20:51:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:51,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 20:51:51,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:51,392 INFO L388 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 [2021-12-18 20:51:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:51:51,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:51:51,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817973472] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:51,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 20:51:51,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2021-12-18 20:51:51,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661835216] [2021-12-18 20:51:51,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:51,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 20:51:51,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:51,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 20:51:51,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-18 20:51:51,405 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:51,504 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2021-12-18 20:51:51,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 20:51:51,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-12-18 20:51:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:51,505 INFO L225 Difference]: With dead ends: 140 [2021-12-18 20:51:51,505 INFO L226 Difference]: Without dead ends: 140 [2021-12-18 20:51:51,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-12-18 20:51:51,506 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:51,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 293 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:51:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-18 20:51:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2021-12-18 20:51:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.3875) internal successors, (111), 95 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) [2021-12-18 20:51:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2021-12-18 20:51:51,509 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 28 [2021-12-18 20:51:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:51,509 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2021-12-18 20:51:51,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2021-12-18 20:51:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 20:51:51,509 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:51,510 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:51,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:51,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-18 20:51:51,727 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:51,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1442202006, now seen corresponding path program 1 times [2021-12-18 20:51:51,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:51,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191504855] [2021-12-18 20:51:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:51,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:51,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:51,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191504855] [2021-12-18 20:51:51,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191504855] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:51:51,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763688105] [2021-12-18 20:51:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:51,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:51:51,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:51:51,792 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) [2021-12-18 20:51:51,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 20:51:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:51,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 20:51:51,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:51,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:51:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:52,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763688105] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:51:52,014 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:51:52,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2021-12-18 20:51:52,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483604402] [2021-12-18 20:51:52,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:51:52,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 20:51:52,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:52,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 20:51:52,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-18 20:51:52,015 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:52,111 INFO L93 Difference]: Finished difference Result 324 states and 370 transitions. [2021-12-18 20:51:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 20:51:52,111 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-18 20:51:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:52,112 INFO L225 Difference]: With dead ends: 324 [2021-12-18 20:51:52,113 INFO L226 Difference]: Without dead ends: 324 [2021-12-18 20:51:52,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-12-18 20:51:52,113 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 325 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:52,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 483 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:51:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-18 20:51:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 137. [2021-12-18 20:51:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 136 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) [2021-12-18 20:51:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2021-12-18 20:51:52,116 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 28 [2021-12-18 20:51:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:52,116 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2021-12-18 20:51:52,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2021-12-18 20:51:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 20:51:52,117 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:52,117 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:52,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-18 20:51:52,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-18 20:51:52,336 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:52,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1992394589, now seen corresponding path program 1 times [2021-12-18 20:51:52,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:52,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884084284] [2021-12-18 20:51:52,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:52,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:52,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:52,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884084284] [2021-12-18 20:51:52,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884084284] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:51:52,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411315730] [2021-12-18 20:51:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:52,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:51:52,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:51:52,456 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) [2021-12-18 20:51:52,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-18 20:51:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:52,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-18 20:51:52,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:52,635 INFO L388 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 [2021-12-18 20:51:52,670 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:51:52,670 INFO L388 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 [2021-12-18 20:51:52,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:51:52,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:51:52,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:51:52,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:51:52,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:51:52,848 INFO L388 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 [2021-12-18 20:51:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:52,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:51:52,875 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_359) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-18 20:51:52,893 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_359) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-18 20:51:52,897 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_359) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-18 20:51:52,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_356 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_356)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_359) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-18 20:51:52,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:51:52,955 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:51:52,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2021-12-18 20:51:52,963 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:51:52,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-18 20:51:52,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-18 20:51:53,108 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:51:53,109 INFO L388 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 [2021-12-18 20:51:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 20:51:53,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411315730] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:51:53,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:51:53,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2021-12-18 20:51:53,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270511385] [2021-12-18 20:51:53,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:51:53,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-18 20:51:53,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:53,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-18 20:51:53,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=485, Unknown=4, NotChecked=196, Total=812 [2021-12-18 20:51:53,152 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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) [2021-12-18 20:51:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:53,610 INFO L93 Difference]: Finished difference Result 260 states and 288 transitions. [2021-12-18 20:51:53,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 20:51:53,610 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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 30 [2021-12-18 20:51:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:53,611 INFO L225 Difference]: With dead ends: 260 [2021-12-18 20:51:53,611 INFO L226 Difference]: Without dead ends: 260 [2021-12-18 20:51:53,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=675, Unknown=4, NotChecked=236, Total=1122 [2021-12-18 20:51:53,612 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 377 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 658 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:53,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 666 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 687 Invalid, 0 Unknown, 658 Unchecked, 0.3s Time] [2021-12-18 20:51:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-12-18 20:51:53,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 153. [2021-12-18 20:51:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 152 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2021-12-18 20:51:53,615 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 30 [2021-12-18 20:51:53,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:53,615 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2021-12-18 20:51:53,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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) [2021-12-18 20:51:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2021-12-18 20:51:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 20:51:53,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:53,615 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:53,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:53,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:51:53,827 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:53,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1992702419, now seen corresponding path program 1 times [2021-12-18 20:51:53,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:53,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859618783] [2021-12-18 20:51:53,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:53,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:54,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:54,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859618783] [2021-12-18 20:51:54,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859618783] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:51:54,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200555574] [2021-12-18 20:51:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:54,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:51:54,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:51:54,093 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) [2021-12-18 20:51:54,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-18 20:51:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:54,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-18 20:51:54,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:54,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:51:54,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:51:54,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:51:54,338 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:51:54,339 INFO L388 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 [2021-12-18 20:51:54,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:51:54,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:51:54,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:51:54,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-18 20:51:54,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:51:54,442 INFO L388 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 [2021-12-18 20:51:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:54,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:51:54,487 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2021-12-18 20:51:54,500 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2021-12-18 20:51:54,505 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2021-12-18 20:51:54,510 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (v_ArrVal_436 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_434)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2021-12-18 20:51:54,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:51:54,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:51:54,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:51:54,689 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:51:54,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2021-12-18 20:51:54,700 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-18 20:51:54,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2021-12-18 20:51:54,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:51:54,710 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:51:54,710 INFO L388 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 [2021-12-18 20:51:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 20:51:54,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200555574] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:51:54,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:51:54,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 31 [2021-12-18 20:51:54,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548825016] [2021-12-18 20:51:54,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:51:54,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-18 20:51:54,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:54,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-18 20:51:54,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=561, Unknown=7, NotChecked=212, Total=930 [2021-12-18 20:51:54,777 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:55,157 INFO L93 Difference]: Finished difference Result 238 states and 265 transitions. [2021-12-18 20:51:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 20:51:55,158 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-18 20:51:55,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:55,158 INFO L225 Difference]: With dead ends: 238 [2021-12-18 20:51:55,158 INFO L226 Difference]: Without dead ends: 238 [2021-12-18 20:51:55,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=709, Unknown=7, NotChecked=244, Total=1190 [2021-12-18 20:51:55,159 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 523 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 753 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:55,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 644 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 566 Invalid, 0 Unknown, 753 Unchecked, 0.3s Time] [2021-12-18 20:51:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-18 20:51:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 153. [2021-12-18 20:51:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 137 states have (on average 1.2773722627737227) internal successors, (175), 152 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2021-12-18 20:51:55,162 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 30 [2021-12-18 20:51:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:55,162 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2021-12-18 20:51:55,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2021-12-18 20:51:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 20:51:55,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:55,162 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:55,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:55,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-18 20:51:55,363 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:55,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:55,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1374608061, now seen corresponding path program 1 times [2021-12-18 20:51:55,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:55,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379757512] [2021-12-18 20:51:55,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:55,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:55,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:55,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379757512] [2021-12-18 20:51:55,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379757512] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:51:55,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527781259] [2021-12-18 20:51:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:55,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:51:55,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:51:55,527 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) [2021-12-18 20:51:55,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-18 20:51:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:55,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-18 20:51:55,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:55,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:51:55,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:51:55,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-18 20:51:55,758 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:51:55,758 INFO L388 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 [2021-12-18 20:51:55,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:51:55,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:51:55,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2021-12-18 20:51:55,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-18 20:51:55,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-18 20:51:55,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-18 20:51:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:55,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:51:55,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2021-12-18 20:51:55,922 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2021-12-18 20:51:55,926 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_513) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2021-12-18 20:51:55,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_510 Int)) (not (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_510)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2021-12-18 20:51:56,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:51:56,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:51:56,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:51:56,081 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:51:56,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2021-12-18 20:51:56,090 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-18 20:51:56,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2021-12-18 20:51:56,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-12-18 20:51:56,101 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:51:56,101 INFO L388 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 [2021-12-18 20:51:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 20:51:56,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527781259] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:51:56,152 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:51:56,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 31 [2021-12-18 20:51:56,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978085132] [2021-12-18 20:51:56,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:51:56,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-18 20:51:56,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:56,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-18 20:51:56,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=561, Unknown=7, NotChecked=212, Total=930 [2021-12-18 20:51:56,154 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:56,608 INFO L93 Difference]: Finished difference Result 257 states and 286 transitions. [2021-12-18 20:51:56,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 20:51:56,609 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-18 20:51:56,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:56,610 INFO L225 Difference]: With dead ends: 257 [2021-12-18 20:51:56,610 INFO L226 Difference]: Without dead ends: 257 [2021-12-18 20:51:56,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=750, Unknown=7, NotChecked=252, Total=1260 [2021-12-18 20:51:56,611 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 412 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1021 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:56,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 782 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 790 Invalid, 0 Unknown, 1021 Unchecked, 0.3s Time] [2021-12-18 20:51:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-12-18 20:51:56,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 173. [2021-12-18 20:51:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 172 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2021-12-18 20:51:56,613 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 30 [2021-12-18 20:51:56,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:56,614 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2021-12-18 20:51:56,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2021-12-18 20:51:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 20:51:56,614 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:56,614 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:56,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-18 20:51:56,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-18 20:51:56,824 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:56,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1374915891, now seen corresponding path program 1 times [2021-12-18 20:51:56,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:56,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383591152] [2021-12-18 20:51:56,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:56,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:56,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:56,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383591152] [2021-12-18 20:51:56,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383591152] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:51:56,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527867539] [2021-12-18 20:51:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:56,936 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:51:56,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:51:56,952 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) [2021-12-18 20:51:56,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-18 20:51:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:57,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-18 20:51:57,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:57,121 INFO L388 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 [2021-12-18 20:51:57,155 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:51:57,155 INFO L388 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 [2021-12-18 20:51:57,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:51:57,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:51:57,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:51:57,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:51:57,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:51:57,340 INFO L388 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 [2021-12-18 20:51:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:57,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:51:57,363 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2021-12-18 20:51:57,373 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2021-12-18 20:51:57,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_588) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2021-12-18 20:51:57,381 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 Int) (v_ArrVal_588 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_585)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2021-12-18 20:51:57,413 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:51:57,416 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:51:57,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2021-12-18 20:51:57,421 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:51:57,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-18 20:51:57,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-18 20:51:57,549 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:51:57,549 INFO L388 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 [2021-12-18 20:51:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 20:51:57,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527867539] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:51:57,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:51:57,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2021-12-18 20:51:57,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771727893] [2021-12-18 20:51:57,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:51:57,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-18 20:51:57,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:57,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-18 20:51:57,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=485, Unknown=4, NotChecked=196, Total=812 [2021-12-18 20:51:57,591 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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) [2021-12-18 20:51:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:58,143 INFO L93 Difference]: Finished difference Result 279 states and 309 transitions. [2021-12-18 20:51:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 20:51:58,143 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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 30 [2021-12-18 20:51:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:58,144 INFO L225 Difference]: With dead ends: 279 [2021-12-18 20:51:58,144 INFO L226 Difference]: Without dead ends: 279 [2021-12-18 20:51:58,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=759, Unknown=4, NotChecked=252, Total=1260 [2021-12-18 20:51:58,145 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 227 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 928 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:58,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 943 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1070 Invalid, 0 Unknown, 928 Unchecked, 0.4s Time] [2021-12-18 20:51:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-18 20:51:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 181. [2021-12-18 20:51:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 165 states have (on average 1.2545454545454546) internal successors, (207), 180 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 207 transitions. [2021-12-18 20:51:58,147 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 207 transitions. Word has length 30 [2021-12-18 20:51:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:58,148 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 207 transitions. [2021-12-18 20:51:58,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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) [2021-12-18 20:51:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 207 transitions. [2021-12-18 20:51:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 20:51:58,148 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:58,148 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:58,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:58,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-18 20:51:58,356 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:51:58,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:58,356 INFO L85 PathProgramCache]: Analyzing trace with hash 864210937, now seen corresponding path program 1 times [2021-12-18 20:51:58,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:51:58,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131468755] [2021-12-18 20:51:58,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:58,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:51:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:58,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:51:58,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131468755] [2021-12-18 20:51:58,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131468755] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:51:58,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394893383] [2021-12-18 20:51:58,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:58,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:51:58,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:51:58,560 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) [2021-12-18 20:51:58,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-18 20:51:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:58,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-18 20:51:58,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:58,730 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 20:51:58,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 20:51:58,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:51:58,861 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:51:58,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-18 20:51:58,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-18 20:51:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:58,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:51:59,109 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:51:59,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-18 20:51:59,116 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:51:59,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2021-12-18 20:51:59,122 INFO L388 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 13 treesize of output 9 [2021-12-18 20:51:59,744 INFO L354 Elim1Store]: treesize reduction 18, result has 63.3 percent of original size [2021-12-18 20:51:59,745 INFO L388 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 45 treesize of output 67 [2021-12-18 20:51:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:59,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394893383] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:51:59,861 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:51:59,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2021-12-18 20:51:59,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142143309] [2021-12-18 20:51:59,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:51:59,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-18 20:51:59,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:59,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-18 20:51:59,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=859, Unknown=23, NotChecked=0, Total=1056 [2021-12-18 20:51:59,863 INFO L87 Difference]: Start difference. First operand 181 states and 207 transitions. Second operand has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:00,293 INFO L93 Difference]: Finished difference Result 259 states and 289 transitions. [2021-12-18 20:52:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 20:52:00,293 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-18 20:52:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:00,294 INFO L225 Difference]: With dead ends: 259 [2021-12-18 20:52:00,294 INFO L226 Difference]: Without dead ends: 259 [2021-12-18 20:52:00,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=1166, Unknown=23, NotChecked=0, Total=1482 [2021-12-18 20:52:00,295 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 521 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 666 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:00,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [521 Valid, 740 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 707 Invalid, 0 Unknown, 666 Unchecked, 0.3s Time] [2021-12-18 20:52:00,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-18 20:52:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 184. [2021-12-18 20:52:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 168 states have (on average 1.255952380952381) internal successors, (211), 183 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 211 transitions. [2021-12-18 20:52:00,300 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 211 transitions. Word has length 32 [2021-12-18 20:52:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:00,300 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 211 transitions. [2021-12-18 20:52:00,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 211 transitions. [2021-12-18 20:52:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 20:52:00,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:00,301 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:00,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:00,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:00,501 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:00,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:00,502 INFO L85 PathProgramCache]: Analyzing trace with hash 864210938, now seen corresponding path program 1 times [2021-12-18 20:52:00,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:00,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733023903] [2021-12-18 20:52:00,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:00,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:00,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:00,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733023903] [2021-12-18 20:52:00,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733023903] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:00,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105925614] [2021-12-18 20:52:00,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:00,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:00,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:00,675 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) [2021-12-18 20:52:00,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-18 20:52:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:00,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-18 20:52:00,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:00,905 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:00,905 INFO L388 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 [2021-12-18 20:52:00,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:52:00,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:00,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:01,113 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:01,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:52:01,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:52:01,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:01,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-18 20:52:01,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:01,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:52:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:01,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:01,783 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:01,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 59 [2021-12-18 20:52:01,788 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:01,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2021-12-18 20:52:01,796 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:01,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 89 [2021-12-18 20:52:01,803 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:01,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 134 [2021-12-18 20:52:01,810 INFO L388 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 95 treesize of output 87 [2021-12-18 20:52:01,815 INFO L388 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 87 treesize of output 79 [2021-12-18 20:52:01,819 INFO L388 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 79 treesize of output 75 [2021-12-18 20:52:02,284 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:02,284 INFO L388 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 [2021-12-18 20:52:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:02,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105925614] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:02,383 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:02,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 36 [2021-12-18 20:52:02,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282212493] [2021-12-18 20:52:02,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:02,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-18 20:52:02,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:02,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-18 20:52:02,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1177, Unknown=19, NotChecked=0, Total=1332 [2021-12-18 20:52:02,384 INFO L87 Difference]: Start difference. First operand 184 states and 211 transitions. Second operand has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:02,961 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2021-12-18 20:52:02,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 20:52:02,962 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-18 20:52:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:02,963 INFO L225 Difference]: With dead ends: 206 [2021-12-18 20:52:02,963 INFO L226 Difference]: Without dead ends: 206 [2021-12-18 20:52:02,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=291, Invalid=1852, Unknown=19, NotChecked=0, Total=2162 [2021-12-18 20:52:02,964 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 151 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:02,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 874 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 653 Invalid, 0 Unknown, 297 Unchecked, 0.2s Time] [2021-12-18 20:52:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-18 20:52:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 186. [2021-12-18 20:52:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 170 states have (on average 1.2529411764705882) internal successors, (213), 185 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 213 transitions. [2021-12-18 20:52:02,966 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 213 transitions. Word has length 32 [2021-12-18 20:52:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:02,966 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 213 transitions. [2021-12-18 20:52:02,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 213 transitions. [2021-12-18 20:52:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 20:52:02,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:02,967 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:02,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:03,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:03,168 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:03,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:03,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1555752868, now seen corresponding path program 1 times [2021-12-18 20:52:03,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:03,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745101177] [2021-12-18 20:52:03,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:03,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:03,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:03,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:03,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745101177] [2021-12-18 20:52:03,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745101177] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:03,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892439771] [2021-12-18 20:52:03,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:03,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:03,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:03,339 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) [2021-12-18 20:52:03,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-18 20:52:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:03,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-18 20:52:03,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:03,592 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:03,593 INFO L388 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 [2021-12-18 20:52:03,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:52:03,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:03,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:03,847 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:03,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:52:03,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:52:04,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:04,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-18 20:52:04,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:04,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:52:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:04,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:04,546 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:04,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 59 [2021-12-18 20:52:04,553 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:04,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2021-12-18 20:52:04,562 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:04,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 89 [2021-12-18 20:52:04,568 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:04,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 134 [2021-12-18 20:52:04,573 INFO L388 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 95 treesize of output 87 [2021-12-18 20:52:04,577 INFO L388 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 87 treesize of output 79 [2021-12-18 20:52:04,580 INFO L388 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 79 treesize of output 75 [2021-12-18 20:52:05,037 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:05,039 INFO L388 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 [2021-12-18 20:52:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:05,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892439771] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:05,129 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:05,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 34 [2021-12-18 20:52:05,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853190172] [2021-12-18 20:52:05,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:05,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-18 20:52:05,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:05,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-18 20:52:05,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1036, Unknown=16, NotChecked=0, Total=1190 [2021-12-18 20:52:05,130 INFO L87 Difference]: Start difference. First operand 186 states and 213 transitions. Second operand has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:05,443 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2021-12-18 20:52:05,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 20:52:05,443 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-18 20:52:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:05,444 INFO L225 Difference]: With dead ends: 192 [2021-12-18 20:52:05,444 INFO L226 Difference]: Without dead ends: 192 [2021-12-18 20:52:05,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=1439, Unknown=16, NotChecked=0, Total=1722 [2021-12-18 20:52:05,445 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 122 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:05,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 688 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 479 Invalid, 0 Unknown, 338 Unchecked, 0.2s Time] [2021-12-18 20:52:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-12-18 20:52:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 186. [2021-12-18 20:52:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 170 states have (on average 1.2470588235294118) internal successors, (212), 185 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2021-12-18 20:52:05,448 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 32 [2021-12-18 20:52:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:05,448 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2021-12-18 20:52:05,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2021-12-18 20:52:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-18 20:52:05,449 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:05,449 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:05,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:05,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:05,666 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:05,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:05,666 INFO L85 PathProgramCache]: Analyzing trace with hash 429887975, now seen corresponding path program 1 times [2021-12-18 20:52:05,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:05,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850634488] [2021-12-18 20:52:05,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:05,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 20:52:05,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:05,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850634488] [2021-12-18 20:52:05,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850634488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:52:05,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:52:05,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:52:05,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836930573] [2021-12-18 20:52:05,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:52:05,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:52:05,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:05,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:52:05,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:52:05,693 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:05,733 INFO L93 Difference]: Finished difference Result 183 states and 209 transitions. [2021-12-18 20:52:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:52:05,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-18 20:52:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:05,734 INFO L225 Difference]: With dead ends: 183 [2021-12-18 20:52:05,734 INFO L226 Difference]: Without dead ends: 183 [2021-12-18 20:52:05,734 INFO L932 BasicCegarLoop]: 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 [2021-12-18 20:52:05,735 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:05,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 82 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:52:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-18 20:52:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2021-12-18 20:52:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 169 states have (on average 1.2307692307692308) internal successors, (208), 181 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2021-12-18 20:52:05,738 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 34 [2021-12-18 20:52:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:05,738 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2021-12-18 20:52:05,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2021-12-18 20:52:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-18 20:52:05,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:05,739 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:05,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-18 20:52:05,739 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:05,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash 429888005, now seen corresponding path program 1 times [2021-12-18 20:52:05,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:05,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286584503] [2021-12-18 20:52:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:05,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:05,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:05,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286584503] [2021-12-18 20:52:05,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286584503] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:05,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449527644] [2021-12-18 20:52:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:05,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:05,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:05,928 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) [2021-12-18 20:52:05,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-18 20:52:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:06,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-18 20:52:06,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:06,145 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:06,146 INFO L388 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 [2021-12-18 20:52:06,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:06,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:06,241 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:06,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2021-12-18 20:52:06,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2021-12-18 20:52:06,247 INFO L388 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 32 treesize of output 34 [2021-12-18 20:52:06,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-12-18 20:52:06,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-12-18 20:52:06,340 INFO L388 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 [2021-12-18 20:52:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:06,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:06,402 INFO L388 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 79 treesize of output 57 [2021-12-18 20:52:06,406 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_919 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_919) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_917 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2021-12-18 20:52:06,423 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_919 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_919) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem10#1.offset|)) (forall ((v_ArrVal_917 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem10#1.base|))) is different from false [2021-12-18 20:52:06,428 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_919 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_919) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)))) (forall ((v_ArrVal_917 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_917) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse1)))) is different from false [2021-12-18 20:52:06,435 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:06,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 20:52:06,440 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:06,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2021-12-18 20:52:06,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:52:06,456 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-18 20:52:06,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2021-12-18 20:52:06,575 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:06,575 INFO L388 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 [2021-12-18 20:52:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 20:52:06,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449527644] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:06,617 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:06,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 28 [2021-12-18 20:52:06,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246014591] [2021-12-18 20:52:06,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:06,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-18 20:52:06,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:06,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-18 20:52:06,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=510, Unknown=3, NotChecked=144, Total=756 [2021-12-18 20:52:06,618 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:07,113 INFO L93 Difference]: Finished difference Result 244 states and 270 transitions. [2021-12-18 20:52:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 20:52:07,113 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-18 20:52:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:07,115 INFO L225 Difference]: With dead ends: 244 [2021-12-18 20:52:07,115 INFO L226 Difference]: Without dead ends: 244 [2021-12-18 20:52:07,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=965, Unknown=3, NotChecked=204, Total=1406 [2021-12-18 20:52:07,132 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 489 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 635 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:07,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 686 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 748 Invalid, 0 Unknown, 635 Unchecked, 0.3s Time] [2021-12-18 20:52:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-12-18 20:52:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 181. [2021-12-18 20:52:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 168 states have (on average 1.2321428571428572) internal successors, (207), 180 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 207 transitions. [2021-12-18 20:52:07,138 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 207 transitions. Word has length 34 [2021-12-18 20:52:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:07,138 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 207 transitions. [2021-12-18 20:52:07,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 207 transitions. [2021-12-18 20:52:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 20:52:07,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:07,139 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:07,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:07,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-18 20:52:07,339 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:07,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:07,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1554334094, now seen corresponding path program 1 times [2021-12-18 20:52:07,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:07,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535594140] [2021-12-18 20:52:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:07,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:07,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:07,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535594140] [2021-12-18 20:52:07,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535594140] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:07,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763860598] [2021-12-18 20:52:07,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:07,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:07,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:07,467 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) [2021-12-18 20:52:07,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-18 20:52:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:07,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 20:52:07,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:07,638 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:07,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:07,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:07,788 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:07,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2021-12-18 20:52:07,884 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:07,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2021-12-18 20:52:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:07,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:08,063 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_993 (Array Int Int))) (or (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_993) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)))))) is different from false [2021-12-18 20:52:08,101 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_993 (Array Int Int))) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_993) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)))) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2021-12-18 20:52:08,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_100| Int) (v_ArrVal_993 (Array Int Int))) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_993) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_100| 8)))) (< |v_ULTIMATE.start_main_~p~0#1.offset_100| 0) (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_100|))) is different from false [2021-12-18 20:52:08,121 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:08,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-18 20:52:08,127 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:08,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-12-18 20:52:08,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-12-18 20:52:08,337 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:08,338 INFO L388 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 [2021-12-18 20:52:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 20:52:08,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763860598] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:08,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:08,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2021-12-18 20:52:08,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120999934] [2021-12-18 20:52:08,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:08,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-18 20:52:08,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:08,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-18 20:52:08,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2021-12-18 20:52:08,382 INFO L87 Difference]: Start difference. First operand 181 states and 207 transitions. Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:08,896 INFO L93 Difference]: Finished difference Result 203 states and 228 transitions. [2021-12-18 20:52:08,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-18 20:52:08,897 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-18 20:52:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:08,897 INFO L225 Difference]: With dead ends: 203 [2021-12-18 20:52:08,897 INFO L226 Difference]: Without dead ends: 202 [2021-12-18 20:52:08,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=1544, Unknown=4, NotChecked=252, Total=2070 [2021-12-18 20:52:08,898 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 71 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:08,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 766 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 427 Invalid, 0 Unknown, 394 Unchecked, 0.2s Time] [2021-12-18 20:52:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-18 20:52:08,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2021-12-18 20:52:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 173 states have (on average 1.2196531791907514) internal successors, (211), 185 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 211 transitions. [2021-12-18 20:52:08,901 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 211 transitions. Word has length 35 [2021-12-18 20:52:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:08,901 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 211 transitions. [2021-12-18 20:52:08,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 211 transitions. [2021-12-18 20:52:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 20:52:08,901 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:08,901 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:08,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:09,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-18 20:52:09,111 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:09,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 357730772, now seen corresponding path program 1 times [2021-12-18 20:52:09,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:09,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263042408] [2021-12-18 20:52:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:09,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:52:09,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:09,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263042408] [2021-12-18 20:52:09,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263042408] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:09,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660188064] [2021-12-18 20:52:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:09,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:09,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:09,187 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) [2021-12-18 20:52:09,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-18 20:52:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:09,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 20:52:09,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:09,402 INFO L388 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 [2021-12-18 20:52:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:09,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:09,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660188064] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:09,493 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:09,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2021-12-18 20:52:09,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581218113] [2021-12-18 20:52:09,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:09,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-18 20:52:09,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:09,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-18 20:52:09,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-12-18 20:52:09,495 INFO L87 Difference]: Start difference. First operand 186 states and 211 transitions. Second operand has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:09,657 INFO L93 Difference]: Finished difference Result 427 states and 483 transitions. [2021-12-18 20:52:09,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-18 20:52:09,657 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-18 20:52:09,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:09,658 INFO L225 Difference]: With dead ends: 427 [2021-12-18 20:52:09,658 INFO L226 Difference]: Without dead ends: 427 [2021-12-18 20:52:09,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2021-12-18 20:52:09,659 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 672 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:09,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [672 Valid, 459 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:52:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-12-18 20:52:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 252. [2021-12-18 20:52:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 239 states have (on average 1.297071129707113) internal successors, (310), 251 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 310 transitions. [2021-12-18 20:52:09,667 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 310 transitions. Word has length 36 [2021-12-18 20:52:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:09,667 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 310 transitions. [2021-12-18 20:52:09,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 310 transitions. [2021-12-18 20:52:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 20:52:09,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:09,668 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:09,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:09,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-18 20:52:09,885 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:09,885 INFO L85 PathProgramCache]: Analyzing trace with hash -929852094, now seen corresponding path program 1 times [2021-12-18 20:52:09,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:09,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498652162] [2021-12-18 20:52:09,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:09,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 20:52:09,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:09,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498652162] [2021-12-18 20:52:09,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498652162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:52:09,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:52:09,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 20:52:09,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238174292] [2021-12-18 20:52:09,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:52:09,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:52:09,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:09,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:52:09,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:52:09,919 INFO L87 Difference]: Start difference. First operand 252 states and 310 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:09,991 INFO L93 Difference]: Finished difference Result 251 states and 308 transitions. [2021-12-18 20:52:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:52:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 37 [2021-12-18 20:52:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:09,992 INFO L225 Difference]: With dead ends: 251 [2021-12-18 20:52:09,992 INFO L226 Difference]: Without dead ends: 251 [2021-12-18 20:52:09,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:52:09,993 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 5 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:09,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 181 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:52:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-12-18 20:52:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2021-12-18 20:52:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 237 states have (on average 1.2953586497890295) internal successors, (307), 249 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 307 transitions. [2021-12-18 20:52:10,000 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 307 transitions. Word has length 37 [2021-12-18 20:52:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:10,000 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 307 transitions. [2021-12-18 20:52:10,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 307 transitions. [2021-12-18 20:52:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-18 20:52:10,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:10,001 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:10,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-18 20:52:10,002 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:10,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1693817782, now seen corresponding path program 1 times [2021-12-18 20:52:10,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:10,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476050516] [2021-12-18 20:52:10,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:10,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:52:10,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:10,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476050516] [2021-12-18 20:52:10,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476050516] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:10,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74738334] [2021-12-18 20:52:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:10,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:10,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:10,132 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) [2021-12-18 20:52:10,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-18 20:52:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:10,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-18 20:52:10,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:10,312 INFO L388 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 [2021-12-18 20:52:10,354 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:10,355 INFO L388 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 [2021-12-18 20:52:10,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:10,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:10,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:52:10,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:52:10,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:10,516 INFO L388 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 [2021-12-18 20:52:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:52:10,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:10,596 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1173 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2021-12-18 20:52:10,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1173 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2021-12-18 20:52:10,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1173 (Array Int Int))) (< (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1173) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2021-12-18 20:52:10,627 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1173 (Array Int Int)) (v_ArrVal_1170 Int)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1170)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2021-12-18 20:52:10,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:10,669 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:10,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2021-12-18 20:52:10,680 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:10,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2021-12-18 20:52:10,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-18 20:52:10,817 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:10,818 INFO L388 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 [2021-12-18 20:52:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-12-18 20:52:10,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74738334] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:10,858 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:10,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 33 [2021-12-18 20:52:10,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730651926] [2021-12-18 20:52:10,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:10,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-18 20:52:10,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:10,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-18 20:52:10,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=681, Unknown=4, NotChecked=228, Total=1056 [2021-12-18 20:52:10,859 INFO L87 Difference]: Start difference. First operand 250 states and 307 transitions. Second operand has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:10,951 WARN L838 $PredicateComparison]: unable to prove that (and (< (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_1173 (Array Int Int)) (v_ArrVal_1170 Int)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1170)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (< (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 3) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) is different from false [2021-12-18 20:52:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:11,743 INFO L93 Difference]: Finished difference Result 508 states and 609 transitions. [2021-12-18 20:52:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-18 20:52:11,743 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-18 20:52:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:11,745 INFO L225 Difference]: With dead ends: 508 [2021-12-18 20:52:11,745 INFO L226 Difference]: Without dead ends: 508 [2021-12-18 20:52:11,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=437, Invalid=1648, Unknown=5, NotChecked=460, Total=2550 [2021-12-18 20:52:11,746 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 530 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 2521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1096 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:11,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [530 Valid, 1153 Invalid, 2521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1315 Invalid, 0 Unknown, 1096 Unchecked, 0.5s Time] [2021-12-18 20:52:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-12-18 20:52:11,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 245. [2021-12-18 20:52:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 232 states have (on average 1.2974137931034482) internal successors, (301), 244 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 301 transitions. [2021-12-18 20:52:11,766 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 301 transitions. Word has length 38 [2021-12-18 20:52:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:11,766 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 301 transitions. [2021-12-18 20:52:11,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 301 transitions. [2021-12-18 20:52:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-18 20:52:11,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:11,767 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:11,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:11,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-18 20:52:11,985 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash 504664910, now seen corresponding path program 1 times [2021-12-18 20:52:11,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:11,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759248365] [2021-12-18 20:52:11,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:11,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 20:52:12,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:12,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759248365] [2021-12-18 20:52:12,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759248365] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:12,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939898502] [2021-12-18 20:52:12,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:12,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:12,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:12,189 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) [2021-12-18 20:52:12,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-18 20:52:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:12,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-18 20:52:12,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:12,400 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:12,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:12,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:12,553 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:12,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2021-12-18 20:52:12,728 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:12,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2021-12-18 20:52:12,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:52:12,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:12,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1246) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)))) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2021-12-18 20:52:13,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1246) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)))) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2021-12-18 20:52:13,034 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_121| Int) (v_ArrVal_1246 (Array Int Int))) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1246) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_121| 8)))) (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_121|) (< |v_ULTIMATE.start_main_~p~0#1.offset_121| 0))) is different from false [2021-12-18 20:52:13,041 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:13,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-18 20:52:13,050 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:13,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-12-18 20:52:13,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-12-18 20:52:13,278 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:13,278 INFO L388 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 [2021-12-18 20:52:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2021-12-18 20:52:13,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939898502] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:13,322 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:13,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 32 [2021-12-18 20:52:13,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407677751] [2021-12-18 20:52:13,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:13,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-18 20:52:13,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:13,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-18 20:52:13,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=728, Unknown=3, NotChecked=168, Total=992 [2021-12-18 20:52:13,323 INFO L87 Difference]: Start difference. First operand 245 states and 301 transitions. Second operand has 32 states, 32 states have (on average 3.4375) internal successors, (110), 32 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:13,904 INFO L93 Difference]: Finished difference Result 310 states and 387 transitions. [2021-12-18 20:52:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-18 20:52:13,904 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.4375) internal successors, (110), 32 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-18 20:52:13,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:13,905 INFO L225 Difference]: With dead ends: 310 [2021-12-18 20:52:13,905 INFO L226 Difference]: Without dead ends: 310 [2021-12-18 20:52:13,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=1657, Unknown=3, NotChecked=258, Total=2162 [2021-12-18 20:52:13,906 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 131 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:13,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 949 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 398 Invalid, 0 Unknown, 401 Unchecked, 0.2s Time] [2021-12-18 20:52:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-12-18 20:52:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 272. [2021-12-18 20:52:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 259 states have (on average 1.3166023166023166) internal successors, (341), 271 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 341 transitions. [2021-12-18 20:52:13,911 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 341 transitions. Word has length 43 [2021-12-18 20:52:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:13,911 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 341 transitions. [2021-12-18 20:52:13,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.4375) internal successors, (110), 32 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 341 transitions. [2021-12-18 20:52:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-18 20:52:13,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:13,912 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:13,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:14,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:14,112 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:14,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1038799272, now seen corresponding path program 2 times [2021-12-18 20:52:14,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:14,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66435710] [2021-12-18 20:52:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:14,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:14,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:14,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66435710] [2021-12-18 20:52:14,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66435710] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:14,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367317032] [2021-12-18 20:52:14,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:52:14,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:14,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:14,304 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) [2021-12-18 20:52:14,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-18 20:52:14,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:52:14,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:52:14,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-18 20:52:14,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:14,517 INFO L388 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 [2021-12-18 20:52:14,539 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:14,539 INFO L388 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 [2021-12-18 20:52:14,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:14,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:52:14,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:14,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:52:14,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:14,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:14,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:14,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:14,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:52:14,773 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-18 20:52:14,774 INFO L388 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 19 treesize of output 22 [2021-12-18 20:52:14,922 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:14,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-12-18 20:52:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:14,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:16,973 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 2)))) is different from false [2021-12-18 20:52:18,989 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_#t~mem10#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 2)))) is different from false [2021-12-18 20:52:20,995 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_135| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_135| (store (select |c_#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_135|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= 3 .cse0)))) is different from false [2021-12-18 20:52:21,003 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1363 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_135| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1363))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= 3 .cse0)))) is different from false [2021-12-18 20:52:21,013 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1363 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_135| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1363))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 2)))) is different from false [2021-12-18 20:52:21,063 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1363 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_135| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1363))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= 3 .cse0)))) is different from false [2021-12-18 20:52:21,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1363 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_135| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1363))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= 3 .cse0)))) is different from false [2021-12-18 20:52:21,078 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1363 (Array Int Int)) (v_ArrVal_1359 Int) (|v_ULTIMATE.start_main_~p~0#1.base_135| Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1359)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1363))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 2)))) is different from false [2021-12-18 20:52:21,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:21,159 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:21,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2021-12-18 20:52:21,171 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:21,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 273 [2021-12-18 20:52:21,177 INFO L388 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 257 treesize of output 241 [2021-12-18 20:52:21,231 INFO L388 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 56 treesize of output 52 [2021-12-18 20:52:21,264 INFO L388 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 75 treesize of output 69 [2021-12-18 20:52:21,335 INFO L388 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 93 treesize of output 87 [2021-12-18 20:52:21,416 INFO L388 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 75 treesize of output 69 [2021-12-18 20:52:21,464 INFO L388 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 75 treesize of output 69 [2021-12-18 20:52:21,610 INFO L388 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 6 treesize of output 4 [2021-12-18 20:52:21,837 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:21,837 INFO L388 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 27 treesize of output 29 [2021-12-18 20:52:21,952 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:21,953 INFO L388 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 [2021-12-18 20:52:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2021-12-18 20:52:22,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367317032] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:22,003 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:22,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 18] total 46 [2021-12-18 20:52:22,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421335304] [2021-12-18 20:52:22,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:22,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-18 20:52:22,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-18 20:52:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1209, Unknown=8, NotChecked=632, Total=2070 [2021-12-18 20:52:22,005 INFO L87 Difference]: Start difference. First operand 272 states and 341 transitions. Second operand has 46 states, 46 states have (on average 2.5434782608695654) internal successors, (117), 46 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:22,092 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 2) (forall ((v_ArrVal_1363 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_135| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1363))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= 3 .cse0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse2)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse2 |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2021-12-18 20:52:22,098 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= |c_ULTIMATE.start_main_#t~mem10#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1363 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_135| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1363))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= 3 .cse0)))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_#t~mem10#1.base|))) is different from false [2021-12-18 20:52:22,104 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (forall ((v_ArrVal_1363 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_135| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1363))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 2)))) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2021-12-18 20:52:22,208 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (forall ((v_ArrVal_1363 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_135| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1363))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_135|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= 3 .cse0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0)) is different from false [2021-12-18 20:52:24,235 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_135| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_135| (store (select |c_#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_135|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= 3 .cse0)))) (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-18 20:52:25,009 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_#t~mem10#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 2)))) (= |c_ULTIMATE.start_main_#t~mem10#1.offset| 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_#t~mem10#1.base|))) is different from false [2021-12-18 20:52:25,838 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 2))))) is different from false [2021-12-18 20:52:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:26,093 INFO L93 Difference]: Finished difference Result 531 states and 657 transitions. [2021-12-18 20:52:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-18 20:52:26,093 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.5434782608695654) internal successors, (117), 46 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-18 20:52:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:26,095 INFO L225 Difference]: With dead ends: 531 [2021-12-18 20:52:26,095 INFO L226 Difference]: Without dead ends: 531 [2021-12-18 20:52:26,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=341, Invalid=1866, Unknown=15, NotChecked=1560, Total=3782 [2021-12-18 20:52:26,096 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 393 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1520 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:26,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 1035 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 858 Invalid, 0 Unknown, 1520 Unchecked, 0.3s Time] [2021-12-18 20:52:26,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-12-18 20:52:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 288. [2021-12-18 20:52:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 275 states have (on average 1.309090909090909) internal successors, (360), 287 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 360 transitions. [2021-12-18 20:52:26,100 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 360 transitions. Word has length 43 [2021-12-18 20:52:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:26,101 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 360 transitions. [2021-12-18 20:52:26,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.5434782608695654) internal successors, (117), 46 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 360 transitions. [2021-12-18 20:52:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-18 20:52:26,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:26,101 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:26,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:26,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-18 20:52:26,312 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:26,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1038491442, now seen corresponding path program 2 times [2021-12-18 20:52:26,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:26,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682141125] [2021-12-18 20:52:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:26,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:26,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:26,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682141125] [2021-12-18 20:52:26,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682141125] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:26,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222098737] [2021-12-18 20:52:26,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:52:26,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:26,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:26,629 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) [2021-12-18 20:52:26,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-18 20:52:26,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:52:26,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:52:26,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-18 20:52:26,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:26,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:26,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:26,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:52:26,918 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:26,919 INFO L388 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 [2021-12-18 20:52:26,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:26,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:52:26,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:26,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-18 20:52:27,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:27,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:27,058 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:27,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:27,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:27,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:27,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:52:27,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:27,190 INFO L388 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 [2021-12-18 20:52:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:27,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:27,250 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1489) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2021-12-18 20:52:27,260 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1489) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2021-12-18 20:52:27,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1489) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2021-12-18 20:52:27,271 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1487 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1487) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1489) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2021-12-18 20:52:27,445 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:27,446 INFO L388 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 [2021-12-18 20:52:27,453 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 Int) (v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1487 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_33| Int)) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1482)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1487) |v_ULTIMATE.start_main_~t~0#1.base_33| v_ArrVal_1489) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~p~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_33|))) is different from false [2021-12-18 20:52:27,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:27,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:27,705 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:27,709 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:27,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2021-12-18 20:52:27,719 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-18 20:52:27,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 129 [2021-12-18 20:52:27,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2021-12-18 20:52:27,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2021-12-18 20:52:27,734 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:27,734 INFO L388 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 [2021-12-18 20:52:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-18 20:52:27,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222098737] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:27,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:27,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 40 [2021-12-18 20:52:27,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088462422] [2021-12-18 20:52:27,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:27,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-18 20:52:27,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:27,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-18 20:52:27,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=20, NotChecked=350, Total=1560 [2021-12-18 20:52:27,854 INFO L87 Difference]: Start difference. First operand 288 states and 360 transitions. Second operand has 40 states, 40 states have (on average 2.35) internal successors, (94), 40 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:28,158 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_1489 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1489) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_#t~mem10#1.base|)) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1487 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_33| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_33|))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1487) |v_ULTIMATE.start_main_~t~0#1.base_33| v_ArrVal_1489) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) is different from false [2021-12-18 20:52:29,129 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1487 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1487) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1489) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2021-12-18 20:52:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:29,359 INFO L93 Difference]: Finished difference Result 477 states and 586 transitions. [2021-12-18 20:52:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-18 20:52:29,360 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.35) internal successors, (94), 40 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-18 20:52:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:29,361 INFO L225 Difference]: With dead ends: 477 [2021-12-18 20:52:29,361 INFO L226 Difference]: Without dead ends: 477 [2021-12-18 20:52:29,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 65 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=426, Invalid=1824, Unknown=34, NotChecked=686, Total=2970 [2021-12-18 20:52:29,362 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 499 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1605 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:29,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 1002 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 901 Invalid, 0 Unknown, 1605 Unchecked, 0.4s Time] [2021-12-18 20:52:29,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-12-18 20:52:29,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 307. [2021-12-18 20:52:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 294 states have (on average 1.2925170068027212) internal successors, (380), 306 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 380 transitions. [2021-12-18 20:52:29,367 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 380 transitions. Word has length 43 [2021-12-18 20:52:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:29,367 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 380 transitions. [2021-12-18 20:52:29,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.35) internal successors, (94), 40 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 380 transitions. [2021-12-18 20:52:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-18 20:52:29,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:29,368 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:29,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-18 20:52:29,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-18 20:52:29,584 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:29,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:29,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1656585800, now seen corresponding path program 1 times [2021-12-18 20:52:29,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:29,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300077730] [2021-12-18 20:52:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:29,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:29,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:29,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300077730] [2021-12-18 20:52:29,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300077730] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:29,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011355306] [2021-12-18 20:52:29,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:29,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:29,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:29,807 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) [2021-12-18 20:52:29,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-18 20:52:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:29,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-18 20:52:29,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:30,023 INFO L388 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 [2021-12-18 20:52:30,053 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:30,053 INFO L388 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 [2021-12-18 20:52:30,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:30,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:52:30,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:30,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:52:30,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:30,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:30,255 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:30,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:30,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:30,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:30,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:52:30,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:30,420 INFO L388 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 [2021-12-18 20:52:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:30,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:30,446 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1609 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1609) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-18 20:52:30,455 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1609 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1609) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-18 20:52:30,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1609 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1609) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-18 20:52:30,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1609 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1607) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1609) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-18 20:52:30,496 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1609 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1607) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1609) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|))))) is different from false [2021-12-18 20:52:30,546 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1609 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1607) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1609) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|))))) is different from false [2021-12-18 20:52:30,585 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:30,585 INFO L388 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 [2021-12-18 20:52:30,592 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1609 (Array Int Int)) (v_ArrVal_1607 (Array Int Int)) (v_ArrVal_1603 Int)) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1603)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1607) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1609) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (= |v_ULTIMATE.start_main_~t~0#1.base_36| |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2021-12-18 20:52:30,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:30,656 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:30,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2021-12-18 20:52:30,663 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:30,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 121 [2021-12-18 20:52:30,668 INFO L388 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 [2021-12-18 20:52:30,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2021-12-18 20:52:30,835 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:30,835 INFO L388 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 [2021-12-18 20:52:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2021-12-18 20:52:30,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011355306] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:30,880 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:30,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2021-12-18 20:52:30,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196973479] [2021-12-18 20:52:30,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:30,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-18 20:52:30,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:30,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-18 20:52:30,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1005, Unknown=13, NotChecked=504, Total=1722 [2021-12-18 20:52:30,882 INFO L87 Difference]: Start difference. First operand 307 states and 380 transitions. Second operand has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 42 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) [2021-12-18 20:52:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:37,062 INFO L93 Difference]: Finished difference Result 668 states and 826 transitions. [2021-12-18 20:52:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-18 20:52:37,063 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 42 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) Word has length 43 [2021-12-18 20:52:37,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:37,065 INFO L225 Difference]: With dead ends: 668 [2021-12-18 20:52:37,065 INFO L226 Difference]: Without dead ends: 668 [2021-12-18 20:52:37,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 64 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=574, Invalid=2488, Unknown=46, NotChecked=798, Total=3906 [2021-12-18 20:52:37,066 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 587 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 2679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1814 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:37,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [587 Valid, 896 Invalid, 2679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 740 Invalid, 0 Unknown, 1814 Unchecked, 0.3s Time] [2021-12-18 20:52:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-12-18 20:52:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 429. [2021-12-18 20:52:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 416 states have (on average 1.2644230769230769) internal successors, (526), 428 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 526 transitions. [2021-12-18 20:52:37,073 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 526 transitions. Word has length 43 [2021-12-18 20:52:37,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:37,073 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 526 transitions. [2021-12-18 20:52:37,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 42 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) [2021-12-18 20:52:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 526 transitions. [2021-12-18 20:52:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-18 20:52:37,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:37,074 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:37,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:37,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:37,292 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:37,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1817186972, now seen corresponding path program 1 times [2021-12-18 20:52:37,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:37,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716455975] [2021-12-18 20:52:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:37,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:37,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:37,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716455975] [2021-12-18 20:52:37,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716455975] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:37,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573170212] [2021-12-18 20:52:37,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:37,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:37,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:37,401 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) [2021-12-18 20:52:37,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-18 20:52:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:37,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-18 20:52:37,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:37,631 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:37,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:37,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:37,771 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:37,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2021-12-18 20:52:37,925 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:37,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2021-12-18 20:52:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:52:37,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:38,148 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1682 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1682) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)))) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2021-12-18 20:52:38,193 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1682 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1682) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)))))) is different from false [2021-12-18 20:52:38,201 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_146| Int) (v_ArrVal_1682 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~p~0#1.offset_146| 0) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1682) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_146| 8)))) (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_146|))) is different from false [2021-12-18 20:52:38,207 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:38,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-18 20:52:38,212 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:38,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-12-18 20:52:38,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-12-18 20:52:38,435 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:38,436 INFO L388 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 [2021-12-18 20:52:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2021-12-18 20:52:38,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573170212] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:38,467 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:38,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2021-12-18 20:52:38,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621444673] [2021-12-18 20:52:38,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:38,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-18 20:52:38,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:38,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-18 20:52:38,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=724, Unknown=3, NotChecked=168, Total=992 [2021-12-18 20:52:38,469 INFO L87 Difference]: Start difference. First operand 429 states and 526 transitions. Second operand has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 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) [2021-12-18 20:52:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:39,391 INFO L93 Difference]: Finished difference Result 545 states and 659 transitions. [2021-12-18 20:52:39,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-18 20:52:39,391 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-18 20:52:39,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:39,393 INFO L225 Difference]: With dead ends: 545 [2021-12-18 20:52:39,393 INFO L226 Difference]: Without dead ends: 545 [2021-12-18 20:52:39,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 66 SyntacticMatches, 14 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=428, Invalid=2233, Unknown=3, NotChecked=306, Total=2970 [2021-12-18 20:52:39,394 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 396 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 652 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:39,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 869 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 581 Invalid, 0 Unknown, 652 Unchecked, 0.2s Time] [2021-12-18 20:52:39,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-12-18 20:52:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 425. [2021-12-18 20:52:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 412 states have (on average 1.266990291262136) internal successors, (522), 424 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 522 transitions. [2021-12-18 20:52:39,399 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 522 transitions. Word has length 43 [2021-12-18 20:52:39,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:39,399 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 522 transitions. [2021-12-18 20:52:39,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 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) [2021-12-18 20:52:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 522 transitions. [2021-12-18 20:52:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-18 20:52:39,399 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:39,399 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:39,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:39,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:39,610 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:39,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:39,610 INFO L85 PathProgramCache]: Analyzing trace with hash 745076370, now seen corresponding path program 1 times [2021-12-18 20:52:39,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:39,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711049029] [2021-12-18 20:52:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:39,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:39,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:39,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711049029] [2021-12-18 20:52:39,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711049029] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:39,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878455596] [2021-12-18 20:52:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:39,782 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:39,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:39,783 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) [2021-12-18 20:52:39,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-18 20:52:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:39,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-18 20:52:39,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:40,009 INFO L388 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 [2021-12-18 20:52:40,038 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:40,038 INFO L388 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 [2021-12-18 20:52:40,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:40,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:52:40,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:40,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:52:40,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:40,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:40,235 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:40,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:40,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:40,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:40,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:52:40,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:40,398 INFO L388 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 [2021-12-18 20:52:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:40,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:40,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1802) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2021-12-18 20:52:40,433 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1802) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2021-12-18 20:52:40,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1802) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2021-12-18 20:52:40,441 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1802) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2021-12-18 20:52:40,477 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_40| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1801) |v_ULTIMATE.start_main_~t~0#1.base_40| v_ArrVal_1802) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|))))) is different from false [2021-12-18 20:52:40,530 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_40| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1801) |v_ULTIMATE.start_main_~t~0#1.base_40| v_ArrVal_1802) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2021-12-18 20:52:40,568 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:40,568 INFO L388 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 [2021-12-18 20:52:40,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_40| Int) (v_ArrVal_1794 Int)) (or (= |c_ULTIMATE.start_main_~p~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_40|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1794)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1801) |v_ULTIMATE.start_main_~t~0#1.base_40| v_ArrVal_1802) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2021-12-18 20:52:40,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:40,657 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:40,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2021-12-18 20:52:40,663 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:40,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 121 [2021-12-18 20:52:40,667 INFO L388 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 [2021-12-18 20:52:40,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2021-12-18 20:52:40,808 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:40,808 INFO L388 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 [2021-12-18 20:52:40,853 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2021-12-18 20:52:40,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878455596] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:40,853 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:40,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2021-12-18 20:52:40,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614066856] [2021-12-18 20:52:40,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:40,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-18 20:52:40,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:40,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-18 20:52:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1005, Unknown=13, NotChecked=504, Total=1722 [2021-12-18 20:52:40,854 INFO L87 Difference]: Start difference. First operand 425 states and 522 transitions. Second operand has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 42 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) [2021-12-18 20:52:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:41,693 INFO L93 Difference]: Finished difference Result 625 states and 763 transitions. [2021-12-18 20:52:41,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-18 20:52:41,693 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 42 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) Word has length 43 [2021-12-18 20:52:41,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:41,695 INFO L225 Difference]: With dead ends: 625 [2021-12-18 20:52:41,695 INFO L226 Difference]: Without dead ends: 625 [2021-12-18 20:52:41,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=463, Invalid=1903, Unknown=14, NotChecked=700, Total=3080 [2021-12-18 20:52:41,696 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 374 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 3457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2181 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:41,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 1085 Invalid, 3457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1197 Invalid, 0 Unknown, 2181 Unchecked, 0.5s Time] [2021-12-18 20:52:41,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-12-18 20:52:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 471. [2021-12-18 20:52:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 458 states have (on average 1.259825327510917) internal successors, (577), 470 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 577 transitions. [2021-12-18 20:52:41,703 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 577 transitions. Word has length 43 [2021-12-18 20:52:41,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:41,703 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 577 transitions. [2021-12-18 20:52:41,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 42 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) [2021-12-18 20:52:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 577 transitions. [2021-12-18 20:52:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-18 20:52:41,704 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:41,704 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:41,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:41,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:41,924 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:41,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1853684670, now seen corresponding path program 2 times [2021-12-18 20:52:41,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:41,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851288072] [2021-12-18 20:52:41,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:41,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:42,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:42,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851288072] [2021-12-18 20:52:42,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851288072] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:42,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942387436] [2021-12-18 20:52:42,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:52:42,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:42,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:42,095 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) [2021-12-18 20:52:42,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-18 20:52:42,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:52:42,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:52:42,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-18 20:52:42,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:42,334 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:42,334 INFO L388 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 [2021-12-18 20:52:42,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:42,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:52:42,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:52:42,476 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:42,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:42,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:52:42,639 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-18 20:52:42,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 59 [2021-12-18 20:52:42,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-12-18 20:52:42,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-18 20:52:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:42,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:42,805 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1917 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1917) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) 1)) is different from false [2021-12-18 20:52:42,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1917 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1917) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) 1)) is different from false [2021-12-18 20:52:42,817 INFO L354 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2021-12-18 20:52:42,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2021-12-18 20:52:42,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_1917 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1917) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) is different from false [2021-12-18 20:52:42,855 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:42,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2021-12-18 20:52:42,986 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:42,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-18 20:52:42,992 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:42,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 89 [2021-12-18 20:52:42,999 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:43,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 68 [2021-12-18 20:52:43,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2021-12-18 20:52:43,010 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:43,010 INFO L388 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 [2021-12-18 20:52:43,218 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:43,219 INFO L388 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 [2021-12-18 20:52:43,272 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-18 20:52:43,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942387436] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:43,272 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:43,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 38 [2021-12-18 20:52:43,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836205385] [2021-12-18 20:52:43,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:43,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-18 20:52:43,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:43,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-18 20:52:43,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1087, Unknown=15, NotChecked=210, Total=1482 [2021-12-18 20:52:43,274 INFO L87 Difference]: Start difference. First operand 471 states and 577 transitions. Second operand has 39 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 39 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) [2021-12-18 20:52:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:43,988 INFO L93 Difference]: Finished difference Result 595 states and 727 transitions. [2021-12-18 20:52:43,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-18 20:52:43,988 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-18 20:52:43,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:43,990 INFO L225 Difference]: With dead ends: 595 [2021-12-18 20:52:43,990 INFO L226 Difference]: Without dead ends: 595 [2021-12-18 20:52:43,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 67 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=461, Invalid=2292, Unknown=15, NotChecked=312, Total=3080 [2021-12-18 20:52:43,994 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 613 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1023 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:43,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 827 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 732 Invalid, 0 Unknown, 1023 Unchecked, 0.3s Time] [2021-12-18 20:52:43,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-12-18 20:52:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 501. [2021-12-18 20:52:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 488 states have (on average 1.2540983606557377) internal successors, (612), 500 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 612 transitions. [2021-12-18 20:52:44,001 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 612 transitions. Word has length 45 [2021-12-18 20:52:44,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:44,001 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 612 transitions. [2021-12-18 20:52:44,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 39 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) [2021-12-18 20:52:44,001 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 612 transitions. [2021-12-18 20:52:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-18 20:52:44,002 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:44,002 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:44,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:44,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-18 20:52:44,216 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:44,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:44,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1853684671, now seen corresponding path program 2 times [2021-12-18 20:52:44,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:44,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909251170] [2021-12-18 20:52:44,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:44,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:44,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:44,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909251170] [2021-12-18 20:52:44,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909251170] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:44,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214968172] [2021-12-18 20:52:44,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:52:44,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:44,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:44,521 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) [2021-12-18 20:52:44,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-18 20:52:44,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:52:44,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:52:44,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-18 20:52:44,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:44,804 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:44,805 INFO L388 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 [2021-12-18 20:52:44,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:44,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:44,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:44,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:52:45,002 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:45,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2021-12-18 20:52:45,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:45,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:52:45,101 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:45,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2021-12-18 20:52:45,156 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:45,157 INFO L388 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 [2021-12-18 20:52:45,230 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-12-18 20:52:45,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2021-12-18 20:52:45,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:45,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:52:45,473 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-18 20:52:45,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 71 [2021-12-18 20:52:45,476 INFO L388 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 20 treesize of output 22 [2021-12-18 20:52:45,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-12-18 20:52:45,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:45,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-18 20:52:45,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:45,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:52:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:45,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:45,710 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2037 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2037) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (forall ((v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2037) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2038) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2021-12-18 20:52:45,728 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2037 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2037) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (forall ((v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2037) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2038) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2021-12-18 20:52:45,733 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2037) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2038) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (forall ((v_ArrVal_2037 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2037) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))))) is different from false [2021-12-18 20:52:45,747 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:45,747 INFO L388 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 62 treesize of output 66 [2021-12-18 20:52:45,790 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (forall ((v_ArrVal_2038 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2038) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (forall ((v_ArrVal_2037 (Array Int Int)) (v_ArrVal_2035 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2037) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))))) is different from false [2021-12-18 20:52:45,857 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:45,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2021-12-18 20:52:45,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:45,871 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:45,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:45,903 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:45,918 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:45,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,020 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,034 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,082 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,093 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,133 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,143 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,191 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,203 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,255 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,266 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,308 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,319 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,361 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,373 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,412 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:46,438 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:46,507 INFO L388 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 38 treesize of output 30 [2021-12-18 20:52:46,515 INFO L388 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 36 treesize of output 28 [2021-12-18 20:52:46,533 INFO L388 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 38 treesize of output 30 [2021-12-18 20:52:46,540 INFO L388 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 36 treesize of output 28 [2021-12-18 20:52:46,633 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:46,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 81 [2021-12-18 20:52:46,638 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:46,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 81 [2021-12-18 20:52:46,646 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:46,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 287 treesize of output 278 [2021-12-18 20:52:46,655 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:46,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 338 [2021-12-18 20:52:46,663 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:46,664 INFO L388 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 348 treesize of output 296 [2021-12-18 20:52:46,679 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:46,680 INFO L388 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 302 treesize of output 301 [2021-12-18 20:52:46,687 INFO L388 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 239 treesize of output 231 [2021-12-18 20:52:46,691 INFO L388 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 231 treesize of output 215 [2021-12-18 20:52:46,695 INFO L388 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 215 treesize of output 211 [2021-12-18 20:52:46,699 INFO L388 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 211 treesize of output 203 [2021-12-18 20:52:46,703 INFO L388 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 203 treesize of output 195 [2021-12-18 20:52:47,040 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:47,040 INFO L388 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 [2021-12-18 20:52:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-18 20:52:47,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214968172] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:47,097 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:47,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 46 [2021-12-18 20:52:47,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163493532] [2021-12-18 20:52:47,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:47,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-18 20:52:47,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:47,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-18 20:52:47,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1612, Unknown=17, NotChecked=340, Total=2162 [2021-12-18 20:52:47,098 INFO L87 Difference]: Start difference. First operand 501 states and 612 transitions. Second operand has 47 states, 46 states have (on average 2.782608695652174) internal successors, (128), 47 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:49,452 INFO L93 Difference]: Finished difference Result 598 states and 724 transitions. [2021-12-18 20:52:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-18 20:52:49,455 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.782608695652174) internal successors, (128), 47 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-18 20:52:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:49,457 INFO L225 Difference]: With dead ends: 598 [2021-12-18 20:52:49,457 INFO L226 Difference]: Without dead ends: 598 [2021-12-18 20:52:49,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=481, Invalid=3422, Unknown=19, NotChecked=500, Total=4422 [2021-12-18 20:52:49,458 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 348 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1046 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:49,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 1322 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 808 Invalid, 0 Unknown, 1046 Unchecked, 0.3s Time] [2021-12-18 20:52:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-12-18 20:52:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 507. [2021-12-18 20:52:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 494 states have (on average 1.2550607287449393) internal successors, (620), 506 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 620 transitions. [2021-12-18 20:52:49,480 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 620 transitions. Word has length 45 [2021-12-18 20:52:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:49,481 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 620 transitions. [2021-12-18 20:52:49,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.782608695652174) internal successors, (128), 47 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 620 transitions. [2021-12-18 20:52:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-18 20:52:49,481 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:49,482 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:49,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:49,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-12-18 20:52:49,695 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:49,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1453916066, now seen corresponding path program 1 times [2021-12-18 20:52:49,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:49,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264405144] [2021-12-18 20:52:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:49,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:49,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264405144] [2021-12-18 20:52:49,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264405144] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399429914] [2021-12-18 20:52:49,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:49,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:49,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:49,922 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) [2021-12-18 20:52:49,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-18 20:52:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:50,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-18 20:52:50,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:50,162 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:50,163 INFO L388 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 [2021-12-18 20:52:50,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:50,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:52:50,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:52:50,285 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:50,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:50,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:52:50,448 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-18 20:52:50,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 59 [2021-12-18 20:52:50,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-12-18 20:52:50,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-18 20:52:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:50,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:50,659 INFO L354 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2021-12-18 20:52:50,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2021-12-18 20:52:50,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_2153 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2153) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) is different from false [2021-12-18 20:52:50,700 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:50,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2021-12-18 20:52:50,840 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:50,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-18 20:52:50,847 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:50,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 161 [2021-12-18 20:52:50,851 INFO L388 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 142 treesize of output 126 [2021-12-18 20:52:50,858 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:50,859 INFO L388 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 136 treesize of output 112 [2021-12-18 20:52:50,867 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:50,881 INFO L388 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 [2021-12-18 20:52:51,104 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:51,105 INFO L388 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 [2021-12-18 20:52:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-18 20:52:51,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399429914] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:51,156 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:51,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 38 [2021-12-18 20:52:51,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451493695] [2021-12-18 20:52:51,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:51,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-18 20:52:51,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:51,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-18 20:52:51,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1216, Unknown=20, NotChecked=72, Total=1482 [2021-12-18 20:52:51,157 INFO L87 Difference]: Start difference. First operand 507 states and 620 transitions. Second operand has 39 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 39 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) [2021-12-18 20:52:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:52,057 INFO L93 Difference]: Finished difference Result 618 states and 744 transitions. [2021-12-18 20:52:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-18 20:52:52,058 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-18 20:52:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:52,061 INFO L225 Difference]: With dead ends: 618 [2021-12-18 20:52:52,061 INFO L226 Difference]: Without dead ends: 618 [2021-12-18 20:52:52,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 66 SyntacticMatches, 14 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=524, Invalid=2652, Unknown=20, NotChecked=110, Total=3306 [2021-12-18 20:52:52,062 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 757 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 901 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:52,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [757 Valid, 980 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 762 Invalid, 0 Unknown, 901 Unchecked, 0.3s Time] [2021-12-18 20:52:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-12-18 20:52:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 507. [2021-12-18 20:52:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 494 states have (on average 1.2510121457489878) internal successors, (618), 506 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 618 transitions. [2021-12-18 20:52:52,068 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 618 transitions. Word has length 45 [2021-12-18 20:52:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:52,068 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 618 transitions. [2021-12-18 20:52:52,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 39 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) [2021-12-18 20:52:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 618 transitions. [2021-12-18 20:52:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-18 20:52:52,069 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:52,069 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:52,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:52,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:52,282 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:52,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1453916065, now seen corresponding path program 1 times [2021-12-18 20:52:52,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:52,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574886481] [2021-12-18 20:52:52,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:52,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:52,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574886481] [2021-12-18 20:52:52,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574886481] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582322660] [2021-12-18 20:52:52,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:52,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:52,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:52,574 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) [2021-12-18 20:52:52,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-18 20:52:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:52,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-18 20:52:52,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:52,819 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:52,819 INFO L388 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 [2021-12-18 20:52:52,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:52,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:52,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:52:52,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:52:52,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:52:52,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:52:52,980 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:52,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:53,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:52:53,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:52:53,270 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-18 20:52:53,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 71 [2021-12-18 20:52:53,275 INFO L388 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 20 treesize of output 22 [2021-12-18 20:52:53,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-12-18 20:52:53,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-18 20:52:53,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 20:52:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:53,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:53,539 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2274 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2274) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (forall ((v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2274) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2273) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2021-12-18 20:52:53,559 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2274) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2273) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (forall ((v_ArrVal_2274 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2274) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))))) is different from false [2021-12-18 20:52:53,567 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2274 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2274) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (forall ((v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2274) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2273) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2021-12-18 20:52:53,576 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:53,579 INFO L388 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 62 treesize of output 66 [2021-12-18 20:52:53,620 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2273 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2273) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (forall ((v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2272) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2274) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) is different from false [2021-12-18 20:52:53,686 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:53,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2021-12-18 20:52:53,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:53,702 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:53,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:53,726 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:53,763 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:53,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:53,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:53,832 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:53,859 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:53,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:53,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:53,892 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:53,920 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:53,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:53,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:53,956 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:53,988 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:53,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:54,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:54,023 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:54,052 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:54,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:54,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:54,084 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:54,111 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:54,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:54,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:54,145 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:54,171 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:54,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:54,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:54,205 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:54,233 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:54,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:54,264 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:54,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:54,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-18 20:52:54,303 INFO L388 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 30 treesize of output 22 [2021-12-18 20:52:54,377 INFO L388 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 38 treesize of output 30 [2021-12-18 20:52:54,389 INFO L388 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 36 treesize of output 28 [2021-12-18 20:52:54,412 INFO L388 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 36 treesize of output 28 [2021-12-18 20:52:54,419 INFO L388 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 38 treesize of output 30 [2021-12-18 20:52:54,485 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:54,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 81 [2021-12-18 20:52:54,490 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:54,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 81 [2021-12-18 20:52:54,497 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:54,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 198 [2021-12-18 20:52:54,506 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:54,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 333 treesize of output 330 [2021-12-18 20:52:54,514 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:54,514 INFO L388 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 340 treesize of output 284 [2021-12-18 20:52:54,521 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:54,522 INFO L388 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 290 treesize of output 289 [2021-12-18 20:52:54,530 INFO L388 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 227 treesize of output 219 [2021-12-18 20:52:54,534 INFO L388 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 219 treesize of output 215 [2021-12-18 20:52:54,538 INFO L388 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 215 treesize of output 199 [2021-12-18 20:52:54,541 INFO L388 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 199 treesize of output 191 [2021-12-18 20:52:54,545 INFO L388 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 191 treesize of output 187 [2021-12-18 20:52:54,841 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:54,841 INFO L388 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 [2021-12-18 20:52:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-18 20:52:54,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582322660] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:54,895 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:54,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 41 [2021-12-18 20:52:54,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626832981] [2021-12-18 20:52:54,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:54,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-18 20:52:54,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:54,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-18 20:52:54,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1227, Unknown=20, NotChecked=300, Total=1722 [2021-12-18 20:52:54,896 INFO L87 Difference]: Start difference. First operand 507 states and 618 transitions. Second operand has 42 states, 41 states have (on average 2.7560975609756095) internal successors, (113), 42 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:56,292 INFO L93 Difference]: Finished difference Result 641 states and 764 transitions. [2021-12-18 20:52:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-18 20:52:56,292 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.7560975609756095) internal successors, (113), 42 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-18 20:52:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:56,294 INFO L225 Difference]: With dead ends: 641 [2021-12-18 20:52:56,294 INFO L226 Difference]: Without dead ends: 641 [2021-12-18 20:52:56,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=585, Invalid=3193, Unknown=20, NotChecked=492, Total=4290 [2021-12-18 20:52:56,294 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 697 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1265 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:56,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [697 Valid, 1214 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1197 Invalid, 0 Unknown, 1265 Unchecked, 0.5s Time] [2021-12-18 20:52:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-12-18 20:52:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 468. [2021-12-18 20:52:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 455 states have (on average 1.2461538461538462) internal successors, (567), 467 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 567 transitions. [2021-12-18 20:52:56,299 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 567 transitions. Word has length 45 [2021-12-18 20:52:56,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:56,299 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 567 transitions. [2021-12-18 20:52:56,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.7560975609756095) internal successors, (113), 42 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 567 transitions. [2021-12-18 20:52:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 20:52:56,300 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:56,300 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:56,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:56,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:56,500 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:56,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash -63394326, now seen corresponding path program 1 times [2021-12-18 20:52:56,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:56,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380724814] [2021-12-18 20:52:56,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:56,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:56,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:56,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380724814] [2021-12-18 20:52:56,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380724814] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:56,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561461254] [2021-12-18 20:52:56,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:56,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:56,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:56,639 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) [2021-12-18 20:52:56,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-18 20:52:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:56,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-18 20:52:56,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:56,880 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 20:52:56,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 20:52:56,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:57,048 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:57,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-18 20:52:57,261 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:57,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2021-12-18 20:52:57,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-12-18 20:52:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:52:57,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:57,481 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2348 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2348) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1)) (forall ((v_ArrVal_2348 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2348) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2021-12-18 20:52:57,492 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2348 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2348) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_2348 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2348) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1))) is different from false [2021-12-18 20:52:57,496 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2348 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2348) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_2348 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2348) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1))) is different from false [2021-12-18 20:52:57,499 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:57,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 20:52:57,502 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:57,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2021-12-18 20:52:57,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-18 20:52:57,518 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:57,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2021-12-18 20:52:57,521 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:57,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2021-12-18 20:52:57,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-18 20:52:57,690 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:57,691 INFO L388 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 [2021-12-18 20:52:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2021-12-18 20:52:57,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561461254] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:57,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:57,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 17] total 39 [2021-12-18 20:52:57,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215413462] [2021-12-18 20:52:57,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:57,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-18 20:52:57,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:57,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-18 20:52:57,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1182, Unknown=3, NotChecked=216, Total=1560 [2021-12-18 20:52:57,724 INFO L87 Difference]: Start difference. First operand 468 states and 567 transitions. Second operand has 40 states, 39 states have (on average 3.2564102564102564) internal successors, (127), 40 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:58,159 INFO L93 Difference]: Finished difference Result 504 states and 603 transitions. [2021-12-18 20:52:58,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-18 20:52:58,175 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.2564102564102564) internal successors, (127), 40 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-12-18 20:52:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:58,176 INFO L225 Difference]: With dead ends: 504 [2021-12-18 20:52:58,176 INFO L226 Difference]: Without dead ends: 504 [2021-12-18 20:52:58,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=2401, Unknown=3, NotChecked=312, Total=3080 [2021-12-18 20:52:58,177 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 121 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 466 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:58,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 737 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 399 Invalid, 0 Unknown, 466 Unchecked, 0.1s Time] [2021-12-18 20:52:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-12-18 20:52:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 481. [2021-12-18 20:52:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 468 states have (on average 1.2414529914529915) internal successors, (581), 480 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 581 transitions. [2021-12-18 20:52:58,191 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 581 transitions. Word has length 46 [2021-12-18 20:52:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:58,191 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 581 transitions. [2021-12-18 20:52:58,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.2564102564102564) internal successors, (127), 40 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 581 transitions. [2021-12-18 20:52:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 20:52:58,192 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:58,192 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:58,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:58,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-12-18 20:52:58,409 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:52:58,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:58,409 INFO L85 PathProgramCache]: Analyzing trace with hash -63394325, now seen corresponding path program 1 times [2021-12-18 20:52:58,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:58,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584796047] [2021-12-18 20:52:58,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:58,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:58,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:58,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584796047] [2021-12-18 20:52:58,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584796047] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:58,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500694381] [2021-12-18 20:52:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:58,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:58,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:58,660 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) [2021-12-18 20:52:58,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-18 20:52:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:58,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-18 20:52:58,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:58,916 INFO L388 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 [2021-12-18 20:52:58,922 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:58,923 INFO L388 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 [2021-12-18 20:52:58,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:58,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:59,143 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:59,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:52:59,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:52:59,423 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:59,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2021-12-18 20:52:59,430 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:59,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-18 20:52:59,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:52:59,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:59,816 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2426 (Array Int Int)) (v_ArrVal_2425 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2425) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2426) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_2425 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2425) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8)))) is different from false [2021-12-18 20:52:59,830 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2426 (Array Int Int)) (v_ArrVal_2425 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2425) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2426) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_2425 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2425) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8)))) is different from false [2021-12-18 20:52:59,836 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2425 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2425) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8))) (forall ((v_ArrVal_2426 (Array Int Int)) (v_ArrVal_2425 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2425) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2426) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))))) is different from false [2021-12-18 20:52:59,840 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:59,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 20:52:59,844 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:59,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2021-12-18 20:52:59,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-18 20:52:59,858 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:59,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2021-12-18 20:52:59,862 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:59,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-18 20:52:59,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:59,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:59,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2021-12-18 20:52:59,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:59,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:59,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2021-12-18 20:52:59,987 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:59,987 INFO L388 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 [2021-12-18 20:53:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2021-12-18 20:53:00,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500694381] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:53:00,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:53:00,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 44 [2021-12-18 20:53:00,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485405136] [2021-12-18 20:53:00,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:53:00,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-18 20:53:00,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:53:00,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-18 20:53:00,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1525, Unknown=3, NotChecked=246, Total=1980 [2021-12-18 20:53:00,025 INFO L87 Difference]: Start difference. First operand 481 states and 581 transitions. Second operand has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 45 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:00,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:53:00,440 INFO L93 Difference]: Finished difference Result 498 states and 598 transitions. [2021-12-18 20:53:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 20:53:00,441 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 45 states have internal predecessors, (131), 0 states have call successors, (0), 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 [2021-12-18 20:53:00,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:53:00,442 INFO L225 Difference]: With dead ends: 498 [2021-12-18 20:53:00,442 INFO L226 Difference]: Without dead ends: 498 [2021-12-18 20:53:00,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=377, Invalid=2388, Unknown=3, NotChecked=312, Total=3080 [2021-12-18 20:53:00,443 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 91 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:53:00,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 715 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 425 Invalid, 0 Unknown, 298 Unchecked, 0.1s Time] [2021-12-18 20:53:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-12-18 20:53:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2021-12-18 20:53:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 485 states have (on average 1.2329896907216495) internal successors, (598), 497 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 598 transitions. [2021-12-18 20:53:00,447 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 598 transitions. Word has length 46 [2021-12-18 20:53:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:53:00,449 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 598 transitions. [2021-12-18 20:53:00,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 45 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 598 transitions. [2021-12-18 20:53:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 20:53:00,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:53:00,450 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:53:00,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-12-18 20:53:00,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-18 20:53:00,663 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:53:00,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:53:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash 95491093, now seen corresponding path program 1 times [2021-12-18 20:53:00,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:53:00,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904322877] [2021-12-18 20:53:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:00,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:53:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:00,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:53:00,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904322877] [2021-12-18 20:53:00,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904322877] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:53:00,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105672192] [2021-12-18 20:53:00,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:00,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:00,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:53:00,944 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) [2021-12-18 20:53:00,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-18 20:53:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:01,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-18 20:53:01,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:53:01,215 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:53:01,216 INFO L388 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 [2021-12-18 20:53:01,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:53:01,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:01,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:01,426 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:01,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:53:01,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:53:01,675 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:01,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2021-12-18 20:53:01,688 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:01,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-18 20:53:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:53:01,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:53:02,042 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2502) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2503) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_2502 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2502) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8)))) is different from false [2021-12-18 20:53:02,060 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2502 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2502) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8))) (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2502) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2503) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2021-12-18 20:53:02,092 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2502) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2503) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) (forall ((v_ArrVal_2502 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2502) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8)))) is different from false [2021-12-18 20:53:02,099 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:02,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2021-12-18 20:53:02,105 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:02,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-18 20:53:02,112 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:02,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 57 [2021-12-18 20:53:02,120 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:02,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 83 [2021-12-18 20:53:02,124 INFO L388 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 34 treesize of output 30 [2021-12-18 20:53:02,126 INFO L388 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 62 treesize of output 58 [2021-12-18 20:53:02,222 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:02,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 20:53:02,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:02,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:02,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2021-12-18 20:53:02,404 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:53:02,404 INFO L388 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 [2021-12-18 20:53:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2021-12-18 20:53:02,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105672192] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:53:02,460 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:53:02,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 44 [2021-12-18 20:53:02,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934092728] [2021-12-18 20:53:02,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:53:02,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-18 20:53:02,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:53:02,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-18 20:53:02,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1525, Unknown=3, NotChecked=246, Total=1980 [2021-12-18 20:53:02,461 INFO L87 Difference]: Start difference. First operand 498 states and 598 transitions. Second operand has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 45 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:53:03,246 INFO L93 Difference]: Finished difference Result 514 states and 612 transitions. [2021-12-18 20:53:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-18 20:53:03,247 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 45 states have internal predecessors, (131), 0 states have call successors, (0), 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 [2021-12-18 20:53:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:53:03,248 INFO L225 Difference]: With dead ends: 514 [2021-12-18 20:53:03,248 INFO L226 Difference]: Without dead ends: 514 [2021-12-18 20:53:03,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=439, Invalid=2762, Unknown=3, NotChecked=336, Total=3540 [2021-12-18 20:53:03,249 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 194 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 444 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:53:03,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 653 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 630 Invalid, 0 Unknown, 444 Unchecked, 0.2s Time] [2021-12-18 20:53:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-12-18 20:53:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 502. [2021-12-18 20:53:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 490 states have (on average 1.2285714285714286) internal successors, (602), 501 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 602 transitions. [2021-12-18 20:53:03,254 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 602 transitions. Word has length 46 [2021-12-18 20:53:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:53:03,254 INFO L470 AbstractCegarLoop]: Abstraction has 502 states and 602 transitions. [2021-12-18 20:53:03,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 45 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 602 transitions. [2021-12-18 20:53:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-18 20:53:03,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:53:03,255 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:53:03,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-12-18 20:53:03,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-12-18 20:53:03,473 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:53:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:53:03,473 INFO L85 PathProgramCache]: Analyzing trace with hash -792401063, now seen corresponding path program 1 times [2021-12-18 20:53:03,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:53:03,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34192852] [2021-12-18 20:53:03,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:03,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:53:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:03,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:53:03,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34192852] [2021-12-18 20:53:03,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34192852] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:53:03,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027274373] [2021-12-18 20:53:03,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:03,655 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:03,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:53:03,672 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) [2021-12-18 20:53:03,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-18 20:53:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:03,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-18 20:53:03,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:53:03,899 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:53:03,899 INFO L388 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 [2021-12-18 20:53:03,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:03,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:03,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:53:04,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:53:04,131 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:04,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-18 20:53:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:53:04,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:53:04,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2578 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2578) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2021-12-18 20:53:04,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2578 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2578) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2021-12-18 20:53:04,380 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2578 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_225| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2578) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_225| 8)) 0) (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_225|) (< |v_ULTIMATE.start_main_~p~0#1.offset_225| 0))) is different from false [2021-12-18 20:53:04,385 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:04,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 20:53:04,390 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:04,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2021-12-18 20:53:04,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:53:04,564 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:53:04,565 INFO L388 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 [2021-12-18 20:53:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2021-12-18 20:53:04,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027274373] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:53:04,597 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:53:04,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 37 [2021-12-18 20:53:04,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789663243] [2021-12-18 20:53:04,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:53:04,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-18 20:53:04,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:53:04,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-18 20:53:04,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1010, Unknown=3, NotChecked=204, Total=1406 [2021-12-18 20:53:04,599 INFO L87 Difference]: Start difference. First operand 502 states and 602 transitions. Second operand has 38 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 38 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:53:05,276 INFO L93 Difference]: Finished difference Result 606 states and 723 transitions. [2021-12-18 20:53:05,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-18 20:53:05,276 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 38 states have internal predecessors, (124), 0 states have call successors, (0), 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 48 [2021-12-18 20:53:05,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:53:05,279 INFO L225 Difference]: With dead ends: 606 [2021-12-18 20:53:05,279 INFO L226 Difference]: Without dead ends: 606 [2021-12-18 20:53:05,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=589, Invalid=2842, Unknown=3, NotChecked=348, Total=3782 [2021-12-18 20:53:05,280 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 483 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1078 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:53:05,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [483 Valid, 1077 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 850 Invalid, 0 Unknown, 1078 Unchecked, 0.3s Time] [2021-12-18 20:53:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-12-18 20:53:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 485. [2021-12-18 20:53:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 473 states have (on average 1.236786469344609) internal successors, (585), 484 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 585 transitions. [2021-12-18 20:53:05,285 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 585 transitions. Word has length 48 [2021-12-18 20:53:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:53:05,285 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 585 transitions. [2021-12-18 20:53:05,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 38 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 585 transitions. [2021-12-18 20:53:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-18 20:53:05,286 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:53:05,286 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:53:05,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-12-18 20:53:05,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-12-18 20:53:05,501 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:53:05,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:53:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1689205847, now seen corresponding path program 2 times [2021-12-18 20:53:05,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:53:05,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838019726] [2021-12-18 20:53:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:05,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:53:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:05,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:53:05,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838019726] [2021-12-18 20:53:05,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838019726] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:53:05,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664871890] [2021-12-18 20:53:05,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:53:05,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:05,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:53:05,707 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) [2021-12-18 20:53:05,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-18 20:53:05,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:53:05,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:53:05,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-18 20:53:05,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:53:05,984 INFO L388 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 [2021-12-18 20:53:06,025 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 20:53:06,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 20:53:06,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:06,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:06,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:53:06,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-18 20:53:06,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:53:06,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:53:06,193 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-18 20:53:06,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:53:06,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:06,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:53:06,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2021-12-18 20:53:06,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:53:06,328 INFO L388 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 [2021-12-18 20:53:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:06,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:53:06,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2701 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-18 20:53:06,390 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2701 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-18 20:53:06,392 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2701 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-18 20:53:06,395 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2701 (Array Int Int)) (v_ArrVal_2698 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2698) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-18 20:53:06,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2701 (Array Int Int)) (v_ArrVal_2698 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_66| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_66|))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2698) |v_ULTIMATE.start_main_~t~0#1.base_66| v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) is different from false [2021-12-18 20:53:06,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2701 (Array Int Int)) (v_ArrVal_2698 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_66| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_66|))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2698) |v_ULTIMATE.start_main_~t~0#1.base_66| v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) is different from false [2021-12-18 20:53:06,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:06,558 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:06,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2021-12-18 20:53:06,563 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:06,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 120 [2021-12-18 20:53:06,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2021-12-18 20:53:06,569 INFO L388 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 51 treesize of output 47 [2021-12-18 20:53:06,775 INFO L354 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-12-18 20:53:06,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 22 [2021-12-18 20:53:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2021-12-18 20:53:06,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664871890] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:53:06,809 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:53:06,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2021-12-18 20:53:06,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253107335] [2021-12-18 20:53:06,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:53:06,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-18 20:53:06,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:53:06,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-18 20:53:06,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1279, Unknown=11, NotChecked=474, Total=1980 [2021-12-18 20:53:06,816 INFO L87 Difference]: Start difference. First operand 485 states and 585 transitions. Second operand has 45 states, 45 states have (on average 2.6222222222222222) internal successors, (118), 45 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:10,271 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2701 (Array Int Int)) (v_ArrVal_2698 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2698) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (forall ((v_ArrVal_2701 (Array Int Int)) (v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2695 Int) (|v_ULTIMATE.start_main_~t~0#1.base_66| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_66|))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_2695)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2698) |v_ULTIMATE.start_main_~t~0#1.base_66| v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) is different from false [2021-12-18 20:53:10,280 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2701 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (forall ((v_ArrVal_2701 (Array Int Int)) (v_ArrVal_2698 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_66| Int)) (or (<= (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2698) |v_ULTIMATE.start_main_~t~0#1.base_66| v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_66|)))))) is different from false [2021-12-18 20:53:10,288 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2701 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (forall ((v_ArrVal_2701 (Array Int Int)) (v_ArrVal_2698 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_66| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_66|))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2698) |v_ULTIMATE.start_main_~t~0#1.base_66| v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) is different from false [2021-12-18 20:53:10,296 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2701 (Array Int Int)) (v_ArrVal_2698 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_66| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_66|))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2698) |v_ULTIMATE.start_main_~t~0#1.base_66| v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) (forall ((v_ArrVal_2701 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2701) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) is different from false [2021-12-18 20:53:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:53:10,530 INFO L93 Difference]: Finished difference Result 827 states and 997 transitions. [2021-12-18 20:53:10,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-12-18 20:53:10,530 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.6222222222222222) internal successors, (118), 45 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-18 20:53:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:53:10,532 INFO L225 Difference]: With dead ends: 827 [2021-12-18 20:53:10,532 INFO L226 Difference]: Without dead ends: 827 [2021-12-18 20:53:10,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 68 SyntacticMatches, 15 SemanticMatches, 83 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1013, Invalid=4551, Unknown=26, NotChecked=1550, Total=7140 [2021-12-18 20:53:10,554 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 867 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 2719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1573 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:53:10,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [867 Valid, 946 Invalid, 2719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 953 Invalid, 0 Unknown, 1573 Unchecked, 0.3s Time] [2021-12-18 20:53:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-12-18 20:53:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 526. [2021-12-18 20:53:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 514 states have (on average 1.2120622568093384) internal successors, (623), 525 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 623 transitions. [2021-12-18 20:53:10,571 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 623 transitions. Word has length 48 [2021-12-18 20:53:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:53:10,571 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 623 transitions. [2021-12-18 20:53:10,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.6222222222222222) internal successors, (118), 45 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 623 transitions. [2021-12-18 20:53:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-18 20:53:10,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:53:10,572 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:53:10,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-12-18 20:53:10,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:10,799 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:53:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:53:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1205371029, now seen corresponding path program 1 times [2021-12-18 20:53:10,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:53:10,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617452520] [2021-12-18 20:53:10,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:10,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:53:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:10,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:53:10,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617452520] [2021-12-18 20:53:10,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617452520] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:53:10,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347733141] [2021-12-18 20:53:10,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:10,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:10,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:53:10,940 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) [2021-12-18 20:53:10,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-12-18 20:53:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:11,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-18 20:53:11,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:53:11,218 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:53:11,219 INFO L388 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 [2021-12-18 20:53:11,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:11,389 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:11,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-18 20:53:11,707 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:11,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2021-12-18 20:53:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:11,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:53:12,214 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:12,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 20:53:12,219 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:12,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2021-12-18 20:53:12,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:53:12,440 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:53:12,440 INFO L388 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 [2021-12-18 20:53:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:53:12,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347733141] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:53:12,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:53:12,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 17] total 40 [2021-12-18 20:53:12,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527961172] [2021-12-18 20:53:12,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:53:12,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-18 20:53:12,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:53:12,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-18 20:53:12,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1447, Unknown=5, NotChecked=0, Total=1640 [2021-12-18 20:53:12,500 INFO L87 Difference]: Start difference. First operand 526 states and 623 transitions. Second operand has 41 states, 40 states have (on average 3.2) internal successors, (128), 41 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:53:12,943 INFO L93 Difference]: Finished difference Result 550 states and 647 transitions. [2021-12-18 20:53:12,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-18 20:53:12,943 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.2) internal successors, (128), 41 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-12-18 20:53:12,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:53:12,944 INFO L225 Difference]: With dead ends: 550 [2021-12-18 20:53:12,944 INFO L226 Difference]: Without dead ends: 550 [2021-12-18 20:53:12,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=383, Invalid=2474, Unknown=5, NotChecked=0, Total=2862 [2021-12-18 20:53:12,945 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 99 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:53:12,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 816 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 436 Invalid, 0 Unknown, 282 Unchecked, 0.2s Time] [2021-12-18 20:53:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-12-18 20:53:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 546. [2021-12-18 20:53:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 534 states have (on average 1.205992509363296) internal successors, (644), 545 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 644 transitions. [2021-12-18 20:53:12,950 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 644 transitions. Word has length 49 [2021-12-18 20:53:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:53:12,950 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 644 transitions. [2021-12-18 20:53:12,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.2) internal successors, (128), 41 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 644 transitions. [2021-12-18 20:53:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-18 20:53:12,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:53:12,950 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:53:12,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-12-18 20:53:13,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:13,164 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:53:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:53:13,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1506898475, now seen corresponding path program 1 times [2021-12-18 20:53:13,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:53:13,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16727204] [2021-12-18 20:53:13,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:13,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:53:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:13,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:53:13,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16727204] [2021-12-18 20:53:13,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16727204] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:53:13,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852687724] [2021-12-18 20:53:13,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:13,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:13,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:53:13,300 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) [2021-12-18 20:53:13,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-12-18 20:53:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:13,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 20:53:13,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:53:13,584 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:53:13,585 INFO L388 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 [2021-12-18 20:53:13,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:13,712 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:13,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-18 20:53:13,921 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:13,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2021-12-18 20:53:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:53:14,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:53:14,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2847 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2847) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) |c_#StackHeapBarrier|) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2021-12-18 20:53:14,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2847 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2847) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) |c_#StackHeapBarrier|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2021-12-18 20:53:14,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2847 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_253| Int)) (or (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2847) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_253| 8)) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_main_~p~0#1.offset_253| 0) (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_253|))) is different from false [2021-12-18 20:53:14,220 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:14,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 20:53:14,225 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:14,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2021-12-18 20:53:14,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:53:14,380 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:53:14,381 INFO L388 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 [2021-12-18 20:53:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2021-12-18 20:53:14,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852687724] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:53:14,416 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:53:14,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 33 [2021-12-18 20:53:14,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658218215] [2021-12-18 20:53:14,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:53:14,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-18 20:53:14,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:53:14,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-18 20:53:14,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=833, Unknown=3, NotChecked=180, Total=1122 [2021-12-18 20:53:14,419 INFO L87 Difference]: Start difference. First operand 546 states and 644 transitions. Second operand has 34 states, 33 states have (on average 3.787878787878788) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:53:15,055 INFO L93 Difference]: Finished difference Result 559 states and 655 transitions. [2021-12-18 20:53:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-18 20:53:15,056 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.787878787878788) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-12-18 20:53:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:53:15,057 INFO L225 Difference]: With dead ends: 559 [2021-12-18 20:53:15,057 INFO L226 Difference]: Without dead ends: 559 [2021-12-18 20:53:15,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 75 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=335, Invalid=2224, Unknown=3, NotChecked=300, Total=2862 [2021-12-18 20:53:15,058 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 147 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 555 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:53:15,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 852 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 568 Invalid, 0 Unknown, 555 Unchecked, 0.2s Time] [2021-12-18 20:53:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-12-18 20:53:15,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 545. [2021-12-18 20:53:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 533 states have (on average 1.2063789868667918) internal successors, (643), 544 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 643 transitions. [2021-12-18 20:53:15,065 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 643 transitions. Word has length 49 [2021-12-18 20:53:15,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:53:15,066 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 643 transitions. [2021-12-18 20:53:15,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.787878787878788) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 643 transitions. [2021-12-18 20:53:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-18 20:53:15,067 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:53:15,068 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:53:15,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2021-12-18 20:53:15,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-12-18 20:53:15,286 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:53:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:53:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1278187334, now seen corresponding path program 1 times [2021-12-18 20:53:15,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:53:15,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484415037] [2021-12-18 20:53:15,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:15,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:53:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:15,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:53:15,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484415037] [2021-12-18 20:53:15,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484415037] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:53:15,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391304222] [2021-12-18 20:53:15,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:15,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:15,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:53:15,427 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) [2021-12-18 20:53:15,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-12-18 20:53:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:15,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 20:53:15,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:53:15,682 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:53:15,683 INFO L388 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 [2021-12-18 20:53:15,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:15,825 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:15,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-18 20:53:15,977 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:15,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2021-12-18 20:53:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:53:16,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:53:16,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) |c_#StackHeapBarrier|))) is different from false [2021-12-18 20:53:16,183 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2920) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) |c_#StackHeapBarrier|) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2021-12-18 20:53:16,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_265| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1.offset_265| 0) (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_265|) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2920) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_265| 8)) |c_#StackHeapBarrier|))) is different from false [2021-12-18 20:53:16,194 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:16,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 20:53:16,197 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:16,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2021-12-18 20:53:16,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:53:16,319 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:53:16,319 INFO L388 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 [2021-12-18 20:53:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2021-12-18 20:53:16,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391304222] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:53:16,344 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:53:16,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 33 [2021-12-18 20:53:16,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991276860] [2021-12-18 20:53:16,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:53:16,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-18 20:53:16,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:53:16,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-18 20:53:16,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=833, Unknown=3, NotChecked=180, Total=1122 [2021-12-18 20:53:16,346 INFO L87 Difference]: Start difference. First operand 545 states and 643 transitions. Second operand has 34 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 34 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:53:16,781 INFO L93 Difference]: Finished difference Result 548 states and 646 transitions. [2021-12-18 20:53:16,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 20:53:16,783 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 34 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-12-18 20:53:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:53:16,784 INFO L225 Difference]: With dead ends: 548 [2021-12-18 20:53:16,784 INFO L226 Difference]: Without dead ends: 548 [2021-12-18 20:53:16,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=1638, Unknown=3, NotChecked=258, Total=2162 [2021-12-18 20:53:16,785 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 94 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 362 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:53:16,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 776 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 367 Invalid, 0 Unknown, 362 Unchecked, 0.1s Time] [2021-12-18 20:53:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2021-12-18 20:53:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 524. [2021-12-18 20:53:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 512 states have (on average 1.212890625) internal successors, (621), 523 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 621 transitions. [2021-12-18 20:53:16,805 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 621 transitions. Word has length 51 [2021-12-18 20:53:16,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:53:16,806 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 621 transitions. [2021-12-18 20:53:16,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 34 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:16,806 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 621 transitions. [2021-12-18 20:53:16,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-18 20:53:16,808 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:53:16,808 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:53:16,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-12-18 20:53:17,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:17,031 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:53:17,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:53:17,032 INFO L85 PathProgramCache]: Analyzing trace with hash 84710120, now seen corresponding path program 1 times [2021-12-18 20:53:17,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:53:17,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070908600] [2021-12-18 20:53:17,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:17,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:53:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:17,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:53:17,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070908600] [2021-12-18 20:53:17,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070908600] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:53:17,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716730329] [2021-12-18 20:53:17,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:17,367 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:17,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:53:17,368 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) [2021-12-18 20:53:17,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-12-18 20:53:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:17,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-18 20:53:17,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:53:17,660 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 20:53:17,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 20:53:17,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:17,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:17,847 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:17,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 20:53:17,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:17,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-18 20:53:17,924 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:53:17,924 INFO L388 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 21 treesize of output 25 [2021-12-18 20:53:17,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:53:17,943 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:17,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 20:53:17,953 INFO L388 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 [2021-12-18 20:53:18,015 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-18 20:53:18,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-18 20:53:18,077 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-18 20:53:18,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2021-12-18 20:53:18,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:18,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:53:18,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-18 20:53:18,259 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-18 20:53:18,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 99 [2021-12-18 20:53:18,266 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:18,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 103 [2021-12-18 20:53:18,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2021-12-18 20:53:18,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:18,401 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:53:18,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2021-12-18 20:53:18,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2021-12-18 20:53:18,462 INFO L388 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 [2021-12-18 20:53:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:18,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:53:18,527 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3045 (Array Int Int)) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3047 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3045) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3046) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3047) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 2)) is different from false [2021-12-18 20:53:18,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3045 (Array Int Int)) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3047 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3045) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3046) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3047) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 2)) is different from false [2021-12-18 20:53:18,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3045 (Array Int Int)) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3047 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_3045) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3046) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3047) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 2)) is different from false [2021-12-18 20:53:18,548 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3043 (Array Int Int)) (v_ArrVal_3045 (Array Int Int)) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3047 (Array Int Int)) (v_ArrVal_3042 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_3042)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3045) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3046) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3043) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3047) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 2)) is different from false [2021-12-18 20:53:18,614 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:18,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2021-12-18 20:53:18,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:18,621 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:18,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2021-12-18 20:53:18,627 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:18,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 121 [2021-12-18 20:53:18,630 INFO L388 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 45 treesize of output 27 [2021-12-18 20:53:18,685 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:18,740 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:18,764 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:18,787 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:18,812 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:18,835 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:18,859 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:18,883 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:18,908 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:18,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2021-12-18 20:53:19,032 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:19,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 84 [2021-12-18 20:53:19,037 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:19,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 84 [2021-12-18 20:53:19,044 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:19,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 144 [2021-12-18 20:53:19,052 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:19,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 350 treesize of output 341 [2021-12-18 20:53:19,060 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:19,060 INFO L388 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 351 treesize of output 275 [2021-12-18 20:53:19,066 INFO L388 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 218 treesize of output 210 [2021-12-18 20:53:19,070 INFO L388 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 210 treesize of output 206 [2021-12-18 20:53:19,074 INFO L388 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 206 treesize of output 190 [2021-12-18 20:53:19,079 INFO L388 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 190 treesize of output 182 [2021-12-18 20:53:19,540 INFO L354 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-12-18 20:53:19,540 INFO L388 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 37 treesize of output 35 [2021-12-18 20:53:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-18 20:53:19,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716730329] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:53:19,597 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:53:19,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 49 [2021-12-18 20:53:19,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672718756] [2021-12-18 20:53:19,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:53:19,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-18 20:53:19,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:53:19,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-18 20:53:19,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1748, Unknown=5, NotChecked=356, Total=2352 [2021-12-18 20:53:19,598 INFO L87 Difference]: Start difference. First operand 524 states and 621 transitions. Second operand has 49 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:53:20,586 INFO L93 Difference]: Finished difference Result 746 states and 888 transitions. [2021-12-18 20:53:20,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-18 20:53:20,586 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 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 51 [2021-12-18 20:53:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:53:20,588 INFO L225 Difference]: With dead ends: 746 [2021-12-18 20:53:20,588 INFO L226 Difference]: Without dead ends: 746 [2021-12-18 20:53:20,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=413, Invalid=2790, Unknown=5, NotChecked=452, Total=3660 [2021-12-18 20:53:20,588 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 428 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1169 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:53:20,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 1321 Invalid, 2152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 914 Invalid, 0 Unknown, 1169 Unchecked, 0.4s Time] [2021-12-18 20:53:20,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-12-18 20:53:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 560. [2021-12-18 20:53:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 548 states have (on average 1.2062043795620438) internal successors, (661), 559 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 661 transitions. [2021-12-18 20:53:20,593 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 661 transitions. Word has length 51 [2021-12-18 20:53:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:53:20,593 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 661 transitions. [2021-12-18 20:53:20,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 661 transitions. [2021-12-18 20:53:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-18 20:53:20,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:53:20,594 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:53:20,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-12-18 20:53:20,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:20,799 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:53:20,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:53:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash 84402290, now seen corresponding path program 1 times [2021-12-18 20:53:20,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:53:20,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355855781] [2021-12-18 20:53:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:20,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:53:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:21,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:53:21,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355855781] [2021-12-18 20:53:21,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355855781] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:53:21,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473823322] [2021-12-18 20:53:21,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:21,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:21,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:53:21,149 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) [2021-12-18 20:53:21,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-12-18 20:53:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:21,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-18 20:53:21,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:53:21,395 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 20:53:21,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 20:53:21,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:21,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:21,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:21,537 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:53:21,537 INFO L388 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 21 treesize of output 25 [2021-12-18 20:53:21,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:53:21,551 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:21,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 20:53:21,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:21,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:53:21,673 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:53:21,673 INFO L388 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 21 treesize of output 25 [2021-12-18 20:53:21,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:53:21,704 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:21,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 20:53:21,733 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-18 20:53:21,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:53:21,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:53:21,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:53:21,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:21,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:53:21,923 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-18 20:53:21,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 71 [2021-12-18 20:53:21,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-18 20:53:21,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-18 20:53:22,046 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:53:22,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2021-12-18 20:53:22,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 20:53:22,076 INFO L388 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 [2021-12-18 20:53:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:22,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:53:22,159 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3174 (Array Int Int)) (v_ArrVal_3175 (Array Int Int)) (v_ArrVal_3176 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3174) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4))) 0)) is different from false [2021-12-18 20:53:22,171 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3174 (Array Int Int)) (v_ArrVal_3175 (Array Int Int)) (v_ArrVal_3176 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3174) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4))) 0)) is different from false [2021-12-18 20:53:22,175 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3174 (Array Int Int)) (v_ArrVal_3175 (Array Int Int)) (v_ArrVal_3176 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_3174) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) 0)) is different from false [2021-12-18 20:53:22,183 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3172 Int) (v_ArrVal_3174 (Array Int Int)) (v_ArrVal_3175 (Array Int Int)) (v_ArrVal_3176 (Array Int Int)) (v_ArrVal_3169 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_3172)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3174) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3169) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) 0)) is different from false [2021-12-18 20:53:22,230 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:22,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2021-12-18 20:53:22,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:22,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:22,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:22,414 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:22,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 77 [2021-12-18 20:53:22,421 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:22,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 127 [2021-12-18 20:53:22,425 INFO L388 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 47 treesize of output 27 [2021-12-18 20:53:22,451 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:22,472 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:22,570 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:22,597 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:22,624 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:22,661 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:22,696 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:22,772 INFO L388 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 36 treesize of output 28 [2021-12-18 20:53:22,832 INFO L388 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 36 treesize of output 28 [2021-12-18 20:53:22,940 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:22,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 94 [2021-12-18 20:53:22,943 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:22,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 84 [2021-12-18 20:53:22,950 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:22,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 216 [2021-12-18 20:53:22,958 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:22,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 422 treesize of output 413 [2021-12-18 20:53:22,964 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:22,965 INFO L388 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 423 treesize of output 339 [2021-12-18 20:53:22,971 INFO L388 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 282 treesize of output 274 [2021-12-18 20:53:22,975 INFO L388 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 274 treesize of output 258 [2021-12-18 20:53:22,979 INFO L388 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 258 treesize of output 242 [2021-12-18 20:53:22,983 INFO L388 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 242 treesize of output 234 [2021-12-18 20:53:23,612 INFO L354 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-12-18 20:53:23,612 INFO L388 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 37 treesize of output 35 [2021-12-18 20:53:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-18 20:53:23,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473823322] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:53:23,667 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:53:23,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 23] total 52 [2021-12-18 20:53:23,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768138687] [2021-12-18 20:53:23,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:53:23,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-18 20:53:23,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:53:23,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-18 20:53:23,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1992, Unknown=25, NotChecked=380, Total=2652 [2021-12-18 20:53:23,668 INFO L87 Difference]: Start difference. First operand 560 states and 661 transitions. Second operand has 52 states, 52 states have (on average 2.576923076923077) internal successors, (134), 52 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:53:24,662 INFO L93 Difference]: Finished difference Result 676 states and 795 transitions. [2021-12-18 20:53:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-18 20:53:24,663 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.576923076923077) internal successors, (134), 52 states have internal predecessors, (134), 0 states have call successors, (0), 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 51 [2021-12-18 20:53:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:53:24,664 INFO L225 Difference]: With dead ends: 676 [2021-12-18 20:53:24,664 INFO L226 Difference]: Without dead ends: 676 [2021-12-18 20:53:24,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=391, Invalid=2792, Unknown=25, NotChecked=452, Total=3660 [2021-12-18 20:53:24,665 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 319 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1370 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 20:53:24,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 1621 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1419 Invalid, 0 Unknown, 1370 Unchecked, 0.6s Time] [2021-12-18 20:53:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-12-18 20:53:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 560. [2021-12-18 20:53:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 548 states have (on average 1.2043795620437956) internal successors, (660), 559 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 660 transitions. [2021-12-18 20:53:24,669 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 660 transitions. Word has length 51 [2021-12-18 20:53:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:53:24,670 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 660 transitions. [2021-12-18 20:53:24,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.576923076923077) internal successors, (134), 52 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:24,670 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 660 transitions. [2021-12-18 20:53:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-18 20:53:24,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:53:24,670 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:53:24,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-12-18 20:53:24,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-12-18 20:53:24,883 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:53:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:53:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash -583491704, now seen corresponding path program 1 times [2021-12-18 20:53:24,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:53:24,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899929342] [2021-12-18 20:53:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:24,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:53:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:25,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:53:25,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899929342] [2021-12-18 20:53:25,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899929342] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:53:25,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729729096] [2021-12-18 20:53:25,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:25,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:25,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:53:25,372 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:53:25,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-12-18 20:53:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:25,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 76 conjunts are in the unsatisfiable core [2021-12-18 20:53:25,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:53:25,670 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 20:53:25,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 20:53:25,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:25,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:25,890 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:53:25,891 INFO L388 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 21 treesize of output 25 [2021-12-18 20:53:25,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:53:25,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:25,917 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:25,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 20:53:26,076 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:26,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 20:53:26,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:26,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-18 20:53:26,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:26,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-18 20:53:26,154 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-18 20:53:26,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-18 20:53:26,230 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-18 20:53:26,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2021-12-18 20:53:26,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:26,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:26,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:26,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2021-12-18 20:53:26,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-18 20:53:26,455 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-18 20:53:26,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 115 [2021-12-18 20:53:26,463 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:26,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 119 [2021-12-18 20:53:26,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2021-12-18 20:53:26,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:26,638 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:53:26,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 44 [2021-12-18 20:53:26,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2021-12-18 20:53:26,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:26,712 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:26,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2021-12-18 20:53:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:26,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:53:26,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3303 (Array Int Int)) (v_ArrVal_3304 (Array Int Int)) (v_ArrVal_3305 (Array Int Int))) (not (= 0 (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3304) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3303) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4)))))) is different from false [2021-12-18 20:53:26,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3303 (Array Int Int)) (v_ArrVal_3304 (Array Int Int)) (v_ArrVal_3305 (Array Int Int))) (not (= 0 (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3304) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3305) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3303) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4)))))) is different from false [2021-12-18 20:53:26,844 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3303 (Array Int Int)) (v_ArrVal_3304 (Array Int Int)) (v_ArrVal_3305 (Array Int Int))) (not (= 0 (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_3304) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3305) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3303) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))))) is different from false [2021-12-18 20:53:26,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3302 Int) (v_ArrVal_3303 (Array Int Int)) (v_ArrVal_3304 (Array Int Int)) (v_ArrVal_3305 (Array Int Int))) (not (= 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_3302)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3304) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3298) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3303) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))))) is different from false [2021-12-18 20:53:26,911 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:26,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2021-12-18 20:53:27,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:27,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:27,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:27,116 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:27,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 78 [2021-12-18 20:53:27,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:27,129 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:27,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 178 [2021-12-18 20:53:27,135 INFO L388 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 78 treesize of output 58 [2021-12-18 20:53:29,719 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:29,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 180 [2021-12-18 20:53:29,724 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:29,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 150 [2021-12-18 20:53:29,731 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:29,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 434 treesize of output 419 [2021-12-18 20:53:29,741 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:29,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 770 treesize of output 749 [2021-12-18 20:53:29,772 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:29,773 INFO L388 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 759 treesize of output 579 [2021-12-18 20:53:29,799 INFO L388 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 522 treesize of output 490 [2021-12-18 20:53:29,805 INFO L388 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 490 treesize of output 474 [2021-12-18 20:53:29,840 INFO L388 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 474 treesize of output 450 [2021-12-18 20:53:29,845 INFO L388 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 450 treesize of output 434 [2021-12-18 20:53:30,728 INFO L354 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-12-18 20:53:30,729 INFO L388 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 37 treesize of output 35 [2021-12-18 20:53:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-18 20:53:30,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729729096] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:53:30,788 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:53:30,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 60 [2021-12-18 20:53:30,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588156227] [2021-12-18 20:53:30,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:53:30,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-12-18 20:53:30,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:53:30,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-12-18 20:53:30,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2753, Unknown=15, NotChecked=444, Total=3540 [2021-12-18 20:53:30,789 INFO L87 Difference]: Start difference. First operand 560 states and 660 transitions. Second operand has 60 states, 60 states have (on average 2.35) internal successors, (141), 60 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:53:32,173 INFO L93 Difference]: Finished difference Result 677 states and 793 transitions. [2021-12-18 20:53:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-18 20:53:32,173 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.35) internal successors, (141), 60 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-12-18 20:53:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:53:32,175 INFO L225 Difference]: With dead ends: 677 [2021-12-18 20:53:32,175 INFO L226 Difference]: Without dead ends: 677 [2021-12-18 20:53:32,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=568, Invalid=4125, Unknown=15, NotChecked=548, Total=5256 [2021-12-18 20:53:32,175 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 595 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 3480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1800 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:53:32,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [595 Valid, 1441 Invalid, 3480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1593 Invalid, 0 Unknown, 1800 Unchecked, 0.7s Time] [2021-12-18 20:53:32,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-12-18 20:53:32,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 558. [2021-12-18 20:53:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 546 states have (on average 1.2014652014652014) internal successors, (656), 557 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 656 transitions. [2021-12-18 20:53:32,180 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 656 transitions. Word has length 51 [2021-12-18 20:53:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:53:32,181 INFO L470 AbstractCegarLoop]: Abstraction has 558 states and 656 transitions. [2021-12-18 20:53:32,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.35) internal successors, (141), 60 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 656 transitions. [2021-12-18 20:53:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-18 20:53:32,188 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:53:32,188 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:53:32,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-12-18 20:53:32,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-12-18 20:53:32,404 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:53:32,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:53:32,404 INFO L85 PathProgramCache]: Analyzing trace with hash -583799534, now seen corresponding path program 1 times [2021-12-18 20:53:32,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:53:32,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063237244] [2021-12-18 20:53:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:32,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:53:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:32,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:53:32,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063237244] [2021-12-18 20:53:32,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063237244] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:53:32,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576731523] [2021-12-18 20:53:32,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:32,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:32,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:53:32,680 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:53:32,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-12-18 20:53:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:32,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-18 20:53:32,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:53:32,965 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 20:53:32,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 20:53:33,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:33,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:33,111 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:53:33,111 INFO L388 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 21 treesize of output 25 [2021-12-18 20:53:33,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:53:33,125 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:33,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 20:53:33,176 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:33,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 20:53:33,181 INFO L388 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 [2021-12-18 20:53:33,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:33,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-18 20:53:33,220 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-18 20:53:33,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-18 20:53:33,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:33,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:53:33,271 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:53:33,271 INFO L388 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 21 treesize of output 25 [2021-12-18 20:53:33,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:53:33,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:33,286 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-18 20:53:33,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2021-12-18 20:53:33,414 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-18 20:53:33,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 99 [2021-12-18 20:53:33,420 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:33,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 103 [2021-12-18 20:53:33,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2021-12-18 20:53:33,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:33,521 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:53:33,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2021-12-18 20:53:33,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2021-12-18 20:53:33,564 INFO L388 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 [2021-12-18 20:53:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:33,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:53:33,610 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3430 (Array Int Int)) (v_ArrVal_3431 (Array Int Int)) (v_ArrVal_3432 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3430) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3431) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3432) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2021-12-18 20:53:33,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3430 (Array Int Int)) (v_ArrVal_3431 (Array Int Int)) (v_ArrVal_3432 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3430) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3431) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3432) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2021-12-18 20:53:33,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3430 (Array Int Int)) (v_ArrVal_3431 (Array Int Int)) (v_ArrVal_3432 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_3430) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3431) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3432) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)) is different from false [2021-12-18 20:53:33,754 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:33,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2021-12-18 20:53:33,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:53:33,759 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:33,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2021-12-18 20:53:33,765 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:33,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 121 [2021-12-18 20:53:33,768 INFO L388 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 45 treesize of output 27 [2021-12-18 20:53:33,796 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:33,810 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:33,861 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:33,879 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:33,898 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:33,918 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:33,938 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:33,957 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:33,997 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:34,019 INFO L388 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 30 treesize of output 22 [2021-12-18 20:53:34,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2021-12-18 20:53:34,149 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:34,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 94 [2021-12-18 20:53:34,154 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:34,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 84 [2021-12-18 20:53:34,160 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:34,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 144 [2021-12-18 20:53:34,168 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:34,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 370 treesize of output 361 [2021-12-18 20:53:34,196 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:34,196 INFO L388 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 371 treesize of output 279 [2021-12-18 20:53:34,202 INFO L388 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 222 treesize of output 214 [2021-12-18 20:53:34,206 INFO L388 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 214 treesize of output 210 [2021-12-18 20:53:34,210 INFO L388 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 210 treesize of output 202 [2021-12-18 20:53:34,213 INFO L388 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 202 treesize of output 186 [2021-12-18 20:53:34,503 INFO L354 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-12-18 20:53:34,504 INFO L388 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 37 treesize of output 35 [2021-12-18 20:53:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-12-18 20:53:34,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576731523] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:53:34,543 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:53:34,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 49 [2021-12-18 20:53:34,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690343315] [2021-12-18 20:53:34,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:53:34,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-18 20:53:34,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:53:34,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-18 20:53:34,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1809, Unknown=28, NotChecked=270, Total=2352 [2021-12-18 20:53:34,544 INFO L87 Difference]: Start difference. First operand 558 states and 656 transitions. Second operand has 49 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:53:35,595 INFO L93 Difference]: Finished difference Result 691 states and 807 transitions. [2021-12-18 20:53:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-18 20:53:35,595 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 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 51 [2021-12-18 20:53:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:53:35,597 INFO L225 Difference]: With dead ends: 691 [2021-12-18 20:53:35,597 INFO L226 Difference]: Without dead ends: 691 [2021-12-18 20:53:35,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=525, Invalid=3235, Unknown=34, NotChecked=366, Total=4160 [2021-12-18 20:53:35,597 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 538 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1658 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 20:53:35,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [538 Valid, 1640 Invalid, 3695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1962 Invalid, 0 Unknown, 1658 Unchecked, 0.6s Time] [2021-12-18 20:53:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-12-18 20:53:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 558. [2021-12-18 20:53:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 546 states have (on average 1.2014652014652014) internal successors, (656), 557 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 656 transitions. [2021-12-18 20:53:35,602 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 656 transitions. Word has length 51 [2021-12-18 20:53:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:53:35,603 INFO L470 AbstractCegarLoop]: Abstraction has 558 states and 656 transitions. [2021-12-18 20:53:35,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:53:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 656 transitions. [2021-12-18 20:53:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-18 20:53:35,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:53:35,604 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:53:35,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-12-18 20:53:35,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-12-18 20:53:35,807 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:53:35,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:53:35,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1013030303, now seen corresponding path program 1 times [2021-12-18 20:53:35,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:53:35,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599755306] [2021-12-18 20:53:35,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:35,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:53:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:36,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:53:36,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599755306] [2021-12-18 20:53:36,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599755306] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:53:36,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033714223] [2021-12-18 20:53:36,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:53:36,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:53:36,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:53:36,074 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:53:36,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-12-18 20:53:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:53:36,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-18 20:53:36,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:53:36,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:53:36,548 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:36,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2021-12-18 20:53:36,758 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:36,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2021-12-18 20:53:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:53:36,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:53:37,190 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3509 (Array Int Int))) (= 0 (select |c_ULTIMATE.start_main_old_#valid#1| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3509) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_3509 (Array Int Int))) (= (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3509) |c_ULTIMATE.start_main_~a~0#1.base|) 8))) (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) .cse0 (select |c_ULTIMATE.start_main_old_#valid#1| .cse0))) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2021-12-18 20:53:37,201 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3509 (Array Int Int))) (= 0 (select |c_ULTIMATE.start_main_old_#valid#1| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3509) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_3509 (Array Int Int))) (= (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3509) |c_ULTIMATE.start_main_~a~0#1.base|) 8))) (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) .cse0 (select |c_ULTIMATE.start_main_old_#valid#1| .cse0))) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2021-12-18 20:53:37,205 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3509 (Array Int Int))) (= (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_3509) |c_ULTIMATE.start_main_~a~0#1.base|) 8))) (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) .cse0 (select |c_ULTIMATE.start_main_old_#valid#1| .cse0))) |c_ULTIMATE.start_main_old_#valid#1|)) (forall ((v_ArrVal_3509 (Array Int Int))) (= 0 (select |c_ULTIMATE.start_main_old_#valid#1| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_3509) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2021-12-18 20:53:37,210 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:37,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 20:53:37,213 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:37,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2021-12-18 20:53:37,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-18 20:53:37,228 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:37,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2021-12-18 20:53:37,231 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:37,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 61 [2021-12-18 20:53:37,233 INFO L388 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 23 treesize of output 19 [2021-12-18 20:54:58,057 WARN L227 SmtUtils]: Spent 20.42s on a formula simplification. DAG size of input: 48 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 20:55:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2021-12-18 20:55:06,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033714223] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:55:06,412 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:55:06,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 44 [2021-12-18 20:55:06,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139481151] [2021-12-18 20:55:06,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:55:06,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-18 20:55:06,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:55:06,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-18 20:55:06,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1548, Unknown=31, NotChecked=246, Total=1980 [2021-12-18 20:55:06,414 INFO L87 Difference]: Start difference. First operand 558 states and 656 transitions. Second operand has 45 states, 44 states have (on average 3.2954545454545454) internal successors, (145), 45 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:15,279 INFO L93 Difference]: Finished difference Result 586 states and 683 transitions. [2021-12-18 20:55:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-18 20:55:15,279 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.2954545454545454) internal successors, (145), 45 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-12-18 20:55:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:15,281 INFO L225 Difference]: With dead ends: 586 [2021-12-18 20:55:15,281 INFO L226 Difference]: Without dead ends: 576 [2021-12-18 20:55:15,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 90.3s TimeCoverageRelationStatistics Valid=266, Invalid=2574, Unknown=34, NotChecked=318, Total=3192 [2021-12-18 20:55:15,281 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 76 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 414 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:15,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 795 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 234 Invalid, 0 Unknown, 414 Unchecked, 0.1s Time] [2021-12-18 20:55:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-12-18 20:55:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 554. [2021-12-18 20:55:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 542 states have (on average 1.2011070110701108) internal successors, (651), 553 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 651 transitions. [2021-12-18 20:55:15,285 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 651 transitions. Word has length 52 [2021-12-18 20:55:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:15,285 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 651 transitions. [2021-12-18 20:55:15,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.2954545454545454) internal successors, (145), 45 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 651 transitions. [2021-12-18 20:55:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-18 20:55:15,286 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:15,286 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:15,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:15,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:55:15,498 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 41 more)] === [2021-12-18 20:55:15,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash 22625035, now seen corresponding path program 2 times [2021-12-18 20:55:15,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:55:15,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653698432] [2021-12-18 20:55:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:15,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:55:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 20:55:15,527 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 20:55:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 20:55:15,551 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-18 20:55:15,551 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 20:55:15,552 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr33REQUIRES_VIOLATION (44 of 45 remaining) [2021-12-18 20:55:15,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (43 of 45 remaining) [2021-12-18 20:55:15,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (42 of 45 remaining) [2021-12-18 20:55:15,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (41 of 45 remaining) [2021-12-18 20:55:15,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (40 of 45 remaining) [2021-12-18 20:55:15,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (39 of 45 remaining) [2021-12-18 20:55:15,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (38 of 45 remaining) [2021-12-18 20:55:15,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (37 of 45 remaining) [2021-12-18 20:55:15,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (36 of 45 remaining) [2021-12-18 20:55:15,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (35 of 45 remaining) [2021-12-18 20:55:15,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (34 of 45 remaining) [2021-12-18 20:55:15,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (33 of 45 remaining) [2021-12-18 20:55:15,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (32 of 45 remaining) [2021-12-18 20:55:15,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (31 of 45 remaining) [2021-12-18 20:55:15,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (30 of 45 remaining) [2021-12-18 20:55:15,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (29 of 45 remaining) [2021-12-18 20:55:15,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (28 of 45 remaining) [2021-12-18 20:55:15,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (27 of 45 remaining) [2021-12-18 20:55:15,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (26 of 45 remaining) [2021-12-18 20:55:15,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (25 of 45 remaining) [2021-12-18 20:55:15,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (24 of 45 remaining) [2021-12-18 20:55:15,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (23 of 45 remaining) [2021-12-18 20:55:15,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (22 of 45 remaining) [2021-12-18 20:55:15,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (21 of 45 remaining) [2021-12-18 20:55:15,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (20 of 45 remaining) [2021-12-18 20:55:15,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (19 of 45 remaining) [2021-12-18 20:55:15,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (18 of 45 remaining) [2021-12-18 20:55:15,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (17 of 45 remaining) [2021-12-18 20:55:15,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (16 of 45 remaining) [2021-12-18 20:55:15,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (15 of 45 remaining) [2021-12-18 20:55:15,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (14 of 45 remaining) [2021-12-18 20:55:15,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (13 of 45 remaining) [2021-12-18 20:55:15,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (12 of 45 remaining) [2021-12-18 20:55:15,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (11 of 45 remaining) [2021-12-18 20:55:15,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (10 of 45 remaining) [2021-12-18 20:55:15,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (9 of 45 remaining) [2021-12-18 20:55:15,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (8 of 45 remaining) [2021-12-18 20:55:15,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (7 of 45 remaining) [2021-12-18 20:55:15,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (6 of 45 remaining) [2021-12-18 20:55:15,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (5 of 45 remaining) [2021-12-18 20:55:15,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (4 of 45 remaining) [2021-12-18 20:55:15,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (3 of 45 remaining) [2021-12-18 20:55:15,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (2 of 45 remaining) [2021-12-18 20:55:15,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (1 of 45 remaining) [2021-12-18 20:55:15,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (0 of 45 remaining) [2021-12-18 20:55:15,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-12-18 20:55:15,560 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:15,562 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 20:55:15,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:55:15 BoogieIcfgContainer [2021-12-18 20:55:15,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 20:55:15,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 20:55:15,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 20:55:15,610 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 20:55:15,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:51:48" (3/4) ... [2021-12-18 20:55:15,611 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-18 20:55:15,651 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 20:55:15,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 20:55:15,651 INFO L158 Benchmark]: Toolchain (without parser) took 207626.02ms. Allocated memory was 109.1MB in the beginning and 488.6MB in the end (delta: 379.6MB). Free memory was 71.9MB in the beginning and 434.0MB in the end (delta: -362.1MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2021-12-18 20:55:15,651 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 80.7MB in the beginning and 80.7MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 20:55:15,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.61ms. Allocated memory is still 109.1MB. Free memory was 71.6MB in the beginning and 77.6MB in the end (delta: -6.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 20:55:15,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.85ms. Allocated memory is still 109.1MB. Free memory was 77.1MB in the beginning and 75.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 20:55:15,652 INFO L158 Benchmark]: Boogie Preprocessor took 47.76ms. Allocated memory is still 109.1MB. Free memory was 75.0MB in the beginning and 73.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 20:55:15,652 INFO L158 Benchmark]: RCFGBuilder took 517.40ms. Allocated memory is still 109.1MB. Free memory was 73.4MB in the beginning and 56.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-18 20:55:15,652 INFO L158 Benchmark]: TraceAbstraction took 206705.85ms. Allocated memory was 109.1MB in the beginning and 488.6MB in the end (delta: 379.6MB). Free memory was 55.9MB in the beginning and 438.1MB in the end (delta: -382.2MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. [2021-12-18 20:55:15,652 INFO L158 Benchmark]: Witness Printer took 41.63ms. Allocated memory is still 488.6MB. Free memory was 438.1MB in the beginning and 434.0MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 20:55:15,653 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 80.7MB in the beginning and 80.7MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.61ms. Allocated memory is still 109.1MB. Free memory was 71.6MB in the beginning and 77.6MB in the end (delta: -6.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.85ms. Allocated memory is still 109.1MB. Free memory was 77.1MB in the beginning and 75.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.76ms. Allocated memory is still 109.1MB. Free memory was 75.0MB in the beginning and 73.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 517.40ms. Allocated memory is still 109.1MB. Free memory was 73.4MB in the beginning and 56.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 206705.85ms. Allocated memory was 109.1MB in the beginning and 488.6MB in the end (delta: 379.6MB). Free memory was 55.9MB in the beginning and 438.1MB in the end (delta: -382.2MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. * Witness Printer took 41.63ms. Allocated memory is still 488.6MB. Free memory was 438.1MB in the beginning and 434.0MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 610]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L567] List p, a, t; [L568] a = (List) malloc(sizeof(struct node)) [L569] COND FALSE !(a == 0) VAL [a={6:0}] [L570] a->n = 0 VAL [a={6:0}] [L571] p = a [L572] int i = 0; VAL [a={6:0}, i=0, p={6:0}] [L573] i < 20 && __VERIFIER_nondet_int() [L573] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, a={6:0}, i=0, i < 20 && __VERIFIER_nondet_int()=1, p={6:0}] [L573] COND TRUE i < 20 && __VERIFIER_nondet_int() [L574] i++ [L575] p->flag = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={6:0}, i=1, p={6:0}] [L576] p->flag VAL [a={6:0}, i=1, p={6:0}, p->flag=0] [L576] COND FALSE !(p->flag) [L579] p->h = 2 VAL [a={6:0}, i=1, p={6:0}] [L581] t = (List) malloc(sizeof(struct node)) [L582] COND FALSE !(t == 0) VAL [a={6:0}, i=1, p={6:0}, t={-1:0}] [L583] p->n = t VAL [a={6:0}, i=1, p={6:0}, t={-1:0}] [L584] EXPR p->n VAL [a={6:0}, i=1, p={6:0}, p->n={-1:0}, t={-1:0}] [L584] p = p->n [L573] i < 20 && __VERIFIER_nondet_int() [L573] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={6:0}, i=1, i < 20 && __VERIFIER_nondet_int()=0, p={-1:0}, t={-1:0}] [L573] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L586] p->h = 3 VAL [a={6:0}, i=1, p={-1:0}, t={-1:0}] [L587] p = a VAL [a={6:0}, i=1, p={6:0}, t={-1:0}] [L588] EXPR p->h VAL [a={6:0}, i=1, p={6:0}, p->h=2, t={-1:0}] [L588] COND TRUE p->h != 3 [L589] p->flag VAL [a={6:0}, i=1, p={6:0}, p->flag=0, t={-1:0}] [L589] COND FALSE !(p->flag) [L593] EXPR p->h VAL [a={6:0}, i=1, p={6:0}, p->h=2, t={-1:0}] [L593] COND FALSE !(p->h != 2) [L596] EXPR p->n VAL [a={6:0}, i=1, p={6:0}, p->n={-1:0}, t={-1:0}] [L596] p = p->n [L597] i++ VAL [a={6:0}, i=2, p={-1:0}, t={-1:0}] [L588] EXPR p->h VAL [a={6:0}, i=2, p={-1:0}, p->h=3, t={-1:0}] [L588] COND FALSE !(p->h != 3) [L599] EXPR p->h VAL [a={6:0}, i=2, p={-1:0}, p->h=3, t={-1:0}] [L599] COND FALSE !(p->h != 3 || i > 20) [L601] p = a VAL [a={6:0}, i=2, p={6:0}, t={-1:0}] [L602] COND FALSE !(p == 0) VAL [a={6:0}, i=2, p={6:0}, t={-1:0}] [L605] EXPR p->n VAL [a={6:0}, i=2, p={6:0}, p->n={-1:0}, t={-1:0}] [L605] COND FALSE !(p->n == 0) [L610] EXPR p->n VAL [a={6:0}, i=2, p={6:0}, p->n={-1:0}, t={-1:0}] [L610] COND TRUE p->n != 0 [L611] EXPR p->n VAL [a={6:0}, i=2, p={6:0}, p->n={-1:0}, t={-1:0}] [L611] t = p->n [L612] free(p) VAL [a={6:0}, i=2, p={6:0}, t={-1:0}] [L612] free(p) VAL [a={6:0}, i=2, p={6:0}, t={-1:0}] [L612] free(p) [L613] p = t VAL [a={6:0}, i=2, p={-1:0}, t={-1:0}] [L610] EXPR p->n VAL [a={6:0}, i=2, p={-1:0}, p->n={59:58}, t={-1:0}] [L610] COND TRUE p->n != 0 [L611] EXPR p->n VAL [a={6:0}, i=2, p={-1:0}, p->n={59:58}, t={-1:0}] [L611] t = p->n [L612] free(p) VAL [a={6:0}, i=2, p={-1:0}, t={59:58}] [L612] free(p) VAL [a={6:0}, i=2, p={-1:0}, t={59:58}] [L612] free(p) [L613] p = t VAL [a={6:0}, i=2, p={59:58}, t={59:58}] [L610] p->n - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 590]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 590]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 596]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 596]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 611]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 611]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 206.6s, OverallIterations: 50, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 47.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14594 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14594 mSDsluCounter, 34763 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 30663 IncrementalHoareTripleChecker+Unchecked, 31602 mSDsCounter, 2389 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28348 IncrementalHoareTripleChecker+Invalid, 61400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2389 mSolverCounterUnsat, 3161 mSDtfsCounter, 28348 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4208 GetRequests, 2170 SyntacticMatches, 215 SemanticMatches, 1823 ConstructedPredicates, 127 IntricatePredicates, 7 DeprecatedPredicates, 27323 ImplicationChecksByTransitivity, 138.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred in iteration=45, InterpolantAutomatonStates: 960, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 49 MinimizatonAttempts, 3944 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 145.2s InterpolantComputationTime, 3276 NumberOfCodeBlocks, 3276 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 4567 ConstructedInterpolants, 1034 QuantifiedInterpolants, 86702 SizeOfPredicates, 533 NumberOfNonLiveVariables, 9510 ConjunctsInSsa, 1473 ConjunctsInUnsatCore, 120 InterpolantComputations, 14 PerfectInterpolantSequences, 77/1152 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-18 20:55:15,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)