./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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/memsafety/lockfree-3.0.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 ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:14:28,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:14:28,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:14:28,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:14:28,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:14:28,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:14:28,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:14:28,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:14:28,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:14:28,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:14:28,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:14:28,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:14:28,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:14:28,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:14:28,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:14:28,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:14:28,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:14:28,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:14:28,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:14:28,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:14:28,168 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:14:28,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:14:28,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:14:28,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:14:28,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:14:28,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:14:28,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:14:28,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:14:28,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:14:28,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:14:28,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:14:28,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:14:28,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:14:28,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:14:28,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:14:28,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:14:28,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:14:28,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:14:28,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:14:28,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:14:28,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:14:28,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:14:28,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:14:28,247 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:14:28,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:14:28,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:14:28,252 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:14:28,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:14:28,252 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:14:28,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:14:28,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:14:28,253 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:14:28,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:14:28,253 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:14:28,253 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:14:28,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:14:28,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:14:28,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:14:28,254 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:14:28,254 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:14:28,254 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:14:28,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:14:28,254 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:14:28,254 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:14:28,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:14:28,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:14:28,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:14:28,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:14:28,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:14:28,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:14:28,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:14:28,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:14:28,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:14:28,272 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 -> ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea [2022-07-14 06:14:28,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:14:28,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:14:28,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:14:28,631 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:14:28,640 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:14:28,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.0.i [2022-07-14 06:14:28,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7950e2834/6d2a7fdfffbd4f168922b7c185320fdc/FLAG0aad72712 [2022-07-14 06:14:29,434 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:14:29,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.0.i [2022-07-14 06:14:29,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7950e2834/6d2a7fdfffbd4f168922b7c185320fdc/FLAG0aad72712 [2022-07-14 06:14:29,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7950e2834/6d2a7fdfffbd4f168922b7c185320fdc [2022-07-14 06:14:29,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:14:29,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:14:29,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:14:29,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:14:29,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:14:29,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:14:29" (1/1) ... [2022-07-14 06:14:29,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283da943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:29, skipping insertion in model container [2022-07-14 06:14:29,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:14:29" (1/1) ... [2022-07-14 06:14:29,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:14:29,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:14:30,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:14:30,235 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:14:30,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:14:30,316 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:14:30,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:30 WrapperNode [2022-07-14 06:14:30,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:14:30,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:14:30,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:14:30,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:14:30,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:30" (1/1) ... [2022-07-14 06:14:30,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:30" (1/1) ... [2022-07-14 06:14:30,412 INFO L137 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2022-07-14 06:14:30,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:14:30,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:14:30,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:14:30,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:14:30,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:30" (1/1) ... [2022-07-14 06:14:30,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:30" (1/1) ... [2022-07-14 06:14:30,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:30" (1/1) ... [2022-07-14 06:14:30,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:30" (1/1) ... [2022-07-14 06:14:30,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:30" (1/1) ... [2022-07-14 06:14:30,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:30" (1/1) ... [2022-07-14 06:14:30,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:30" (1/1) ... [2022-07-14 06:14:30,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:14:30,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:14:30,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:14:30,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:14:30,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:30" (1/1) ... [2022-07-14 06:14:30,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:14:30,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:30,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 06:14:30,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 06:14:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:14:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:14:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:14:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:14:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:14:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:14:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:14:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:14:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:14:30,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:14:30,831 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:14:30,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:14:31,321 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:14:31,339 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:14:31,340 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 06:14:31,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:14:31 BoogieIcfgContainer [2022-07-14 06:14:31,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:14:31,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:14:31,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:14:31,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:14:31,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:14:29" (1/3) ... [2022-07-14 06:14:31,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cd4429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:14:31, skipping insertion in model container [2022-07-14 06:14:31,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:14:30" (2/3) ... [2022-07-14 06:14:31,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cd4429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:14:31, skipping insertion in model container [2022-07-14 06:14:31,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:14:31" (3/3) ... [2022-07-14 06:14:31,363 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.0.i [2022-07-14 06:14:31,388 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:14:31,389 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-14 06:14:31,484 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:14:31,492 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@250b1479, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@33eef758 [2022-07-14 06:14:31,492 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-14 06:14:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 06:14:31,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:31,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 06:14:31,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:31,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2022-07-14 06:14:31,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:31,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869818320] [2022-07-14 06:14:31,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:31,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:31,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:31,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869818320] [2022-07-14 06:14:31,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869818320] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:14:31,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:14:31,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:14:31,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667329263] [2022-07-14 06:14:31,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:14:31,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 06:14:31,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:31,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 06:14:31,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:14:31,798 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:31,824 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-07-14 06:14:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 06:14:31,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 06:14:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:31,840 INFO L225 Difference]: With dead ends: 64 [2022-07-14 06:14:31,840 INFO L226 Difference]: Without dead ends: 62 [2022-07-14 06:14:31,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:14:31,853 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:31,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:14:31,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-14 06:14:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-14 06:14:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-07-14 06:14:31,928 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2022-07-14 06:14:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:31,929 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-07-14 06:14:31,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-07-14 06:14:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:14:31,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:31,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:31,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:14:31,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:31,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:31,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2022-07-14 06:14:31,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:31,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982885054] [2022-07-14 06:14:31,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:31,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:32,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:32,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982885054] [2022-07-14 06:14:32,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982885054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:14:32,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:14:32,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:14:32,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695756069] [2022-07-14 06:14:32,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:14:32,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:14:32,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:32,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:14:32,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:14:32,065 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:32,089 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-07-14 06:14:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:14:32,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:14:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:32,106 INFO L225 Difference]: With dead ends: 63 [2022-07-14 06:14:32,106 INFO L226 Difference]: Without dead ends: 63 [2022-07-14 06:14:32,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:14:32,112 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:32,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:14:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-14 06:14:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-14 06:14:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2022-07-14 06:14:32,126 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2022-07-14 06:14:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:32,127 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2022-07-14 06:14:32,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-07-14 06:14:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:14:32,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:32,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:32,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:14:32,139 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:32,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:32,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2022-07-14 06:14:32,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:32,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980625786] [2022-07-14 06:14:32,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:32,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:32,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:32,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980625786] [2022-07-14 06:14:32,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980625786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:14:32,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:14:32,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:14:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882380133] [2022-07-14 06:14:32,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:14:32,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:14:32,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:32,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:14:32,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:14:32,257 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:32,312 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2022-07-14 06:14:32,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:14:32,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:14:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:32,314 INFO L225 Difference]: With dead ends: 111 [2022-07-14 06:14:32,315 INFO L226 Difference]: Without dead ends: 111 [2022-07-14 06:14:32,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:14:32,332 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:32,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:14:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-14 06:14:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2022-07-14 06:14:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2022-07-14 06:14:32,350 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2022-07-14 06:14:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:32,351 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2022-07-14 06:14:32,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2022-07-14 06:14:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:14:32,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:32,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:32,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:14:32,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:32,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:32,352 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2022-07-14 06:14:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:32,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874710227] [2022-07-14 06:14:32,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:32,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:32,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:32,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874710227] [2022-07-14 06:14:32,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874710227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:14:32,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:14:32,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:14:32,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794766278] [2022-07-14 06:14:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:14:32,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:14:32,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:32,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:14:32,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:14:32,471 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:32,558 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2022-07-14 06:14:32,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:14:32,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:14:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:32,561 INFO L225 Difference]: With dead ends: 101 [2022-07-14 06:14:32,561 INFO L226 Difference]: Without dead ends: 101 [2022-07-14 06:14:32,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:14:32,565 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 6 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:32,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 211 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-14 06:14:32,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-07-14 06:14:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 94 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2022-07-14 06:14:32,593 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 8 [2022-07-14 06:14:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:32,594 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2022-07-14 06:14:32,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2022-07-14 06:14:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:14:32,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:32,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:32,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:14:32,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:32,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:32,596 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2022-07-14 06:14:32,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:32,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915714281] [2022-07-14 06:14:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:32,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:32,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:32,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915714281] [2022-07-14 06:14:32,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915714281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:14:32,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:14:32,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:14:32,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877419844] [2022-07-14 06:14:32,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:14:32,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:14:32,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:32,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:14:32,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:14:32,669 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:32,759 INFO L93 Difference]: Finished difference Result 177 states and 261 transitions. [2022-07-14 06:14:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:14:32,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:14:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:32,762 INFO L225 Difference]: With dead ends: 177 [2022-07-14 06:14:32,762 INFO L226 Difference]: Without dead ends: 174 [2022-07-14 06:14:32,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:14:32,764 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:32,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:32,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-14 06:14:32,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 153. [2022-07-14 06:14:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.849624060150376) internal successors, (246), 152 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 246 transitions. [2022-07-14 06:14:32,789 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 246 transitions. Word has length 8 [2022-07-14 06:14:32,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:32,789 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 246 transitions. [2022-07-14 06:14:32,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,789 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-07-14 06:14:32,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:14:32,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:32,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:32,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:14:32,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:32,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:32,791 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2022-07-14 06:14:32,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:32,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979620117] [2022-07-14 06:14:32,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:32,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:32,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:32,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979620117] [2022-07-14 06:14:32,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979620117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:14:32,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:14:32,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:14:32,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17020705] [2022-07-14 06:14:32,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:14:32,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:14:32,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:32,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:14:32,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:14:32,847 INFO L87 Difference]: Start difference. First operand 153 states and 246 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:32,964 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2022-07-14 06:14:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:14:32,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:14:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:32,966 INFO L225 Difference]: With dead ends: 231 [2022-07-14 06:14:32,966 INFO L226 Difference]: Without dead ends: 231 [2022-07-14 06:14:32,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:14:32,967 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 69 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:32,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-14 06:14:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 208. [2022-07-14 06:14:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 190 states have (on average 1.7894736842105263) internal successors, (340), 207 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 340 transitions. [2022-07-14 06:14:32,975 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 340 transitions. Word has length 8 [2022-07-14 06:14:32,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:32,975 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 340 transitions. [2022-07-14 06:14:32,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 340 transitions. [2022-07-14 06:14:32,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:14:32,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:32,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:32,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:14:32,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:32,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:32,978 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2022-07-14 06:14:32,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:32,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178455418] [2022-07-14 06:14:32,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:32,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:33,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:33,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178455418] [2022-07-14 06:14:33,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178455418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:14:33,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:14:33,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:14:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193927649] [2022-07-14 06:14:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:14:33,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:14:33,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:33,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:14:33,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:14:33,014 INFO L87 Difference]: Start difference. First operand 208 states and 340 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:33,074 INFO L93 Difference]: Finished difference Result 226 states and 346 transitions. [2022-07-14 06:14:33,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:14:33,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:14:33,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:33,075 INFO L225 Difference]: With dead ends: 226 [2022-07-14 06:14:33,075 INFO L226 Difference]: Without dead ends: 226 [2022-07-14 06:14:33,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:14:33,076 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 68 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:33,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 180 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-14 06:14:33,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 206. [2022-07-14 06:14:33,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 190 states have (on average 1.7473684210526317) internal successors, (332), 205 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:33,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 332 transitions. [2022-07-14 06:14:33,083 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 332 transitions. Word has length 8 [2022-07-14 06:14:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:33,084 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 332 transitions. [2022-07-14 06:14:33,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 332 transitions. [2022-07-14 06:14:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:14:33,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:33,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:33,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:14:33,085 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:33,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:33,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2022-07-14 06:14:33,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:33,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682858302] [2022-07-14 06:14:33,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:33,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:33,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:33,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682858302] [2022-07-14 06:14:33,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682858302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:14:33,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:14:33,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:14:33,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72932806] [2022-07-14 06:14:33,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:14:33,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:14:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:33,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:14:33,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:14:33,144 INFO L87 Difference]: Start difference. First operand 206 states and 332 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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) [2022-07-14 06:14:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:33,181 INFO L93 Difference]: Finished difference Result 265 states and 366 transitions. [2022-07-14 06:14:33,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:14:33,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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 [2022-07-14 06:14:33,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:33,183 INFO L225 Difference]: With dead ends: 265 [2022-07-14 06:14:33,183 INFO L226 Difference]: Without dead ends: 265 [2022-07-14 06:14:33,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:14:33,184 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 105 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:33,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 279 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:14:33,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-14 06:14:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 163. [2022-07-14 06:14:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.6821192052980132) internal successors, (254), 162 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 254 transitions. [2022-07-14 06:14:33,190 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 254 transitions. Word has length 9 [2022-07-14 06:14:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:33,190 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 254 transitions. [2022-07-14 06:14:33,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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) [2022-07-14 06:14:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 254 transitions. [2022-07-14 06:14:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:14:33,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:33,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:33,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:14:33,208 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:33,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2022-07-14 06:14:33,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:33,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909679567] [2022-07-14 06:14:33,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:33,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:33,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:33,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909679567] [2022-07-14 06:14:33,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909679567] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:14:33,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:14:33,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:14:33,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604902912] [2022-07-14 06:14:33,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:14:33,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:14:33,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:33,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:14:33,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:14:33,268 INFO L87 Difference]: Start difference. First operand 163 states and 254 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:33,313 INFO L93 Difference]: Finished difference Result 362 states and 528 transitions. [2022-07-14 06:14:33,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:14:33,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 06:14:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:33,316 INFO L225 Difference]: With dead ends: 362 [2022-07-14 06:14:33,316 INFO L226 Difference]: Without dead ends: 362 [2022-07-14 06:14:33,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:14:33,319 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 107 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:33,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 232 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:14:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-14 06:14:33,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 234. [2022-07-14 06:14:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 222 states have (on average 1.6036036036036037) internal successors, (356), 233 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 356 transitions. [2022-07-14 06:14:33,343 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 356 transitions. Word has length 10 [2022-07-14 06:14:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:33,346 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 356 transitions. [2022-07-14 06:14:33,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 356 transitions. [2022-07-14 06:14:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:14:33,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:33,349 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:33,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:14:33,349 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2022-07-14 06:14:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:33,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459662] [2022-07-14 06:14:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:33,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:33,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:33,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459662] [2022-07-14 06:14:33,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:33,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831954184] [2022-07-14 06:14:33,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:33,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:33,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:33,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:33,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 06:14:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:33,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:14:33,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:33,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:33,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831954184] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:33,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:33,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-14 06:14:33,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998792877] [2022-07-14 06:14:33,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:33,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:14:33,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:33,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:14:33,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:14:33,885 INFO L87 Difference]: Start difference. First operand 234 states and 356 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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) [2022-07-14 06:14:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:33,948 INFO L93 Difference]: Finished difference Result 238 states and 346 transitions. [2022-07-14 06:14:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:14:33,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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 16 [2022-07-14 06:14:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:33,950 INFO L225 Difference]: With dead ends: 238 [2022-07-14 06:14:33,951 INFO L226 Difference]: Without dead ends: 238 [2022-07-14 06:14:33,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:14:33,953 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 142 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:33,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 338 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:14:33,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-14 06:14:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2022-07-14 06:14:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 218 states have (on average 1.5779816513761469) internal successors, (344), 229 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 344 transitions. [2022-07-14 06:14:33,958 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 344 transitions. Word has length 16 [2022-07-14 06:14:33,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:33,959 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 344 transitions. [2022-07-14 06:14:33,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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) [2022-07-14 06:14:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 344 transitions. [2022-07-14 06:14:33,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:14:33,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:33,961 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:34,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:34,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-14 06:14:34,184 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:34,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 617603772, now seen corresponding path program 1 times [2022-07-14 06:14:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:34,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497490023] [2022-07-14 06:14:34,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:34,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:34,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:34,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497490023] [2022-07-14 06:14:34,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497490023] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:34,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005286369] [2022-07-14 06:14:34,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:34,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:34,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:34,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:34,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 06:14:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:34,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:14:34,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:34,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:34,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005286369] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:34,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:34,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-14 06:14:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746544166] [2022-07-14 06:14:34,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:34,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:14:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:34,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:14:34,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:14:34,512 INFO L87 Difference]: Start difference. First operand 230 states and 344 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:34,617 INFO L93 Difference]: Finished difference Result 525 states and 738 transitions. [2022-07-14 06:14:34,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:14:34,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:14:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:34,620 INFO L225 Difference]: With dead ends: 525 [2022-07-14 06:14:34,620 INFO L226 Difference]: Without dead ends: 525 [2022-07-14 06:14:34,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:14:34,622 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 207 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:34,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 528 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:34,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-07-14 06:14:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 323. [2022-07-14 06:14:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.5305466237942122) internal successors, (476), 322 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 476 transitions. [2022-07-14 06:14:34,651 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 476 transitions. Word has length 16 [2022-07-14 06:14:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:34,652 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 476 transitions. [2022-07-14 06:14:34,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 476 transitions. [2022-07-14 06:14:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:14:34,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:34,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:34,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:34,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-14 06:14:34,880 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:34,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:34,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1134377974, now seen corresponding path program 2 times [2022-07-14 06:14:34,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:34,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762509329] [2022-07-14 06:14:34,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:34,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:14:34,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:34,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762509329] [2022-07-14 06:14:34,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762509329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:34,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096216622] [2022-07-14 06:14:34,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:14:34,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:34,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:34,987 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:35,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 06:14:35,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:14:35,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:14:35,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:14:35,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:35,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:35,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096216622] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:35,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:35,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-07-14 06:14:35,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816068159] [2022-07-14 06:14:35,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:35,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:14:35,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:35,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:14:35,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:14:35,168 INFO L87 Difference]: Start difference. First operand 323 states and 476 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:35,313 INFO L93 Difference]: Finished difference Result 525 states and 726 transitions. [2022-07-14 06:14:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:14:35,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:14:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:35,317 INFO L225 Difference]: With dead ends: 525 [2022-07-14 06:14:35,317 INFO L226 Difference]: Without dead ends: 525 [2022-07-14 06:14:35,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:14:35,318 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 399 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:35,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 420 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-07-14 06:14:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 323. [2022-07-14 06:14:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.4919614147909968) internal successors, (464), 322 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 464 transitions. [2022-07-14 06:14:35,326 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 464 transitions. Word has length 22 [2022-07-14 06:14:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:35,326 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 464 transitions. [2022-07-14 06:14:35,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 464 transitions. [2022-07-14 06:14:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:14:35,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:35,328 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:35,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:35,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:35,542 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:35,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:35,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1692627395, now seen corresponding path program 1 times [2022-07-14 06:14:35,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:35,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053812302] [2022-07-14 06:14:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:35,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:35,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053812302] [2022-07-14 06:14:35,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053812302] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:35,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967303721] [2022-07-14 06:14:35,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:35,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:35,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:35,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:35,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 06:14:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:35,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:14:35,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:35,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:35,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967303721] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:35,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:35,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-07-14 06:14:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050777107] [2022-07-14 06:14:35,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:35,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:14:35,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:35,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:14:35,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:14:35,863 INFO L87 Difference]: Start difference. First operand 323 states and 464 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:35,924 INFO L93 Difference]: Finished difference Result 936 states and 1334 transitions. [2022-07-14 06:14:35,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:14:35,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-14 06:14:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:35,928 INFO L225 Difference]: With dead ends: 936 [2022-07-14 06:14:35,928 INFO L226 Difference]: Without dead ends: 936 [2022-07-14 06:14:35,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:14:35,929 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 177 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:35,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 167 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:14:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-07-14 06:14:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 811. [2022-07-14 06:14:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 799 states have (on average 1.4793491864831039) internal successors, (1182), 810 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1182 transitions. [2022-07-14 06:14:35,944 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1182 transitions. Word has length 24 [2022-07-14 06:14:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:35,946 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 1182 transitions. [2022-07-14 06:14:35,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1182 transitions. [2022-07-14 06:14:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:14:35,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:35,947 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:36,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:36,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:36,171 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:36,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2022-07-14 06:14:36,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:36,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423418778] [2022-07-14 06:14:36,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:36,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:36,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:36,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423418778] [2022-07-14 06:14:36,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423418778] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:36,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903220514] [2022-07-14 06:14:36,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:36,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:36,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:36,279 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:36,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 06:14:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:36,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:14:36,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:36,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:36,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903220514] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:36,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:36,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-14 06:14:36,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999194796] [2022-07-14 06:14:36,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:36,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:14:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:36,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:14:36,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:14:36,523 INFO L87 Difference]: Start difference. First operand 811 states and 1182 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:36,721 INFO L93 Difference]: Finished difference Result 2807 states and 3858 transitions. [2022-07-14 06:14:36,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:14:36,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:14:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:36,749 INFO L225 Difference]: With dead ends: 2807 [2022-07-14 06:14:36,749 INFO L226 Difference]: Without dead ends: 2807 [2022-07-14 06:14:36,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:14:36,750 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 559 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:36,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 583 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2022-07-14 06:14:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 1879. [2022-07-14 06:14:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1867 states have (on average 1.432244242099625) internal successors, (2674), 1878 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2674 transitions. [2022-07-14 06:14:36,834 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2674 transitions. Word has length 27 [2022-07-14 06:14:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:36,835 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 2674 transitions. [2022-07-14 06:14:36,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2674 transitions. [2022-07-14 06:14:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:14:36,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:36,837 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:36,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:37,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-14 06:14:37,042 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash 554127938, now seen corresponding path program 1 times [2022-07-14 06:14:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:37,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516036541] [2022-07-14 06:14:37,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:37,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:14:37,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:37,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516036541] [2022-07-14 06:14:37,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516036541] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:37,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323997234] [2022-07-14 06:14:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:37,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:37,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:37,168 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:37,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:14:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:37,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:14:37,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:14:37,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:14:37,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323997234] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:37,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:37,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-14 06:14:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538795430] [2022-07-14 06:14:37,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:37,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:14:37,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:37,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:14:37,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:14:37,374 INFO L87 Difference]: Start difference. First operand 1879 states and 2674 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:37,499 INFO L93 Difference]: Finished difference Result 1558 states and 2125 transitions. [2022-07-14 06:14:37,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:14:37,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:14:37,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:37,506 INFO L225 Difference]: With dead ends: 1558 [2022-07-14 06:14:37,506 INFO L226 Difference]: Without dead ends: 1558 [2022-07-14 06:14:37,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:14:37,509 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 376 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:37,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 520 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:37,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2022-07-14 06:14:37,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 885. [2022-07-14 06:14:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 873 states have (on average 1.404352806414662) internal successors, (1226), 884 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1226 transitions. [2022-07-14 06:14:37,560 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1226 transitions. Word has length 27 [2022-07-14 06:14:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:37,561 INFO L495 AbstractCegarLoop]: Abstraction has 885 states and 1226 transitions. [2022-07-14 06:14:37,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1226 transitions. [2022-07-14 06:14:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:14:37,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:37,564 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:37,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:37,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-14 06:14:37,770 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2001409998, now seen corresponding path program 1 times [2022-07-14 06:14:37,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:37,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19845658] [2022-07-14 06:14:37,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:37,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-14 06:14:37,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:37,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19845658] [2022-07-14 06:14:37,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19845658] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:37,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268647445] [2022-07-14 06:14:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:37,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:37,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:37,918 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:37,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:14:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:38,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:14:38,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:38,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:14:38,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268647445] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:38,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:38,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2022-07-14 06:14:38,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220067029] [2022-07-14 06:14:38,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:38,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:14:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:14:38,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:14:38,192 INFO L87 Difference]: Start difference. First operand 885 states and 1226 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:38,667 INFO L93 Difference]: Finished difference Result 2448 states and 3223 transitions. [2022-07-14 06:14:38,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 06:14:38,668 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 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 [2022-07-14 06:14:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:38,691 INFO L225 Difference]: With dead ends: 2448 [2022-07-14 06:14:38,692 INFO L226 Difference]: Without dead ends: 2448 [2022-07-14 06:14:38,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2022-07-14 06:14:38,693 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1404 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:38,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 811 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2022-07-14 06:14:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 984. [2022-07-14 06:14:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 972 states have (on average 1.4207818930041152) internal successors, (1381), 983 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1381 transitions. [2022-07-14 06:14:38,767 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1381 transitions. Word has length 51 [2022-07-14 06:14:38,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:38,769 INFO L495 AbstractCegarLoop]: Abstraction has 984 states and 1381 transitions. [2022-07-14 06:14:38,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1381 transitions. [2022-07-14 06:14:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 06:14:38,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:38,772 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:38,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:38,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:38,988 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1426339750, now seen corresponding path program 1 times [2022-07-14 06:14:38,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:38,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332263043] [2022-07-14 06:14:38,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:38,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-14 06:14:39,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:39,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332263043] [2022-07-14 06:14:39,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332263043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:39,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053901584] [2022-07-14 06:14:39,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:39,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:39,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:39,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:39,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 06:14:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:39,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:14:39,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 06:14:39,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 06:14:39,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053901584] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:39,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:14:39,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2022-07-14 06:14:39,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177734249] [2022-07-14 06:14:39,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:14:39,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:14:39,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:39,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:14:39,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:14:39,476 INFO L87 Difference]: Start difference. First operand 984 states and 1381 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:39,641 INFO L93 Difference]: Finished difference Result 2310 states and 3137 transitions. [2022-07-14 06:14:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:14:39,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-07-14 06:14:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:39,650 INFO L225 Difference]: With dead ends: 2310 [2022-07-14 06:14:39,650 INFO L226 Difference]: Without dead ends: 2310 [2022-07-14 06:14:39,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:14:39,651 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 269 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:39,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 388 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2022-07-14 06:14:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1632. [2022-07-14 06:14:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1620 states have (on average 1.3962962962962964) internal successors, (2262), 1631 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2262 transitions. [2022-07-14 06:14:39,742 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2262 transitions. Word has length 59 [2022-07-14 06:14:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:39,743 INFO L495 AbstractCegarLoop]: Abstraction has 1632 states and 2262 transitions. [2022-07-14 06:14:39,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2262 transitions. [2022-07-14 06:14:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 06:14:39,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:39,745 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:39,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:39,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 06:14:39,968 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:39,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash -443713253, now seen corresponding path program 1 times [2022-07-14 06:14:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:39,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683038284] [2022-07-14 06:14:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 06:14:40,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:40,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683038284] [2022-07-14 06:14:40,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683038284] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:40,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634413455] [2022-07-14 06:14:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:40,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:40,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:40,228 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:40,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 06:14:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:40,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:14:40,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 06:14:40,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 06:14:41,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634413455] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:41,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:41,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2022-07-14 06:14:41,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340852852] [2022-07-14 06:14:41,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:41,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:14:41,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:41,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:14:41,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:14:41,114 INFO L87 Difference]: Start difference. First operand 1632 states and 2262 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:42,672 INFO L93 Difference]: Finished difference Result 9168 states and 12495 transitions. [2022-07-14 06:14:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-14 06:14:42,673 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 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 59 [2022-07-14 06:14:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:42,715 INFO L225 Difference]: With dead ends: 9168 [2022-07-14 06:14:42,715 INFO L226 Difference]: Without dead ends: 9168 [2022-07-14 06:14:42,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2022-07-14 06:14:42,717 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 1489 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:42,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 717 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-14 06:14:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9168 states. [2022-07-14 06:14:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9168 to 4625. [2022-07-14 06:14:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 4614 states have (on average 1.4195925444299957) internal successors, (6550), 4624 states have internal predecessors, (6550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 6550 transitions. [2022-07-14 06:14:42,857 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 6550 transitions. Word has length 59 [2022-07-14 06:14:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:42,858 INFO L495 AbstractCegarLoop]: Abstraction has 4625 states and 6550 transitions. [2022-07-14 06:14:42,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 6550 transitions. [2022-07-14 06:14:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-14 06:14:42,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:42,860 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:42,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-14 06:14:43,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 06:14:43,083 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 1 times [2022-07-14 06:14:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:43,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934872478] [2022-07-14 06:14:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-14 06:14:43,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:43,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934872478] [2022-07-14 06:14:43,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934872478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:43,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438714946] [2022-07-14 06:14:43,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:43,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:43,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:43,217 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:43,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 06:14:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:43,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:14:43,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:14:43,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:14:43,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438714946] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:43,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:43,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2022-07-14 06:14:43,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820938178] [2022-07-14 06:14:43,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:43,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:14:43,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:43,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:14:43,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:14:43,605 INFO L87 Difference]: Start difference. First operand 4625 states and 6550 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:44,404 INFO L93 Difference]: Finished difference Result 10247 states and 14121 transitions. [2022-07-14 06:14:44,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 06:14:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 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 63 [2022-07-14 06:14:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:44,487 INFO L225 Difference]: With dead ends: 10247 [2022-07-14 06:14:44,487 INFO L226 Difference]: Without dead ends: 10247 [2022-07-14 06:14:44,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2022-07-14 06:14:44,489 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 1099 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:44,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1379 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:14:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2022-07-14 06:14:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 4425. [2022-07-14 06:14:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4425 states, 4414 states have (on average 1.3948799275033983) internal successors, (6157), 4424 states have internal predecessors, (6157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 4425 states and 6157 transitions. [2022-07-14 06:14:44,696 INFO L78 Accepts]: Start accepts. Automaton has 4425 states and 6157 transitions. Word has length 63 [2022-07-14 06:14:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:44,697 INFO L495 AbstractCegarLoop]: Abstraction has 4425 states and 6157 transitions. [2022-07-14 06:14:44,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4425 states and 6157 transitions. [2022-07-14 06:14:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-14 06:14:44,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:44,699 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:44,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:44,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:44,918 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:44,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:44,918 INFO L85 PathProgramCache]: Analyzing trace with hash 767429099, now seen corresponding path program 1 times [2022-07-14 06:14:44,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:44,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818929092] [2022-07-14 06:14:44,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 06:14:45,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:45,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818929092] [2022-07-14 06:14:45,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818929092] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:45,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572684115] [2022-07-14 06:14:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:45,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:45,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:45,037 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:45,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 06:14:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:45,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:14:45,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:14:45,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:14:45,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572684115] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:45,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:45,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-14 06:14:45,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267123815] [2022-07-14 06:14:45,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:45,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:14:45,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:45,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:14:45,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:14:45,358 INFO L87 Difference]: Start difference. First operand 4425 states and 6157 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:45,658 INFO L93 Difference]: Finished difference Result 3827 states and 5012 transitions. [2022-07-14 06:14:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:14:45,659 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-07-14 06:14:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:45,676 INFO L225 Difference]: With dead ends: 3827 [2022-07-14 06:14:45,677 INFO L226 Difference]: Without dead ends: 3827 [2022-07-14 06:14:45,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:14:45,678 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 612 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:45,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 2060 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:14:45,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2022-07-14 06:14:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2865. [2022-07-14 06:14:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2854 states have (on average 1.3135949544498948) internal successors, (3749), 2864 states have internal predecessors, (3749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 3749 transitions. [2022-07-14 06:14:45,854 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 3749 transitions. Word has length 63 [2022-07-14 06:14:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:45,855 INFO L495 AbstractCegarLoop]: Abstraction has 2865 states and 3749 transitions. [2022-07-14 06:14:45,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 3749 transitions. [2022-07-14 06:14:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 06:14:45,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:45,858 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:45,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:46,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:46,064 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:46,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:46,065 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2022-07-14 06:14:46,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:46,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7334748] [2022-07-14 06:14:46,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:46,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-14 06:14:46,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:46,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7334748] [2022-07-14 06:14:46,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7334748] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:46,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112298849] [2022-07-14 06:14:46,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:46,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:46,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:46,215 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:46,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 06:14:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:46,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:14:46,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-14 06:14:46,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-14 06:14:46,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112298849] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:46,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:46,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-14 06:14:46,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828027785] [2022-07-14 06:14:46,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:46,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:14:46,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:46,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:14:46,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:14:46,525 INFO L87 Difference]: Start difference. First operand 2865 states and 3749 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:46,620 INFO L93 Difference]: Finished difference Result 2863 states and 3720 transitions. [2022-07-14 06:14:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:14:46,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-07-14 06:14:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:46,625 INFO L225 Difference]: With dead ends: 2863 [2022-07-14 06:14:46,639 INFO L226 Difference]: Without dead ends: 2863 [2022-07-14 06:14:46,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:14:46,640 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 109 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:46,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 256 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2022-07-14 06:14:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2854. [2022-07-14 06:14:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2843 states have (on average 1.307069996482589) internal successors, (3716), 2853 states have internal predecessors, (3716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3716 transitions. [2022-07-14 06:14:46,683 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3716 transitions. Word has length 64 [2022-07-14 06:14:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:46,683 INFO L495 AbstractCegarLoop]: Abstraction has 2854 states and 3716 transitions. [2022-07-14 06:14:46,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3716 transitions. [2022-07-14 06:14:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-14 06:14:46,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:46,684 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:46,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:46,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-14 06:14:46,907 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:46,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:46,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1737502264, now seen corresponding path program 1 times [2022-07-14 06:14:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:46,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022902681] [2022-07-14 06:14:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-14 06:14:46,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:46,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022902681] [2022-07-14 06:14:46,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022902681] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:46,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600680928] [2022-07-14 06:14:46,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:46,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:46,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:46,977 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:46,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 06:14:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:47,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:14:47,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 95 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 06:14:47,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 97 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 06:14:47,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600680928] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:47,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:47,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2022-07-14 06:14:47,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57422755] [2022-07-14 06:14:47,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:47,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:14:47,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:47,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:14:47,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:14:47,348 INFO L87 Difference]: Start difference. First operand 2854 states and 3716 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:47,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:47,619 INFO L93 Difference]: Finished difference Result 3939 states and 5165 transitions. [2022-07-14 06:14:47,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:14:47,620 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-07-14 06:14:47,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:47,626 INFO L225 Difference]: With dead ends: 3939 [2022-07-14 06:14:47,627 INFO L226 Difference]: Without dead ends: 3939 [2022-07-14 06:14:47,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-07-14 06:14:47,629 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 366 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:47,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 778 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2022-07-14 06:14:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 2136. [2022-07-14 06:14:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2125 states have (on average 1.3035294117647058) internal successors, (2770), 2135 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2770 transitions. [2022-07-14 06:14:47,666 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2770 transitions. Word has length 65 [2022-07-14 06:14:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:47,666 INFO L495 AbstractCegarLoop]: Abstraction has 2136 states and 2770 transitions. [2022-07-14 06:14:47,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2770 transitions. [2022-07-14 06:14:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-14 06:14:47,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:47,672 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:47,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:47,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-14 06:14:47,891 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:47,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1937207539, now seen corresponding path program 1 times [2022-07-14 06:14:47,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:47,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882728249] [2022-07-14 06:14:47,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:47,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-14 06:14:47,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:47,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882728249] [2022-07-14 06:14:47,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882728249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:47,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829261378] [2022-07-14 06:14:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:47,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:47,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:47,979 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:48,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 06:14:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:48,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:14:48,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:48,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:14:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-14 06:14:48,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-14 06:14:48,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829261378] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:48,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:48,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-14 06:14:48,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173339027] [2022-07-14 06:14:48,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:48,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:14:48,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:48,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:14:48,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:14:48,899 INFO L87 Difference]: Start difference. First operand 2136 states and 2770 transitions. Second operand has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:49,287 INFO L93 Difference]: Finished difference Result 4146 states and 5271 transitions. [2022-07-14 06:14:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:14:49,288 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 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 69 [2022-07-14 06:14:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:49,296 INFO L225 Difference]: With dead ends: 4146 [2022-07-14 06:14:49,297 INFO L226 Difference]: Without dead ends: 4146 [2022-07-14 06:14:49,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:14:49,302 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 517 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:49,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 624 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:14:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4146 states. [2022-07-14 06:14:49,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 3102. [2022-07-14 06:14:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3102 states, 3091 states have (on average 1.3154318990617924) internal successors, (4066), 3101 states have internal predecessors, (4066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 4066 transitions. [2022-07-14 06:14:49,359 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 4066 transitions. Word has length 69 [2022-07-14 06:14:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:49,359 INFO L495 AbstractCegarLoop]: Abstraction has 3102 states and 4066 transitions. [2022-07-14 06:14:49,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 4066 transitions. [2022-07-14 06:14:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 06:14:49,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:49,362 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 8, 6, 6, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:49,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-14 06:14:49,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:49,576 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:49,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1779624174, now seen corresponding path program 1 times [2022-07-14 06:14:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:49,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339998544] [2022-07-14 06:14:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-07-14 06:14:49,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:49,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339998544] [2022-07-14 06:14:49,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339998544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:14:49,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:14:49,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:14:49,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411567311] [2022-07-14 06:14:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:14:49,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:14:49,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:49,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:14:49,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:14:49,687 INFO L87 Difference]: Start difference. First operand 3102 states and 4066 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:49,809 INFO L93 Difference]: Finished difference Result 6805 states and 8699 transitions. [2022-07-14 06:14:49,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:14:49,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-07-14 06:14:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:49,851 INFO L225 Difference]: With dead ends: 6805 [2022-07-14 06:14:49,852 INFO L226 Difference]: Without dead ends: 6805 [2022-07-14 06:14:49,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:14:49,853 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 192 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:49,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 406 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2022-07-14 06:14:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 3244. [2022-07-14 06:14:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 3233 states have (on average 1.3201360965047944) internal successors, (4268), 3243 states have internal predecessors, (4268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4268 transitions. [2022-07-14 06:14:49,951 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4268 transitions. Word has length 88 [2022-07-14 06:14:49,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:49,951 INFO L495 AbstractCegarLoop]: Abstraction has 3244 states and 4268 transitions. [2022-07-14 06:14:49,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4268 transitions. [2022-07-14 06:14:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-14 06:14:49,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:49,953 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 9, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:49,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 06:14:49,967 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:49,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:49,969 INFO L85 PathProgramCache]: Analyzing trace with hash -93068261, now seen corresponding path program 1 times [2022-07-14 06:14:49,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:49,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690993649] [2022-07-14 06:14:49,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:49,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 61 proven. 147 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-14 06:14:50,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:50,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690993649] [2022-07-14 06:14:50,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690993649] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:50,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821712443] [2022-07-14 06:14:50,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:50,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:50,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:50,149 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:50,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-14 06:14:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:50,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:14:50,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-07-14 06:14:50,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:14:50,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821712443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:14:50,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:14:50,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2022-07-14 06:14:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505201773] [2022-07-14 06:14:50,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:14:50,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:14:50,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:50,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:14:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:14:50,339 INFO L87 Difference]: Start difference. First operand 3244 states and 4268 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:50,382 INFO L93 Difference]: Finished difference Result 3609 states and 4617 transitions. [2022-07-14 06:14:50,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:14:50,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-07-14 06:14:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:50,389 INFO L225 Difference]: With dead ends: 3609 [2022-07-14 06:14:50,389 INFO L226 Difference]: Without dead ends: 3609 [2022-07-14 06:14:50,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:14:50,390 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 54 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:50,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:14:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2022-07-14 06:14:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 3280. [2022-07-14 06:14:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3280 states, 3269 states have (on average 1.2970327317222392) internal successors, (4240), 3279 states have internal predecessors, (4240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 4240 transitions. [2022-07-14 06:14:50,477 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 4240 transitions. Word has length 96 [2022-07-14 06:14:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:50,478 INFO L495 AbstractCegarLoop]: Abstraction has 3280 states and 4240 transitions. [2022-07-14 06:14:50,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 4240 transitions. [2022-07-14 06:14:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-14 06:14:50,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:50,485 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 9, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:50,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:50,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:50,686 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:50,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1826247984, now seen corresponding path program 1 times [2022-07-14 06:14:50,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:50,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609541791] [2022-07-14 06:14:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:50,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 79 proven. 3 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-07-14 06:14:50,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:50,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609541791] [2022-07-14 06:14:50,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609541791] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:50,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380469233] [2022-07-14 06:14:50,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:50,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:50,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:50,806 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:50,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-14 06:14:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:50,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 06:14:50,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 73 proven. 65 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-07-14 06:14:51,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 73 proven. 65 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-07-14 06:14:51,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380469233] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:51,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:51,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-07-14 06:14:51,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852423850] [2022-07-14 06:14:51,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:51,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:14:51,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:51,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:14:51,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:14:51,196 INFO L87 Difference]: Start difference. First operand 3280 states and 4240 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:51,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:51,453 INFO L93 Difference]: Finished difference Result 3904 states and 4668 transitions. [2022-07-14 06:14:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:14:51,454 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 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) Word has length 98 [2022-07-14 06:14:51,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:51,460 INFO L225 Difference]: With dead ends: 3904 [2022-07-14 06:14:51,461 INFO L226 Difference]: Without dead ends: 3904 [2022-07-14 06:14:51,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2022-07-14 06:14:51,462 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 733 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:51,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 2344 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2022-07-14 06:14:51,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 2228. [2022-07-14 06:14:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2218 states have (on average 1.21190261496844) internal successors, (2688), 2227 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2688 transitions. [2022-07-14 06:14:51,494 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2688 transitions. Word has length 98 [2022-07-14 06:14:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:51,495 INFO L495 AbstractCegarLoop]: Abstraction has 2228 states and 2688 transitions. [2022-07-14 06:14:51,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2688 transitions. [2022-07-14 06:14:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-14 06:14:51,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:51,517 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:51,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:51,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-14 06:14:51,735 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:51,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash -932844676, now seen corresponding path program 1 times [2022-07-14 06:14:51,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:51,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887792369] [2022-07-14 06:14:51,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:51,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:14:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:51,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887792369] [2022-07-14 06:14:51,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887792369] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:51,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607320179] [2022-07-14 06:14:51,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:51,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:51,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:51,888 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:51,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-14 06:14:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:52,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:14:52,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:52,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:14:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:14:52,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:14:52,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607320179] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:52,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:52,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-14 06:14:52,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489950462] [2022-07-14 06:14:52,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:52,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:14:52,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:52,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:14:52,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:14:52,472 INFO L87 Difference]: Start difference. First operand 2228 states and 2688 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:52,729 INFO L93 Difference]: Finished difference Result 3146 states and 3743 transitions. [2022-07-14 06:14:52,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:14:52,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-07-14 06:14:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:52,735 INFO L225 Difference]: With dead ends: 3146 [2022-07-14 06:14:52,735 INFO L226 Difference]: Without dead ends: 3146 [2022-07-14 06:14:52,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:14:52,736 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 322 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:52,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 409 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:14:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2022-07-14 06:14:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 2229. [2022-07-14 06:14:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2220 states have (on average 1.212162162162162) internal successors, (2691), 2228 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 2691 transitions. [2022-07-14 06:14:52,762 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 2691 transitions. Word has length 111 [2022-07-14 06:14:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:52,762 INFO L495 AbstractCegarLoop]: Abstraction has 2229 states and 2691 transitions. [2022-07-14 06:14:52,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2691 transitions. [2022-07-14 06:14:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-14 06:14:52,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:52,764 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:52,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:52,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-14 06:14:52,985 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash -932844675, now seen corresponding path program 1 times [2022-07-14 06:14:52,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:52,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174363051] [2022-07-14 06:14:52,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:52,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:14:53,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:53,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174363051] [2022-07-14 06:14:53,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174363051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:53,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651913253] [2022-07-14 06:14:53,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:53,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:53,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:53,110 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:53,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-14 06:14:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:53,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:14:53,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:14:53,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:14:54,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651913253] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:54,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:54,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 16 [2022-07-14 06:14:54,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015052625] [2022-07-14 06:14:54,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:54,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 06:14:54,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:54,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 06:14:54,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:14:54,338 INFO L87 Difference]: Start difference. First operand 2229 states and 2691 transitions. Second operand has 17 states, 16 states have (on average 11.4375) internal successors, (183), 17 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:55,613 INFO L93 Difference]: Finished difference Result 6465 states and 7732 transitions. [2022-07-14 06:14:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 06:14:55,614 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 11.4375) internal successors, (183), 17 states have internal predecessors, (183), 0 states have call successors, (0), 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 111 [2022-07-14 06:14:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:55,625 INFO L225 Difference]: With dead ends: 6465 [2022-07-14 06:14:55,626 INFO L226 Difference]: Without dead ends: 6465 [2022-07-14 06:14:55,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=374, Invalid=958, Unknown=0, NotChecked=0, Total=1332 [2022-07-14 06:14:55,627 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 1121 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:55,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 1168 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 06:14:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6465 states. [2022-07-14 06:14:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6465 to 2385. [2022-07-14 06:14:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2376 states have (on average 1.2175925925925926) internal successors, (2893), 2384 states have internal predecessors, (2893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 2893 transitions. [2022-07-14 06:14:55,693 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 2893 transitions. Word has length 111 [2022-07-14 06:14:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:55,693 INFO L495 AbstractCegarLoop]: Abstraction has 2385 states and 2893 transitions. [2022-07-14 06:14:55,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 11.4375) internal successors, (183), 17 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 2893 transitions. [2022-07-14 06:14:55,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-14 06:14:55,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:55,707 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-14 06:14:55,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:55,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-14 06:14:55,932 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:55,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:55,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1146584722, now seen corresponding path program 1 times [2022-07-14 06:14:55,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:55,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195466872] [2022-07-14 06:14:55,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:55,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 28 proven. 213 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-14 06:14:56,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:56,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195466872] [2022-07-14 06:14:56,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195466872] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:56,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278788640] [2022-07-14 06:14:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:56,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:56,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:56,287 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:56,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-14 06:14:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:56,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:14:56,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:14:56,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:14:56,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278788640] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:56,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:56,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2022-07-14 06:14:56,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137533038] [2022-07-14 06:14:56,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:56,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:14:56,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:56,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:14:56,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:14:56,920 INFO L87 Difference]: Start difference. First operand 2385 states and 2893 transitions. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:57,798 INFO L93 Difference]: Finished difference Result 5270 states and 6298 transitions. [2022-07-14 06:14:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-14 06:14:57,799 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 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 112 [2022-07-14 06:14:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:57,806 INFO L225 Difference]: With dead ends: 5270 [2022-07-14 06:14:57,806 INFO L226 Difference]: Without dead ends: 5270 [2022-07-14 06:14:57,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=512, Invalid=1468, Unknown=0, NotChecked=0, Total=1980 [2022-07-14 06:14:57,808 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 602 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:57,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1267 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:14:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5270 states. [2022-07-14 06:14:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5270 to 2385. [2022-07-14 06:14:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2376 states have (on average 1.2146464646464648) internal successors, (2886), 2384 states have internal predecessors, (2886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 2886 transitions. [2022-07-14 06:14:57,874 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 2886 transitions. Word has length 112 [2022-07-14 06:14:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:57,874 INFO L495 AbstractCegarLoop]: Abstraction has 2385 states and 2886 transitions. [2022-07-14 06:14:57,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 2886 transitions. [2022-07-14 06:14:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 06:14:57,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:57,876 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:57,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-14 06:14:58,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-14 06:14:58,091 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:58,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:58,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1937224330, now seen corresponding path program 1 times [2022-07-14 06:14:58,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:58,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809918655] [2022-07-14 06:14:58,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:58,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:14:58,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:58,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809918655] [2022-07-14 06:14:58,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809918655] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:58,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446346301] [2022-07-14 06:14:58,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:58,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:58,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:58,237 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:58,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-14 06:14:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:58,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:14:58,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:14:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:14:58,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:14:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:14:59,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446346301] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:14:59,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:14:59,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-14 06:14:59,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575162430] [2022-07-14 06:14:59,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:14:59,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:14:59,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:14:59,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:14:59,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:14:59,129 INFO L87 Difference]: Start difference. First operand 2385 states and 2886 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:14:59,324 INFO L93 Difference]: Finished difference Result 4569 states and 5488 transitions. [2022-07-14 06:14:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:14:59,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-07-14 06:14:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:14:59,332 INFO L225 Difference]: With dead ends: 4569 [2022-07-14 06:14:59,332 INFO L226 Difference]: Without dead ends: 4569 [2022-07-14 06:14:59,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:14:59,333 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 510 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:14:59,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 266 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:14:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2022-07-14 06:14:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 2386. [2022-07-14 06:14:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2377 states have (on average 1.2145561632309634) internal successors, (2887), 2385 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 2887 transitions. [2022-07-14 06:14:59,388 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 2887 transitions. Word has length 114 [2022-07-14 06:14:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:14:59,388 INFO L495 AbstractCegarLoop]: Abstraction has 2386 states and 2887 transitions. [2022-07-14 06:14:59,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:14:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2887 transitions. [2022-07-14 06:14:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-14 06:14:59,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:14:59,398 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:14:59,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-14 06:14:59,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:59,611 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:14:59,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:14:59,612 INFO L85 PathProgramCache]: Analyzing trace with hash -374280255, now seen corresponding path program 1 times [2022-07-14 06:14:59,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:14:59,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925045364] [2022-07-14 06:14:59,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:59,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:14:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:14:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 46 proven. 192 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:14:59,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:14:59,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925045364] [2022-07-14 06:14:59,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925045364] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:14:59,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584329984] [2022-07-14 06:14:59,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:14:59,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:14:59,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:14:59,936 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:14:59,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-14 06:15:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:00,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-14 06:15:00,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:00,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:00,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:00,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:00,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2022-07-14 06:15:00,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:00,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-14 06:15:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 46 proven. 192 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:15:00,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:00,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-07-14 06:15:00,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-14 06:15:00,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-07-14 06:15:00,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:15:00,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-07-14 06:15:00,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:15:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 46 proven. 192 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:15:01,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584329984] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:01,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:01,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2022-07-14 06:15:01,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356523800] [2022-07-14 06:15:01,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:01,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 06:15:01,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:01,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 06:15:01,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:15:01,938 INFO L87 Difference]: Start difference. First operand 2386 states and 2887 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:02,356 INFO L93 Difference]: Finished difference Result 4635 states and 5548 transitions. [2022-07-14 06:15:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:15:02,357 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 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 117 [2022-07-14 06:15:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:02,363 INFO L225 Difference]: With dead ends: 4635 [2022-07-14 06:15:02,363 INFO L226 Difference]: Without dead ends: 4635 [2022-07-14 06:15:02,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 222 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2022-07-14 06:15:02,365 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 255 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:02,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 834 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:15:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2022-07-14 06:15:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 2950. [2022-07-14 06:15:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2941 states have (on average 1.2142128527711662) internal successors, (3571), 2949 states have internal predecessors, (3571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 3571 transitions. [2022-07-14 06:15:02,400 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 3571 transitions. Word has length 117 [2022-07-14 06:15:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:02,400 INFO L495 AbstractCegarLoop]: Abstraction has 2950 states and 3571 transitions. [2022-07-14 06:15:02,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3571 transitions. [2022-07-14 06:15:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-14 06:15:02,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:02,406 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 8, 7, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:02,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:02,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:02,622 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:02,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:02,622 INFO L85 PathProgramCache]: Analyzing trace with hash 779532359, now seen corresponding path program 1 times [2022-07-14 06:15:02,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:02,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290972879] [2022-07-14 06:15:02,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 84 proven. 313 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:15:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:02,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290972879] [2022-07-14 06:15:02,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290972879] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:02,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764520102] [2022-07-14 06:15:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:02,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:02,990 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:02,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-14 06:15:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:03,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-14 06:15:03,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:03,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:15:03,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:15:03,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:03,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-14 06:15:03,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:03,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-14 06:15:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 80 proven. 317 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:15:03,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:04,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-14 06:15:04,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-14 06:15:04,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-14 06:15:04,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:15:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 76 proven. 321 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:15:05,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764520102] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:05,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:05,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-07-14 06:15:05,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118069036] [2022-07-14 06:15:05,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:05,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 06:15:05,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:05,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 06:15:05,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-07-14 06:15:05,220 INFO L87 Difference]: Start difference. First operand 2950 states and 3571 transitions. Second operand has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:08,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:08,700 INFO L93 Difference]: Finished difference Result 15206 states and 17825 transitions. [2022-07-14 06:15:08,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-07-14 06:15:08,700 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-07-14 06:15:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:08,735 INFO L225 Difference]: With dead ends: 15206 [2022-07-14 06:15:08,735 INFO L226 Difference]: Without dead ends: 15206 [2022-07-14 06:15:08,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1155, Invalid=6155, Unknown=0, NotChecked=0, Total=7310 [2022-07-14 06:15:08,754 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 2151 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2151 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:08,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2151 Valid, 2679 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 1046 Invalid, 0 Unknown, 132 Unchecked, 1.0s Time] [2022-07-14 06:15:08,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15206 states. [2022-07-14 06:15:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15206 to 8278. [2022-07-14 06:15:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8278 states, 8269 states have (on average 1.207159269561011) internal successors, (9982), 8277 states have internal predecessors, (9982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8278 states to 8278 states and 9982 transitions. [2022-07-14 06:15:08,902 INFO L78 Accepts]: Start accepts. Automaton has 8278 states and 9982 transitions. Word has length 117 [2022-07-14 06:15:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:08,902 INFO L495 AbstractCegarLoop]: Abstraction has 8278 states and 9982 transitions. [2022-07-14 06:15:08,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 8278 states and 9982 transitions. [2022-07-14 06:15:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-14 06:15:08,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:08,907 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:08,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:09,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:09,149 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:09,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:09,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1282212589, now seen corresponding path program 1 times [2022-07-14 06:15:09,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:09,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069641807] [2022-07-14 06:15:09,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:09,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:09,366 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:15:09,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:09,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069641807] [2022-07-14 06:15:09,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069641807] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:09,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601105331] [2022-07-14 06:15:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:09,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:09,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:09,369 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:09,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-14 06:15:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:09,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 06:15:09,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:09,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:15:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:15:09,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-14 06:15:10,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601105331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:10,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:10,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 8 [2022-07-14 06:15:10,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688159144] [2022-07-14 06:15:10,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:10,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:15:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:15:10,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:15:10,056 INFO L87 Difference]: Start difference. First operand 8278 states and 9982 transitions. Second operand has 9 states, 8 states have (on average 10.25) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:10,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:10,436 INFO L93 Difference]: Finished difference Result 18955 states and 22785 transitions. [2022-07-14 06:15:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:15:10,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.25) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-14 06:15:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:10,483 INFO L225 Difference]: With dead ends: 18955 [2022-07-14 06:15:10,484 INFO L226 Difference]: Without dead ends: 18937 [2022-07-14 06:15:10,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:15:10,487 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 393 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:10,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 899 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 237 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2022-07-14 06:15:10,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18937 states. [2022-07-14 06:15:10,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18937 to 14041. [2022-07-14 06:15:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14041 states, 14032 states have (on average 1.206171607753706) internal successors, (16925), 14040 states have internal predecessors, (16925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14041 states to 14041 states and 16925 transitions. [2022-07-14 06:15:10,875 INFO L78 Accepts]: Start accepts. Automaton has 14041 states and 16925 transitions. Word has length 118 [2022-07-14 06:15:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:10,876 INFO L495 AbstractCegarLoop]: Abstraction has 14041 states and 16925 transitions. [2022-07-14 06:15:10,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.25) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 14041 states and 16925 transitions. [2022-07-14 06:15:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-14 06:15:10,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:10,888 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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] [2022-07-14 06:15:10,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:11,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:11,089 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:11,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:11,090 INFO L85 PathProgramCache]: Analyzing trace with hash -224880734, now seen corresponding path program 1 times [2022-07-14 06:15:11,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:11,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423706199] [2022-07-14 06:15:11,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:11,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 335 proven. 4 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-07-14 06:15:11,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:11,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423706199] [2022-07-14 06:15:11,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423706199] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:11,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804753714] [2022-07-14 06:15:11,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:11,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:11,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:11,214 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:11,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-14 06:15:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:11,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:15:11,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 335 proven. 4 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-07-14 06:15:11,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-07-14 06:15:11,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804753714] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:11,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:11,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 9 [2022-07-14 06:15:11,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708803460] [2022-07-14 06:15:11,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:11,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:15:11,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:11,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:15:11,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:15:11,570 INFO L87 Difference]: Start difference. First operand 14041 states and 16925 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:11,922 INFO L93 Difference]: Finished difference Result 10162 states and 12168 transitions. [2022-07-14 06:15:11,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:15:11,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2022-07-14 06:15:11,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:11,963 INFO L225 Difference]: With dead ends: 10162 [2022-07-14 06:15:11,964 INFO L226 Difference]: Without dead ends: 10162 [2022-07-14 06:15:11,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:15:11,966 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 179 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:11,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 314 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10162 states. [2022-07-14 06:15:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10162 to 8827. [2022-07-14 06:15:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8827 states, 8818 states have (on average 1.1958493989566794) internal successors, (10545), 8826 states have internal predecessors, (10545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8827 states to 8827 states and 10545 transitions. [2022-07-14 06:15:12,165 INFO L78 Accepts]: Start accepts. Automaton has 8827 states and 10545 transitions. Word has length 146 [2022-07-14 06:15:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:12,165 INFO L495 AbstractCegarLoop]: Abstraction has 8827 states and 10545 transitions. [2022-07-14 06:15:12,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 8827 states and 10545 transitions. [2022-07-14 06:15:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-14 06:15:12,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:12,173 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 14, 9, 9, 7, 6, 6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:12,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:12,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:12,395 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:12,396 INFO L85 PathProgramCache]: Analyzing trace with hash 368256012, now seen corresponding path program 2 times [2022-07-14 06:15:12,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:12,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257385451] [2022-07-14 06:15:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:12,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 336 proven. 3 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2022-07-14 06:15:12,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:12,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257385451] [2022-07-14 06:15:12,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257385451] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:12,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325152319] [2022-07-14 06:15:12,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:15:12,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:12,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:12,520 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:12,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-14 06:15:12,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:15:12,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:15:12,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:15:12,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 291 proven. 109 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-07-14 06:15:13,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 291 proven. 109 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-07-14 06:15:13,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325152319] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:13,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:13,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-14 06:15:13,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57993034] [2022-07-14 06:15:13,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:13,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:15:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:13,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:15:13,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:15:13,304 INFO L87 Difference]: Start difference. First operand 8827 states and 10545 transitions. Second operand has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:13,549 INFO L93 Difference]: Finished difference Result 10609 states and 12209 transitions. [2022-07-14 06:15:13,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:15:13,550 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 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) Word has length 155 [2022-07-14 06:15:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:13,580 INFO L225 Difference]: With dead ends: 10609 [2022-07-14 06:15:13,583 INFO L226 Difference]: Without dead ends: 10609 [2022-07-14 06:15:13,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 311 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:15:13,585 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 848 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:13,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1784 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10609 states. [2022-07-14 06:15:13,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10609 to 7447. [2022-07-14 06:15:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7447 states, 7438 states have (on average 1.1560903468674375) internal successors, (8599), 7446 states have internal predecessors, (8599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7447 states to 7447 states and 8599 transitions. [2022-07-14 06:15:13,711 INFO L78 Accepts]: Start accepts. Automaton has 7447 states and 8599 transitions. Word has length 155 [2022-07-14 06:15:13,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:13,711 INFO L495 AbstractCegarLoop]: Abstraction has 7447 states and 8599 transitions. [2022-07-14 06:15:13,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 7447 states and 8599 transitions. [2022-07-14 06:15:13,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 06:15:13,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:13,717 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:13,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:13,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-14 06:15:13,934 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:13,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1761139834, now seen corresponding path program 1 times [2022-07-14 06:15:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:13,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096090140] [2022-07-14 06:15:13,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 104 proven. 679 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-14 06:15:14,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:14,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096090140] [2022-07-14 06:15:14,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096090140] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:14,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650290292] [2022-07-14 06:15:14,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:14,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:14,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:14,443 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:14,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-14 06:15:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:14,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-14 06:15:14,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:14,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:15:14,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:15:14,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:15:15,142 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:15:15,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:15:15,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:15,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:15,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:15,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:15,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:15,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:15,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:15,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:15,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:15:15,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:15:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 100 proven. 673 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-14 06:15:16,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:16,401 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1343) c_~S~0.base) (+ c_~S~0.offset 4)) 0)) (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1342) c_~S~0.base) (+ c_~S~0.offset 4)) 0))) is different from false [2022-07-14 06:15:17,215 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_30 Int)) (or (and (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_30 v_ArrVal_1343) c_~x1~0.base) (+ 4 c_~x1~0.offset)) 0)) (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_30 v_ArrVal_1342) c_~x1~0.base) (+ 4 c_~x1~0.offset)) 0))) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))) is different from false [2022-07-14 06:15:17,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:17,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:17,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:17,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:17,786 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:17,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:17,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:17,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:17,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_30 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (or (and (forall ((v_ArrVal_1342 (Array Int Int))) (= (let ((.cse0 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.offset| c_~x1~0.base (store (select |#memory_$Pointer$.offset| c_~x1~0.base) .cse0 c_~t1~0.offset)) v_~x1~0.base_30 v_ArrVal_1342) c_~x1~0.base) .cse0)) 0)) (forall ((v_ArrVal_1343 (Array Int Int))) (= (let ((.cse1 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.base| c_~x1~0.base (store (select |#memory_$Pointer$.base| c_~x1~0.base) .cse1 c_~t1~0.base)) v_~x1~0.base_30 v_ArrVal_1343) c_~x1~0.base) .cse1)) 0))) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))) is different from false [2022-07-14 06:15:17,832 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:17,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:17,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:17,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:17,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:17,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:17,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:17,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:17,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:17,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:17,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:17,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:17,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:17,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:17,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:17,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:17,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:17,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:17,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:17,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:17,979 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:17,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:17,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:17,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:17,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:18,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:18,013 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:18,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:18,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:18,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:18,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:18,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:18,098 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:18,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:18,113 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:18,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:18,135 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:18,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:18,150 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:18,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:18,175 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:18,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:18,204 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:18,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:18,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:18,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:18,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:18,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:18,266 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:18,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:18,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:18,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:18,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:18,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:18,348 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:18,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:18,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:18,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:18,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:15:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 90 proven. 305 refuted. 0 times theorem prover too weak. 56 trivial. 378 not checked. [2022-07-14 06:15:18,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650290292] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:18,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:18,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 23 [2022-07-14 06:15:18,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912556053] [2022-07-14 06:15:18,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:18,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 06:15:18,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:18,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 06:15:18,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=370, Unknown=3, NotChecked=120, Total=552 [2022-07-14 06:15:18,971 INFO L87 Difference]: Start difference. First operand 7447 states and 8599 transitions. Second operand has 24 states, 24 states have (on average 9.625) internal successors, (231), 23 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:19,105 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_~x1~0.offset))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= (select (select |c_#memory_$Pointer$.base| c_~x1~0.base) .cse0) 0) (= c_~t1~0.offset 0) (= c_~t4~0.base 0) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (= (select (select |c_#memory_$Pointer$.offset| c_~x1~0.base) .cse0) 0) (= c_~S~0.base 0) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.base_30 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (or (and (forall ((v_ArrVal_1342 (Array Int Int))) (= (let ((.cse1 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.offset| c_~x1~0.base (store (select |#memory_$Pointer$.offset| c_~x1~0.base) .cse1 c_~t1~0.offset)) v_~x1~0.base_30 v_ArrVal_1342) c_~x1~0.base) .cse1)) 0)) (forall ((v_ArrVal_1343 (Array Int Int))) (= (let ((.cse2 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.base| c_~x1~0.base (store (select |#memory_$Pointer$.base| c_~x1~0.base) .cse2 c_~t1~0.base)) v_~x1~0.base_30 v_ArrVal_1343) c_~x1~0.base) .cse2)) 0))) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:15:20,245 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_~x1~0.offset))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= (select (select |c_#memory_$Pointer$.base| c_~x1~0.base) .cse0) 0) (= c_~t1~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_~x1~0.base) .cse0) 0) (= c_~S~0.base 0) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.base_30 Int)) (or (and (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_30 v_ArrVal_1343) c_~x1~0.base) (+ 4 c_~x1~0.offset)) 0)) (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_30 v_ArrVal_1342) c_~x1~0.base) (+ 4 c_~x1~0.offset)) 0))) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:15:23,255 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_~x1~0.offset)) (.cse1 (+ c_~t4~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= (select (select |c_#memory_$Pointer$.base| c_~x1~0.base) .cse0) 0) (= c_~t1~0.offset 0) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) 0) (= (select (select |c_#memory_$Pointer$.offset| c_~x1~0.base) .cse0) 0) (= c_~S~0.base 0) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) 0) (forall ((v_~x1~0.base_30 Int)) (or (and (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_30 v_ArrVal_1343) c_~x1~0.base) (+ 4 c_~x1~0.offset)) 0)) (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_30 v_ArrVal_1342) c_~x1~0.base) (+ 4 c_~x1~0.offset)) 0))) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:15:25,721 WARN L833 $PredicateComparison]: unable to prove that (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (= c_~x4~0.offset 0) (= c_~x4~0.base 0) (= c_~S~0.base 0) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.base_30 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (or (and (forall ((v_ArrVal_1342 (Array Int Int))) (= (let ((.cse0 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.offset| c_~x1~0.base (store (select |#memory_$Pointer$.offset| c_~x1~0.base) .cse0 c_~t1~0.offset)) v_~x1~0.base_30 v_ArrVal_1342) c_~x1~0.base) .cse0)) 0)) (forall ((v_ArrVal_1343 (Array Int Int))) (= (let ((.cse1 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.base| c_~x1~0.base (store (select |#memory_$Pointer$.base| c_~x1~0.base) .cse1 c_~t1~0.base)) v_~x1~0.base_30 v_ArrVal_1343) c_~x1~0.base) .cse1)) 0))) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))) (= c_~S~0.offset 0)) is different from false [2022-07-14 06:15:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:28,424 INFO L93 Difference]: Finished difference Result 43895 states and 49913 transitions. [2022-07-14 06:15:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-07-14 06:15:28,435 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.625) internal successors, (231), 23 states have internal predecessors, (231), 0 states have call successors, (0), 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 162 [2022-07-14 06:15:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:28,507 INFO L225 Difference]: With dead ends: 43895 [2022-07-14 06:15:28,507 INFO L226 Difference]: Without dead ends: 43895 [2022-07-14 06:15:28,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 345 SyntacticMatches, 14 SemanticMatches, 135 ConstructedPredicates, 7 IntricatePredicates, 7 DeprecatedPredicates, 6621 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1893, Invalid=14883, Unknown=22, NotChecked=1834, Total=18632 [2022-07-14 06:15:28,514 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 1867 mSDsluCounter, 5756 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1867 SdHoareTripleChecker+Valid, 6308 SdHoareTripleChecker+Invalid, 5037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2576 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:28,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1867 Valid, 6308 Invalid, 5037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 2265 Invalid, 0 Unknown, 2576 Unchecked, 1.8s Time] [2022-07-14 06:15:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43895 states. [2022-07-14 06:15:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43895 to 23822. [2022-07-14 06:15:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23822 states, 23813 states have (on average 1.1501280813001302) internal successors, (27388), 23821 states have internal predecessors, (27388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23822 states to 23822 states and 27388 transitions. [2022-07-14 06:15:29,004 INFO L78 Accepts]: Start accepts. Automaton has 23822 states and 27388 transitions. Word has length 162 [2022-07-14 06:15:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:29,005 INFO L495 AbstractCegarLoop]: Abstraction has 23822 states and 27388 transitions. [2022-07-14 06:15:29,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.625) internal successors, (231), 23 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 23822 states and 27388 transitions. [2022-07-14 06:15:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 06:15:29,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:29,027 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:29,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:29,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-14 06:15:29,248 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:29,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1850586310, now seen corresponding path program 2 times [2022-07-14 06:15:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:29,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714051244] [2022-07-14 06:15:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:29,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 104 proven. 685 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-14 06:15:29,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:29,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714051244] [2022-07-14 06:15:29,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714051244] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:29,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272922135] [2022-07-14 06:15:29,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:15:29,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:29,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:29,893 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:29,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-14 06:15:30,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:15:30,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:15:30,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-14 06:15:30,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:30,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:15:30,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:15:30,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:15:30,582 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:15:30,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:15:30,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:30,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:30,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:30,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:30,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:30,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:15:30,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:15:30,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:15:30,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:15:30,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:15:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 100 proven. 679 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-14 06:15:31,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:31,462 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1471) c_~t4~0.base) (+ c_~t4~0.offset 4)) 0)) (forall ((v_ArrVal_1472 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1472) c_~t4~0.base) (+ c_~t4~0.offset 4)) 0))) is different from false [2022-07-14 06:15:31,503 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1471) c_~S~0.base) (+ c_~S~0.offset 4)) 0)) (forall ((v_ArrVal_1472 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1472) c_~S~0.base) (+ c_~S~0.offset 4))))) is different from false [2022-07-14 06:15:31,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_32 Int)) (or (and (forall ((v_ArrVal_1472 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_32 v_ArrVal_1472) c_~S~0.base) (+ c_~S~0.offset 4)) 0)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_32 v_ArrVal_1471) c_~S~0.base) (+ c_~S~0.offset 4)) 0))) (not (= (select |c_#valid| v_~x1~0.base_32) 0)))) is different from false [2022-07-14 06:15:32,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_32 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_32) 0)) (and (forall ((v_ArrVal_1472 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_32 v_ArrVal_1472) c_~x1~0.base) (+ 4 c_~x1~0.offset)) 0)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_32 v_ArrVal_1471) c_~x1~0.base) (+ 4 c_~x1~0.offset)) 0))))) is different from false [2022-07-14 06:15:32,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,270 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:32,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:32,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,336 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:32,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:32,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,380 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:32,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:32,416 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,432 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:32,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:32,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:32,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:32,508 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:32,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:32,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:32,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:32,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,608 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:32,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:32,630 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,644 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:32,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:32,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,682 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:32,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:32,703 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,745 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:15:32,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:15:32,779 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:32,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:15:32,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:32,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:15:33,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:15:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 90 proven. 209 refuted. 0 times theorem prover too weak. 50 trivial. 480 not checked. [2022-07-14 06:15:33,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272922135] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:33,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:33,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 23 [2022-07-14 06:15:33,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109464788] [2022-07-14 06:15:33,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:33,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 06:15:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:33,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 06:15:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=336, Unknown=4, NotChecked=156, Total=552 [2022-07-14 06:15:33,302 INFO L87 Difference]: Start difference. First operand 23822 states and 27388 transitions. Second operand has 24 states, 24 states have (on average 9.958333333333334) internal successors, (239), 23 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:38,988 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_~x1~0.offset)) (.cse1 (+ c_~t4~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= (select (select |c_#memory_$Pointer$.base| c_~x1~0.base) .cse0) 0) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) 0) (= (select (select |c_#memory_$Pointer$.offset| c_~x1~0.base) .cse0) 0) (= c_~S~0.base 0) (= c_~x1~0.offset 0) (forall ((v_~x1~0.base_32 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_32) 0)) (and (forall ((v_ArrVal_1472 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_32 v_ArrVal_1472) c_~x1~0.base) (+ 4 c_~x1~0.offset)) 0)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_32 v_ArrVal_1471) c_~x1~0.base) (+ 4 c_~x1~0.offset)) 0))))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) 0) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:15:39,045 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_~x1~0.offset)) (.cse1 (+ c_~t4~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= (select (select |c_#memory_$Pointer$.base| c_~x1~0.base) .cse0) 0) (= c_~t4~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) 0) (= (select (select |c_#memory_$Pointer$.offset| c_~x1~0.base) .cse0) 0) (= c_~S~0.base 0) (= c_~x1~0.offset 0) (forall ((v_~x1~0.base_32 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_32) 0)) (and (forall ((v_ArrVal_1472 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_32 v_ArrVal_1472) c_~x1~0.base) (+ 4 c_~x1~0.offset)) 0)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_32 v_ArrVal_1471) c_~x1~0.base) (+ 4 c_~x1~0.offset)) 0))))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) 0) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:15:48,001 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_~x1~0.offset))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= (select (select |c_#memory_$Pointer$.base| c_~x1~0.base) .cse0) 0) (= c_~t4~0.base 0) (forall ((v_~x1~0.base_32 Int)) (or (and (forall ((v_ArrVal_1472 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_32 v_ArrVal_1472) c_~S~0.base) (+ c_~S~0.offset 4)) 0)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_32 v_ArrVal_1471) c_~S~0.base) (+ c_~S~0.offset 4)) 0))) (not (= (select |c_#valid| v_~x1~0.base_32) 0)))) (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) (= c_~t4~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_~x1~0.base) .cse0) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) (= c_~x1~0.offset 0) (= (select |c_#valid| c_~S~0.base) 1) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:15:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:48,362 INFO L93 Difference]: Finished difference Result 74935 states and 85092 transitions. [2022-07-14 06:15:48,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-14 06:15:48,363 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.958333333333334) internal successors, (239), 23 states have internal predecessors, (239), 0 states have call successors, (0), 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 162 [2022-07-14 06:15:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:48,472 INFO L225 Difference]: With dead ends: 74935 [2022-07-14 06:15:48,472 INFO L226 Difference]: Without dead ends: 74935 [2022-07-14 06:15:48,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 322 SyntacticMatches, 8 SemanticMatches, 83 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2056 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=763, Invalid=5247, Unknown=24, NotChecked=1106, Total=7140 [2022-07-14 06:15:48,474 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 1857 mSDsluCounter, 3644 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 4055 SdHoareTripleChecker+Invalid, 5283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3640 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:48,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1857 Valid, 4055 Invalid, 5283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1391 Invalid, 0 Unknown, 3640 Unchecked, 1.0s Time] [2022-07-14 06:15:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74935 states. [2022-07-14 06:15:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74935 to 41703. [2022-07-14 06:15:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41703 states, 41694 states have (on average 1.1454885595049646) internal successors, (47760), 41702 states have internal predecessors, (47760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41703 states to 41703 states and 47760 transitions. [2022-07-14 06:15:49,281 INFO L78 Accepts]: Start accepts. Automaton has 41703 states and 47760 transitions. Word has length 162 [2022-07-14 06:15:49,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:49,282 INFO L495 AbstractCegarLoop]: Abstraction has 41703 states and 47760 transitions. [2022-07-14 06:15:49,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.958333333333334) internal successors, (239), 23 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 41703 states and 47760 transitions. [2022-07-14 06:15:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 06:15:49,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:49,298 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:49,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:49,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-14 06:15:49,518 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:49,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1229648570, now seen corresponding path program 3 times [2022-07-14 06:15:49,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:49,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282686210] [2022-07-14 06:15:49,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:49,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 104 proven. 681 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-14 06:15:49,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:49,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282686210] [2022-07-14 06:15:49,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282686210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:49,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770592302] [2022-07-14 06:15:49,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:15:49,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:49,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:49,884 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:49,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-14 06:15:50,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-07-14 06:15:50,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:15:50,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-14 06:15:50,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:50,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:15:50,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:15:50,821 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:15:50,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:15:50,838 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:15:50,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:15:50,890 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:15:50,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-14 06:15:50,925 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:15:50,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-14 06:15:51,048 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:15:51,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-14 06:15:51,071 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:15:51,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-14 06:15:51,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:51,424 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 06:15:51,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2022-07-14 06:15:51,439 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:15:51,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-14 06:15:53,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:15:53,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:53,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 52 [2022-07-14 06:15:53,597 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:53,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-14 06:15:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 66 proven. 714 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-14 06:15:54,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:54,404 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:15:54,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-07-14 06:15:55,174 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1599 (Array Int Int)) (~t4~0.offset Int)) (let ((.cse1 (+ ~t4~0.offset 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base (store (select |c_#memory_$Pointer$.base| c_~x1~0.base) (+ 4 c_~x1~0.offset) c_~t1~0.base)) c_~S~0.base) .cse1))) (or (= c_~S~0.base .cse0) (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1599) c_~S~0.base) .cse1) 0) (= .cse0 0)))))) is different from false [2022-07-14 06:15:55,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:15:55,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2022-07-14 06:15:55,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (= .cse0 c_~S~0.base) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse0 0))))) is different from false [2022-07-14 06:15:57,026 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse0 0)) (= c_~S~0.base .cse0) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) is different from false [2022-07-14 06:16:06,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:06,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 86 [2022-07-14 06:16:06,345 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:06,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 115 [2022-07-14 06:16:06,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:06,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 83 [2022-07-14 06:16:06,378 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:06,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:16:06,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:06,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:16:06,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:16:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 7 proven. 385 refuted. 0 times theorem prover too weak. 42 trivial. 395 not checked. [2022-07-14 06:16:06,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770592302] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:16:06,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:16:06,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2022-07-14 06:16:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955477350] [2022-07-14 06:16:06,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:16:06,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-14 06:16:06,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:06,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-14 06:16:06,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1207, Unknown=10, NotChecked=216, Total=1560 [2022-07-14 06:16:06,757 INFO L87 Difference]: Start difference. First operand 41703 states and 47760 transitions. Second operand has 40 states, 40 states have (on average 9.4) internal successors, (376), 39 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:07,484 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (.cse2 (= c_~x4~0.offset 0)) (.cse3 (= c_~x4~0.base 0)) (.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse4 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (= c_~t4~0.base 0) (or .cse0 .cse1) (or (and .cse2 .cse3) (= c_~S~0.base c_~x4~0.base) (not (= c_~S~0.base c_~t4~0.base)) (< 0 c_~t4~0.offset) (< c_~t4~0.offset 0)) .cse1 .cse2 (= c_~t4~0.offset 0) (<= c_~x1~0.offset 0) .cse3 (<= 0 c_~x1~0.offset) .cse4 (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse5 0)) (= c_~S~0.base .cse5) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) (= (select |c_#valid| c_~S~0.base) 1) (or .cse0 .cse4) (<= c_~S~0.offset 0) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:16:07,488 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse2 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (or .cse0 .cse1) .cse1 (<= c_~x1~0.offset 0) (<= 0 c_~x1~0.offset) .cse2 (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse3 0)) (= c_~S~0.base .cse3) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) (= (select |c_#valid| c_~S~0.base) 1) (or .cse0 .cse2) (<= c_~S~0.offset 0) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:16:07,498 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse0 0)) (= c_~S~0.base .cse0) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) (= (select |c_#valid| c_~S~0.base) 1) (= c_~S~0.offset 0)) is different from false [2022-07-14 06:16:07,501 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~t4~0.offset 4))) (and (= (select |c_#valid| c_~t4~0.base) 1) (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) (= c_~t4~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse0) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse1 0)) (= c_~S~0.base .cse1) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse0) 0) (<= c_~S~0.offset 0))) is different from false [2022-07-14 06:16:07,506 WARN L833 $PredicateComparison]: unable to prove that (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse0 0)) (= c_~S~0.base .cse0) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) (= (select |c_#valid| c_~S~0.base) 1) (= c_~S~0.offset 0)) is different from false [2022-07-14 06:16:07,509 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse0 0)) (= c_~S~0.base .cse0) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) (<= c_~S~0.offset 0)) is different from false [2022-07-14 06:16:09,006 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse1 (<= 0 c_~x1~0.offset))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (<= c_~x1~0.offset 0) .cse1 (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse2 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse2) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse2) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse3 0)) (= c_~S~0.base .cse3)))) (not .cse1)) (<= c_~S~0.offset 0) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:10,431 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse1 (<= 0 c_~x1~0.offset))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (<= c_~x1~0.offset 0) .cse1 (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse2 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse2) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse2) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (or (and (= c_~S~0.base 0) (= c_~S~0.offset 0)) (= c_~S~0.base c_~t4~0.base) (< c_~t4~0.offset 0)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse3 0)) (= c_~S~0.base .cse3)))) (not .cse1)) (<= c_~S~0.offset 0) (<= c_~t4~0.offset 0) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:10,444 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse2 (+ c_~t4~0.offset 4)) (.cse1 (<= 0 c_~x1~0.offset))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (= c_~t4~0.offset 0) (<= c_~x1~0.offset 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse2) 0) (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse3 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse3) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse3) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse2) 0) (not (= c_~x1~0.base c_~t4~0.base)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse4 0)) (= c_~S~0.base .cse4)))) (not .cse1)) (<= c_~S~0.offset 0) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:13,577 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse1 (<= 0 c_~x1~0.offset))) (and (= c_~t4~0.base 0) (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (= c_~t4~0.offset 0) (<= c_~x1~0.offset 0) .cse1 (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse2 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse2) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse2) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse3 0)) (= c_~S~0.base .cse3)))) (not .cse1)) (<= c_~S~0.offset 0) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:17,407 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse1 (= c_~S~0.base c_~t4~0.base)) (.cse2 (< c_~t4~0.offset 0)) (.cse3 (<= 0 c_~x1~0.offset))) (and (= (select |c_#valid| c_~t4~0.base) 1) (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (or (and (= c_~x4~0.offset 0) (= c_~x4~0.base 0)) (= c_~S~0.base c_~x4~0.base) (not .cse1) (< 0 c_~t4~0.offset) .cse2) (<= c_~x1~0.offset 0) .cse3 (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse4 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse4) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse4) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (or (and (= c_~S~0.base 0) (= c_~S~0.offset 0)) .cse1 .cse2) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse5 0)) (= c_~S~0.base .cse5)))) (not .cse3)) (<= c_~S~0.offset 0) (<= c_~t4~0.offset 0) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:17,412 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse1 (<= 0 c_~x1~0.offset))) (and (= (select |c_#valid| c_~t4~0.base) 1) (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (or (and (= c_~x4~0.offset 0) (= c_~x4~0.base 0)) (= c_~S~0.base c_~x4~0.base) (not (= c_~S~0.base c_~t4~0.base)) (< 0 c_~t4~0.offset) (< c_~t4~0.offset 0)) (<= c_~x1~0.offset 0) .cse1 (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse2 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse2) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse2) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse3 0)) (= c_~S~0.base .cse3)))) (not .cse1)) (<= c_~S~0.offset 0) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:17,459 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~x4~0.offset 0)) (.cse2 (= c_~x4~0.base 0)) (.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse4 (+ c_~t4~0.offset 4)) (.cse3 (<= 0 c_~x1~0.offset))) (and (= (select |c_#valid| c_~t4~0.base) 1) (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (or (and .cse1 .cse2) (= c_~S~0.base c_~x4~0.base) (not (= c_~S~0.base c_~t4~0.base)) (< 0 c_~t4~0.offset) (< c_~t4~0.offset 0)) .cse1 (= c_~t4~0.offset 0) (<= c_~x1~0.offset 0) .cse2 .cse3 (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse4) 0) (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse5 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse5) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse5) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse4) 0) (not (= c_~x1~0.base c_~t4~0.base)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse6 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse6 0)) (= c_~S~0.base .cse6)))) (not .cse3)) (<= c_~S~0.offset 0) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:25,521 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse1 (not (= c_~S~0.base c_~t4~0.base))) (.cse2 (<= 0 c_~x1~0.offset))) (and (= (select |c_#valid| c_~t4~0.base) 1) (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (or (and (= c_~x4~0.offset 0) (= c_~x4~0.base 0)) (= c_~S~0.base c_~x4~0.base) .cse1 (< 0 c_~t4~0.offset) (< c_~t4~0.offset 0)) (<= c_~x1~0.offset 0) .cse2 (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse3 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse3) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse3) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (or (not (<= 0 c_~t4~0.offset)) (= |c_ULTIMATE.start_pop_#t~mem8#1.base| c_~t4~0.base) (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| 0) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| 0)) (not (<= c_~t4~0.offset c_~S~0.offset)) .cse1) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse4 0)) (= c_~S~0.base .cse4)))) (not .cse2)) (<= c_~S~0.offset 0) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:31,347 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (.cse2 (= c_~x4~0.offset 0)) (.cse3 (= c_~x4~0.base 0)) (.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse8 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (.cse7 (+ c_~t4~0.offset 4)) (.cse4 (not (= c_~S~0.base c_~t4~0.base))) (.cse5 (< 0 c_~t4~0.offset)) (.cse6 (< c_~t4~0.offset 0))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (= (select |c_#valid| c_~t4~0.base) 1) (or .cse0 .cse1) (or (and .cse2 .cse3) (= c_~S~0.base c_~x4~0.base) .cse4 .cse5 .cse6) .cse1 .cse2 (= c_~t4~0.offset 0) (<= c_~x1~0.offset 0) .cse3 (<= 0 c_~x1~0.offset) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse7) 0) .cse8 (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse9 0)) (= c_~S~0.base .cse9) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) (= (select |c_#valid| c_~S~0.base) 1) (or .cse0 .cse8) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse7) 0) (not (= c_~x1~0.base c_~t4~0.base)) (or (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| 0) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| 0)) .cse4 .cse5 (= |c_ULTIMATE.start_pop_#t~mem8#1.base| c_~S~0.base) .cse6) (<= c_~S~0.offset 0) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:16:31,429 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse3 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (.cse2 (+ c_~t4~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (or .cse0 .cse1) .cse1 (= c_~t4~0.offset 0) (<= c_~x1~0.offset 0) (<= 0 c_~x1~0.offset) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse2) 0) .cse3 (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse4 0)) (= c_~S~0.base .cse4) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) (= (select |c_#valid| c_~S~0.base) 1) (or .cse0 .cse3) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse2) 0) (not (= c_~x1~0.base c_~t4~0.base)) (<= c_~S~0.offset 0) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:16:32,311 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~t4~0.offset 4))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) (= c_~t4~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse0) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse1 0)) (= c_~S~0.base .cse1) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) (= (select |c_#valid| c_~S~0.base) 1) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse0) 0) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:16:34,133 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~t4~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) (= c_~t4~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse0) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse1 0)) (= c_~S~0.base .cse1) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) (= (select |c_#valid| c_~S~0.base) 1) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse0) 0) (not (= c_~x1~0.base c_~t4~0.base)) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:16:34,145 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse1 (<= 0 c_~x1~0.offset))) (and (= (select |c_#valid| c_~t4~0.base) 1) (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (<= c_~x1~0.offset 0) .cse1 (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse2 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse2) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse2) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (or (and (= c_~S~0.base 0) (= c_~S~0.offset 0)) (= c_~S~0.base c_~t4~0.base) (< c_~t4~0.offset 0)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse3 0)) (= c_~S~0.base .cse3)))) (not .cse1)) (<= c_~S~0.offset 0) (<= c_~t4~0.offset 0) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:34,149 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse1 (<= 0 c_~x1~0.offset))) (and (= (select |c_#valid| c_~t4~0.base) 1) (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (<= c_~x1~0.offset 0) .cse1 (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse2 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse2) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse2) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse3 0)) (= c_~S~0.base .cse3)))) (not .cse1)) (<= c_~S~0.offset 0) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:35,670 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (.cse2 (= c_~x4~0.offset 0)) (.cse3 (= c_~x4~0.base 0)) (.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse4 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (= (select |c_#valid| c_~t4~0.base) 1) (or .cse0 .cse1) (or (and .cse2 .cse3) (= c_~S~0.base c_~x4~0.base) (not (= c_~S~0.base c_~t4~0.base)) (< 0 c_~t4~0.offset) (< c_~t4~0.offset 0)) .cse1 .cse2 (= c_~t4~0.offset 0) (<= c_~x1~0.offset 0) .cse3 (<= 0 c_~x1~0.offset) .cse4 (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse5 0)) (= c_~S~0.base .cse5) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) (= (select |c_#valid| c_~S~0.base) 1) (or .cse0 .cse4) (<= c_~S~0.offset 0) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:16:36,986 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse1 (<= 0 c_~x1~0.offset)) (.cse3 (not (<= 0 c_~t4~0.offset))) (.cse4 (not (<= c_~t4~0.offset c_~S~0.offset))) (.cse5 (not (= c_~S~0.base c_~t4~0.base)))) (and (= (select |c_#valid| c_~t4~0.base) 1) (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (<= c_~x1~0.offset 0) .cse1 (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse2 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse2) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse2) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (or .cse3 (= |c_ULTIMATE.start_pop_#t~mem8#1.base| c_~t4~0.base) (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| 0) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| 0)) .cse4 .cse5) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse6 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse6 0)) (= c_~S~0.base .cse6)))) (not .cse1)) (<= c_~S~0.offset 0) (or .cse3 (and (= c_~x4~0.offset 0) (= c_~x4~0.base 0)) .cse4 .cse5 (= c_~x4~0.base c_~t4~0.base)) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:36,991 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse1 (<= 0 c_~x1~0.offset)) (.cse3 (not (<= 0 c_~t4~0.offset))) (.cse4 (not (<= c_~t4~0.offset c_~S~0.offset))) (.cse5 (not (= c_~S~0.base c_~t4~0.base)))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (<= c_~x1~0.offset 0) .cse1 (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse2 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse2) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse2) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (or .cse3 (= |c_ULTIMATE.start_pop_#t~mem8#1.base| c_~t4~0.base) (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| 0) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| 0)) .cse4 .cse5) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse6 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse6 0)) (= c_~S~0.base .cse6)))) (not .cse1)) (<= c_~S~0.offset 0) (or .cse3 (and (= c_~x4~0.offset 0) (= c_~x4~0.base 0)) .cse4 .cse5 (= c_~x4~0.base c_~t4~0.base)) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:37,223 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) (forall ((v_~x1~0.offset_30 Int)) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse0 0)) (= c_~S~0.base .cse0) (not (= (select v_arrayElimArr_49 (+ v_~x1~0.offset_30 4)) c_~S~0.base))))) (not (<= 0 v_~x1~0.offset_30)) (not (<= v_~x1~0.offset_30 0)))) (<= c_~S~0.offset 0) (or (= (select |c_#valid| c_~t4~0.base) 1) (and (= c_~t4~0.base 0) (= c_~t4~0.offset 0)))) is different from false [2022-07-14 06:16:37,230 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse1 (<= 0 c_~x1~0.offset))) (and (= (select |c_#valid| c_~t4~0.base) 1) (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (<= c_~x1~0.offset 0) .cse1 (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse2 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse2) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse2) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse3 0)) (= c_~S~0.base .cse3)))) (not .cse1)) (<= c_~S~0.offset 0) (or (not (<= 0 c_~t4~0.offset)) (and (= c_~x4~0.offset 0) (= c_~x4~0.base 0)) (not (<= c_~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base c_~t4~0.base)) (= c_~x4~0.base c_~t4~0.base)) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:37,234 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~x1~0.base c_~S~0.base)) (.cse1 (<= 0 c_~x1~0.offset))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0)) (<= c_~x1~0.offset 0) .cse1 (exists ((~x1~0.offset Int) (~x1~0.base Int)) (let ((.cse2 (= c_~S~0.base ~x1~0.base))) (and (= c_~S~0.base (select (select |c_#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (or (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) .cse2) (<= ~x1~0.offset 0) (or (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) .cse2) (<= 0 ~x1~0.offset)))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4))) (or (forall ((v_arrayElimArr_49 (Array Int Int)) (~t4~0.offset Int) (~x1~0.base Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| ~x1~0.base v_arrayElimArr_49) c_~S~0.base) (+ ~t4~0.offset 4)))) (or (not (<= 0 ~t4~0.offset)) (not (<= ~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base (select v_arrayElimArr_49 (+ 4 c_~x1~0.offset)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| ~x1~0.base v_ArrVal_1599) c_~S~0.base) (+ ~t4~0.offset 4)) 0)) (= .cse3 0)) (= c_~S~0.base .cse3)))) (not .cse1)) (<= c_~S~0.offset 0) (or (not (<= 0 c_~t4~0.offset)) (and (= c_~x4~0.offset 0) (= c_~x4~0.base 0)) (not (<= c_~t4~0.offset c_~S~0.offset)) (not (= c_~S~0.base c_~t4~0.base)) (= c_~x4~0.base c_~t4~0.base)) (= c_~t1~0.base c_~S~0.base))) is different from false [2022-07-14 06:16:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:39,736 INFO L93 Difference]: Finished difference Result 114972 states and 131696 transitions. [2022-07-14 06:16:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2022-07-14 06:16:39,736 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 9.4) internal successors, (376), 39 states have internal predecessors, (376), 0 states have call successors, (0), 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 162 [2022-07-14 06:16:39,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:39,873 INFO L225 Difference]: With dead ends: 114972 [2022-07-14 06:16:39,873 INFO L226 Difference]: Without dead ends: 114972 [2022-07-14 06:16:39,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 333 SyntacticMatches, 48 SemanticMatches, 244 ConstructedPredicates, 29 IntricatePredicates, 5 DeprecatedPredicates, 21526 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=4616, Invalid=42191, Unknown=181, NotChecked=13282, Total=60270 [2022-07-14 06:16:39,878 INFO L413 NwaCegarLoop]: 781 mSDtfsCounter, 2669 mSDsluCounter, 14300 mSDsCounter, 0 mSdLazyCounter, 3391 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2669 SdHoareTripleChecker+Valid, 15081 SdHoareTripleChecker+Invalid, 10145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 3391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6451 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:39,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2669 Valid, 15081 Invalid, 10145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 3391 Invalid, 0 Unknown, 6451 Unchecked, 1.7s Time] [2022-07-14 06:16:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114972 states. [2022-07-14 06:16:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114972 to 55404. [2022-07-14 06:16:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55404 states, 55395 states have (on average 1.1450491921653578) internal successors, (63430), 55403 states have internal predecessors, (63430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55404 states to 55404 states and 63430 transitions. [2022-07-14 06:16:40,951 INFO L78 Accepts]: Start accepts. Automaton has 55404 states and 63430 transitions. Word has length 162 [2022-07-14 06:16:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:40,952 INFO L495 AbstractCegarLoop]: Abstraction has 55404 states and 63430 transitions. [2022-07-14 06:16:40,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 9.4) internal successors, (376), 39 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 55404 states and 63430 transitions. [2022-07-14 06:16:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 06:16:40,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:40,970 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:40,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-07-14 06:16:41,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:41,171 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:16:41,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:41,172 INFO L85 PathProgramCache]: Analyzing trace with hash 757256838, now seen corresponding path program 4 times [2022-07-14 06:16:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:41,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046801843] [2022-07-14 06:16:41,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:41,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 104 proven. 682 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-14 06:16:41,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:41,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046801843] [2022-07-14 06:16:41,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046801843] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:41,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479850598] [2022-07-14 06:16:41,474 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:16:41,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:41,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:41,476 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:16:41,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-14 06:16:41,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:16:41,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:16:41,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-14 06:16:41,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:16:41,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:16:42,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:16:42,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:16:42,313 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:16:42,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:16:42,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:16:42,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:16:42,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:16:42,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:16:42,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:16:42,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:16:42,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:16:42,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:16:42,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:42,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-14 06:16:42,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:42,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-14 06:16:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 100 proven. 686 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-14 06:16:42,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:16:44,862 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:44,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:16:44,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:44,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:16:44,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:16:44,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:44,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:16:44,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:16:44,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:16:44,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:16:45,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:16:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 96 proven. 690 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-14 06:16:45,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479850598] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:16:45,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:16:45,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2022-07-14 06:16:45,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281598830] [2022-07-14 06:16:45,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:16:45,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-14 06:16:45,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:45,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-14 06:16:45,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=882, Unknown=8, NotChecked=0, Total=992 [2022-07-14 06:16:45,753 INFO L87 Difference]: Start difference. First operand 55404 states and 63430 transitions. Second operand has 32 states, 32 states have (on average 9.71875) internal successors, (311), 31 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:46,742 INFO L93 Difference]: Finished difference Result 87579 states and 99646 transitions. [2022-07-14 06:16:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 06:16:46,743 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 9.71875) internal successors, (311), 31 states have internal predecessors, (311), 0 states have call successors, (0), 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 162 [2022-07-14 06:16:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:46,917 INFO L225 Difference]: With dead ends: 87579 [2022-07-14 06:16:46,917 INFO L226 Difference]: Without dead ends: 87579 [2022-07-14 06:16:46,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=484, Invalid=2370, Unknown=8, NotChecked=0, Total=2862 [2022-07-14 06:16:46,918 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 782 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 528 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:46,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 3301 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 686 Invalid, 0 Unknown, 528 Unchecked, 0.3s Time] [2022-07-14 06:16:46,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87579 states. [2022-07-14 06:16:47,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87579 to 62671. [2022-07-14 06:16:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62671 states, 62662 states have (on average 1.1442341450959115) internal successors, (71700), 62670 states have internal predecessors, (71700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62671 states to 62671 states and 71700 transitions. [2022-07-14 06:16:47,693 INFO L78 Accepts]: Start accepts. Automaton has 62671 states and 71700 transitions. Word has length 162 [2022-07-14 06:16:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:47,694 INFO L495 AbstractCegarLoop]: Abstraction has 62671 states and 71700 transitions. [2022-07-14 06:16:47,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.71875) internal successors, (311), 31 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 62671 states and 71700 transitions. [2022-07-14 06:16:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-14 06:16:47,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:47,714 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:47,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-07-14 06:16:47,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-14 06:16:47,915 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:16:47,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1484828713, now seen corresponding path program 1 times [2022-07-14 06:16:47,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:47,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308491470] [2022-07-14 06:16:47,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:47,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 248 proven. 2 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2022-07-14 06:16:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:48,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308491470] [2022-07-14 06:16:48,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308491470] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:48,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084959840] [2022-07-14 06:16:48,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:48,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:48,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:48,012 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:16:48,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-14 06:16:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:48,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 06:16:48,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:16:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 237 proven. 17 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2022-07-14 06:16:48,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:16:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 237 proven. 17 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2022-07-14 06:16:48,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084959840] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:16:48,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:16:48,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-07-14 06:16:48,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480240300] [2022-07-14 06:16:48,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:16:48,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:16:48,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:48,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:16:48,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:16:48,317 INFO L87 Difference]: Start difference. First operand 62671 states and 71700 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:48,674 INFO L93 Difference]: Finished difference Result 41262 states and 46890 transitions. [2022-07-14 06:16:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:16:48,688 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 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 166 [2022-07-14 06:16:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:48,757 INFO L225 Difference]: With dead ends: 41262 [2022-07-14 06:16:48,757 INFO L226 Difference]: Without dead ends: 41262 [2022-07-14 06:16:48,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 334 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:16:48,758 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 444 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:48,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 854 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41262 states. [2022-07-14 06:16:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41262 to 29583. [2022-07-14 06:16:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29583 states, 29574 states have (on average 1.1314668289713938) internal successors, (33462), 29582 states have internal predecessors, (33462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29583 states to 29583 states and 33462 transitions. [2022-07-14 06:16:49,207 INFO L78 Accepts]: Start accepts. Automaton has 29583 states and 33462 transitions. Word has length 166 [2022-07-14 06:16:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:49,207 INFO L495 AbstractCegarLoop]: Abstraction has 29583 states and 33462 transitions. [2022-07-14 06:16:49,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 29583 states and 33462 transitions. [2022-07-14 06:16:49,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-14 06:16:49,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:49,219 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 11, 11, 9, 8, 7, 7, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:49,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-07-14 06:16:49,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-14 06:16:49,420 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:16:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash -115562864, now seen corresponding path program 5 times [2022-07-14 06:16:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:49,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052901145] [2022-07-14 06:16:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 117 proven. 744 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-14 06:16:49,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:49,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052901145] [2022-07-14 06:16:49,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052901145] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:49,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376523349] [2022-07-14 06:16:49,674 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:16:49,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:49,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:49,675 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:16:49,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-14 06:16:50,362 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-07-14 06:16:50,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:16:50,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:16:50,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:16:50,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:16:50,433 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:16:50,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:16:50,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:16:50,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 06:16:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 298 proven. 572 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-14 06:16:50,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:16:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 190 proven. 658 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-14 06:16:51,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376523349] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:16:51,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:16:51,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 27 [2022-07-14 06:16:51,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000061673] [2022-07-14 06:16:51,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:16:51,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 06:16:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:51,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 06:16:51,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:16:51,058 INFO L87 Difference]: Start difference. First operand 29583 states and 33462 transitions. Second operand has 28 states, 27 states have (on average 10.185185185185185) internal successors, (275), 28 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:53,314 INFO L93 Difference]: Finished difference Result 48435 states and 54689 transitions. [2022-07-14 06:16:53,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-14 06:16:53,315 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 10.185185185185185) internal successors, (275), 28 states have internal predecessors, (275), 0 states have call successors, (0), 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 173 [2022-07-14 06:16:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:53,376 INFO L225 Difference]: With dead ends: 48435 [2022-07-14 06:16:53,376 INFO L226 Difference]: Without dead ends: 48435 [2022-07-14 06:16:53,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1343, Invalid=3769, Unknown=0, NotChecked=0, Total=5112 [2022-07-14 06:16:53,382 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 1597 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:53,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 3184 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 06:16:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48435 states. [2022-07-14 06:16:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48435 to 31844. [2022-07-14 06:16:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31844 states, 31835 states have (on average 1.133469451861159) internal successors, (36084), 31843 states have internal predecessors, (36084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31844 states to 31844 states and 36084 transitions. [2022-07-14 06:16:53,980 INFO L78 Accepts]: Start accepts. Automaton has 31844 states and 36084 transitions. Word has length 173 [2022-07-14 06:16:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:53,980 INFO L495 AbstractCegarLoop]: Abstraction has 31844 states and 36084 transitions. [2022-07-14 06:16:53,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 10.185185185185185) internal successors, (275), 28 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 31844 states and 36084 transitions. [2022-07-14 06:16:53,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-14 06:16:53,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:53,993 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 11, 11, 9, 8, 7, 7, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:54,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-14 06:16:54,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:54,208 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:16:54,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:54,209 INFO L85 PathProgramCache]: Analyzing trace with hash -115562863, now seen corresponding path program 1 times [2022-07-14 06:16:54,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:54,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481281291] [2022-07-14 06:16:54,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:54,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 117 proven. 744 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-14 06:16:55,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:55,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481281291] [2022-07-14 06:16:55,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481281291] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:55,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015865087] [2022-07-14 06:16:55,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:55,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:55,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:55,042 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:16:55,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-14 06:16:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:55,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-14 06:16:55,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:16:55,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:16:55,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:16:55,816 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:16:55,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:16:55,858 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:16:55,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:16:56,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:16:56,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:16:56,375 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:56,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-07-14 06:16:56,382 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:56,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-14 06:16:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 82 proven. 787 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-14 06:16:56,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:16:57,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-07-14 06:16:57,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2022-07-14 06:16:57,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-07-14 06:16:57,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2022-07-14 06:16:57,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 06:16:57,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:16:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 88 proven. 781 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-14 06:16:58,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015865087] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:16:58,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:16:58,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 36 [2022-07-14 06:16:58,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599225770] [2022-07-14 06:16:58,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:16:58,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-14 06:16:58,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:58,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-14 06:16:58,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1218, Unknown=0, NotChecked=0, Total=1332 [2022-07-14 06:16:58,960 INFO L87 Difference]: Start difference. First operand 31844 states and 36084 transitions. Second operand has 37 states, 36 states have (on average 10.333333333333334) internal successors, (372), 37 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:15,797 INFO L93 Difference]: Finished difference Result 67345 states and 76058 transitions. [2022-07-14 06:17:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-07-14 06:17:15,799 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 10.333333333333334) internal successors, (372), 37 states have internal predecessors, (372), 0 states have call successors, (0), 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 173 [2022-07-14 06:17:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:15,892 INFO L225 Difference]: With dead ends: 67345 [2022-07-14 06:17:15,893 INFO L226 Difference]: Without dead ends: 67345 [2022-07-14 06:17:15,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18678 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=10156, Invalid=39796, Unknown=0, NotChecked=0, Total=49952 [2022-07-14 06:17:15,917 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 4953 mSDsluCounter, 7082 mSDsCounter, 0 mSdLazyCounter, 3692 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4953 SdHoareTripleChecker+Valid, 7489 SdHoareTripleChecker+Invalid, 5790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 3692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1619 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:15,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4953 Valid, 7489 Invalid, 5790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 3692 Invalid, 0 Unknown, 1619 Unchecked, 2.7s Time] [2022-07-14 06:17:15,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67345 states. [2022-07-14 06:17:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67345 to 36452. [2022-07-14 06:17:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36452 states, 36443 states have (on average 1.1341821474631617) internal successors, (41333), 36451 states have internal predecessors, (41333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36452 states to 36452 states and 41333 transitions. [2022-07-14 06:17:16,584 INFO L78 Accepts]: Start accepts. Automaton has 36452 states and 41333 transitions. Word has length 173 [2022-07-14 06:17:16,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:16,599 INFO L495 AbstractCegarLoop]: Abstraction has 36452 states and 41333 transitions. [2022-07-14 06:17:16,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 10.333333333333334) internal successors, (372), 37 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 36452 states and 41333 transitions. [2022-07-14 06:17:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-14 06:17:16,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:16,650 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 16, 12, 12, 10, 8, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:17:16,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-14 06:17:16,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:16,871 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:17:16,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash -695935548, now seen corresponding path program 2 times [2022-07-14 06:17:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:16,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323256892] [2022-07-14 06:17:16,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:16,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 56 proven. 736 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 06:17:17,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:17,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323256892] [2022-07-14 06:17:17,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323256892] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:17,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664901088] [2022-07-14 06:17:17,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:17:17,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:17,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:17:17,245 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:17:17,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-14 06:17:17,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:17:17,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:17:17,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 06:17:17,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:17:18,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:17:18,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:17:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 121 proven. 653 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-14 06:17:18,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:17:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 94 proven. 643 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-14 06:17:18,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664901088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:17:18,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:17:18,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 24 [2022-07-14 06:17:18,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343983707] [2022-07-14 06:17:18,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:17:18,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 06:17:18,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:18,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 06:17:18,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:17:18,451 INFO L87 Difference]: Start difference. First operand 36452 states and 41333 transitions. Second operand has 24 states, 24 states have (on average 10.166666666666666) internal successors, (244), 24 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:23,311 INFO L93 Difference]: Finished difference Result 57098 states and 64496 transitions. [2022-07-14 06:17:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-07-14 06:17:23,312 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.166666666666666) internal successors, (244), 24 states have internal predecessors, (244), 0 states have call successors, (0), 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 174 [2022-07-14 06:17:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:23,396 INFO L225 Difference]: With dead ends: 57098 [2022-07-14 06:17:23,396 INFO L226 Difference]: Without dead ends: 57098 [2022-07-14 06:17:23,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 442 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8401 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4703, Invalid=19789, Unknown=0, NotChecked=0, Total=24492 [2022-07-14 06:17:23,400 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 1100 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 4245 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:23,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 4245 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-14 06:17:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57098 states. [2022-07-14 06:17:23,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57098 to 36301. [2022-07-14 06:17:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36301 states, 36292 states have (on average 1.1337209302325582) internal successors, (41145), 36300 states have internal predecessors, (41145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36301 states to 36301 states and 41145 transitions. [2022-07-14 06:17:24,193 INFO L78 Accepts]: Start accepts. Automaton has 36301 states and 41145 transitions. Word has length 174 [2022-07-14 06:17:24,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:24,195 INFO L495 AbstractCegarLoop]: Abstraction has 36301 states and 41145 transitions. [2022-07-14 06:17:24,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.166666666666666) internal successors, (244), 24 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 36301 states and 41145 transitions. [2022-07-14 06:17:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-14 06:17:24,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:24,247 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 16, 12, 12, 10, 8, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:17:24,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-07-14 06:17:24,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-07-14 06:17:24,469 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:17:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1469366084, now seen corresponding path program 3 times [2022-07-14 06:17:24,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:24,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664947546] [2022-07-14 06:17:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:24,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 200 proven. 531 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-14 06:17:24,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:24,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664947546] [2022-07-14 06:17:24,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664947546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:24,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257462847] [2022-07-14 06:17:24,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:17:24,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:24,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:17:24,631 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) [2022-07-14 06:17:24,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-14 06:17:24,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-14 06:17:24,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:17:24,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:17:24,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:17:24,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:17:25,064 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:17:25,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:17:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 199 proven. 532 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-14 06:17:25,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:17:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 199 proven. 532 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-14 06:17:25,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257462847] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:17:25,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:17:25,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-07-14 06:17:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813472811] [2022-07-14 06:17:25,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:17:25,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:17:25,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:25,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:17:25,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:17:25,316 INFO L87 Difference]: Start difference. First operand 36301 states and 41145 transitions. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:25,758 INFO L93 Difference]: Finished difference Result 42830 states and 48413 transitions. [2022-07-14 06:17:25,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:17:25,758 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2022-07-14 06:17:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:25,814 INFO L225 Difference]: With dead ends: 42830 [2022-07-14 06:17:25,815 INFO L226 Difference]: Without dead ends: 42830 [2022-07-14 06:17:25,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:17:25,815 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 289 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:25,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 702 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:17:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42830 states. [2022-07-14 06:17:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42830 to 38999. [2022-07-14 06:17:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38999 states, 38990 states have (on average 1.131905616824827) internal successors, (44133), 38998 states have internal predecessors, (44133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38999 states to 38999 states and 44133 transitions. [2022-07-14 06:17:26,377 INFO L78 Accepts]: Start accepts. Automaton has 38999 states and 44133 transitions. Word has length 174 [2022-07-14 06:17:26,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:26,377 INFO L495 AbstractCegarLoop]: Abstraction has 38999 states and 44133 transitions. [2022-07-14 06:17:26,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 38999 states and 44133 transitions. [2022-07-14 06:17:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-14 06:17:26,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:26,406 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 16, 12, 12, 10, 8, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:17:26,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-07-14 06:17:26,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:26,631 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:17:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2129791236, now seen corresponding path program 4 times [2022-07-14 06:17:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:26,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848066676] [2022-07-14 06:17:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:26,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 200 proven. 523 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-14 06:17:26,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:26,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848066676] [2022-07-14 06:17:26,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848066676] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:26,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390296205] [2022-07-14 06:17:26,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:17:26,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:26,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:17:26,769 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) [2022-07-14 06:17:26,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-14 06:17:27,198 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:17:27,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:17:27,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:17:27,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:17:27,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:17:27,318 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:17:27,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:17:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 199 proven. 524 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-14 06:17:27,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:17:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 199 proven. 524 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-14 06:17:27,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390296205] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:17:27,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:17:27,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-07-14 06:17:27,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428157917] [2022-07-14 06:17:27,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:17:27,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:17:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:27,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:17:27,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:17:27,667 INFO L87 Difference]: Start difference. First operand 38999 states and 44133 transitions. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:28,289 INFO L93 Difference]: Finished difference Result 36773 states and 41384 transitions. [2022-07-14 06:17:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:17:28,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2022-07-14 06:17:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:28,343 INFO L225 Difference]: With dead ends: 36773 [2022-07-14 06:17:28,343 INFO L226 Difference]: Without dead ends: 36773 [2022-07-14 06:17:28,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:17:28,344 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 260 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:28,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 694 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:17:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36773 states. [2022-07-14 06:17:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36773 to 20605. [2022-07-14 06:17:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20605 states, 20596 states have (on average 1.1325500097106234) internal successors, (23326), 20604 states have internal predecessors, (23326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20605 states to 20605 states and 23326 transitions. [2022-07-14 06:17:28,666 INFO L78 Accepts]: Start accepts. Automaton has 20605 states and 23326 transitions. Word has length 174 [2022-07-14 06:17:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:28,666 INFO L495 AbstractCegarLoop]: Abstraction has 20605 states and 23326 transitions. [2022-07-14 06:17:28,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 20605 states and 23326 transitions. [2022-07-14 06:17:28,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-14 06:17:28,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:28,677 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 10, 10, 10, 9, 8, 7, 6, 4, 4, 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] [2022-07-14 06:17:28,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-07-14 06:17:29,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-14 06:17:29,030 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:17:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:29,030 INFO L85 PathProgramCache]: Analyzing trace with hash 5125917, now seen corresponding path program 1 times [2022-07-14 06:17:29,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:29,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211517907] [2022-07-14 06:17:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:29,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 117 proven. 843 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-14 06:17:29,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:29,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211517907] [2022-07-14 06:17:29,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211517907] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:29,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935106722] [2022-07-14 06:17:29,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:29,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:29,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:17:29,541 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) [2022-07-14 06:17:29,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-07-14 06:17:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:29,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-14 06:17:29,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:17:29,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:17:30,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:17:30,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:17:30,385 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:17:30,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:17:30,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:30,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:30,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:30,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:30,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:30,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:30,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:30,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:30,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:17:30,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:17:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 113 proven. 837 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-14 06:17:31,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:17:31,227 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2576 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2576) c_~t4~0.base) (+ c_~t4~0.offset 4)))) (forall ((v_ArrVal_2575 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2575) c_~t4~0.base) (+ c_~t4~0.offset 4)) 0))) is different from false [2022-07-14 06:17:31,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_50 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_50) 0)) (and (forall ((v_ArrVal_2575 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_50 v_ArrVal_2575) c_~t4~0.base) (+ c_~t4~0.offset 4)) 0)) (forall ((v_ArrVal_2576 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_50 v_ArrVal_2576) c_~t4~0.base) (+ c_~t4~0.offset 4)) 0))))) is different from false [2022-07-14 06:17:31,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_50 Int)) (or (and (forall ((v_ArrVal_2576 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_50 v_ArrVal_2576) c_~S~0.base) (+ c_~S~0.offset 4)) 0)) (forall ((v_ArrVal_2575 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_50 v_ArrVal_2575) c_~S~0.base) (+ c_~S~0.offset 4)) 0))) (not (= (select |c_#valid| v_~x1~0.base_50) 0)))) is different from false [2022-07-14 06:17:31,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:31,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:31,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:31,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:31,959 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:31,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:31,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:31,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:31,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_50 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (or (and (forall ((v_ArrVal_2575 (Array Int Int))) (= (let ((.cse0 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.offset| c_~x1~0.base (store (select |#memory_$Pointer$.offset| c_~x1~0.base) .cse0 c_~t1~0.offset)) v_~x1~0.base_50 v_ArrVal_2575) c_~x1~0.base) .cse0)) 0)) (forall ((v_ArrVal_2576 (Array Int Int))) (= (let ((.cse1 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.base| c_~x1~0.base (store (select |#memory_$Pointer$.base| c_~x1~0.base) .cse1 c_~t1~0.base)) v_~x1~0.base_50 v_ArrVal_2576) c_~x1~0.base) .cse1)) 0))) (not (= (select |c_#valid| v_~x1~0.base_50) 0)))) is different from false [2022-07-14 06:17:31,984 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:31,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:31,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:31,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:32,028 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:32,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:32,395 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:32,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:32,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:32,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:32,435 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:32,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:32,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:32,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:32,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:32,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:32,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:32,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:32,525 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:32,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:32,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:32,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:32,564 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:32,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:32,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:32,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:32,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:32,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:32,611 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:32,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:32,658 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:32,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:32,671 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:32,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:32,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:32,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:32,707 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:32,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:32,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:32,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:32,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:32,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:32,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:32,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:32,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:32,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:32,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:32,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:33,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:17:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 103 proven. 256 refuted. 0 times theorem prover too weak. 67 trivial. 591 not checked. [2022-07-14 06:17:33,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935106722] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:17:33,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:17:33,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 23 [2022-07-14 06:17:33,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154680569] [2022-07-14 06:17:33,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:17:33,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 06:17:33,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:33,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 06:17:33,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=334, Unknown=4, NotChecked=156, Total=552 [2022-07-14 06:17:33,062 INFO L87 Difference]: Start difference. First operand 20605 states and 23326 transitions. Second operand has 24 states, 24 states have (on average 10.375) internal successors, (249), 23 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:33,158 WARN L833 $PredicateComparison]: unable to prove that (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (= c_~t4~0.base 0) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (forall ((v_~x1~0.base_50 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (or (and (forall ((v_ArrVal_2575 (Array Int Int))) (= (let ((.cse0 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.offset| c_~x1~0.base (store (select |#memory_$Pointer$.offset| c_~x1~0.base) .cse0 c_~t1~0.offset)) v_~x1~0.base_50 v_ArrVal_2575) c_~x1~0.base) .cse0)) 0)) (forall ((v_ArrVal_2576 (Array Int Int))) (= (let ((.cse1 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.base| c_~x1~0.base (store (select |#memory_$Pointer$.base| c_~x1~0.base) .cse1 c_~t1~0.base)) v_~x1~0.base_50 v_ArrVal_2576) c_~x1~0.base) .cse1)) 0))) (not (= (select |c_#valid| v_~x1~0.base_50) 0)))) (= c_~S~0.base 0) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (= c_~S~0.offset 0)) is different from false [2022-07-14 06:17:33,161 WARN L833 $PredicateComparison]: unable to prove that (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (forall ((v_~x1~0.base_50 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (or (and (forall ((v_ArrVal_2575 (Array Int Int))) (= (let ((.cse0 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.offset| c_~x1~0.base (store (select |#memory_$Pointer$.offset| c_~x1~0.base) .cse0 c_~t1~0.offset)) v_~x1~0.base_50 v_ArrVal_2575) c_~x1~0.base) .cse0)) 0)) (forall ((v_ArrVal_2576 (Array Int Int))) (= (let ((.cse1 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.base| c_~x1~0.base (store (select |#memory_$Pointer$.base| c_~x1~0.base) .cse1 c_~t1~0.base)) v_~x1~0.base_50 v_ArrVal_2576) c_~x1~0.base) .cse1)) 0))) (not (= (select |c_#valid| v_~x1~0.base_50) 0)))) (= c_~S~0.base 0) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (= c_~S~0.offset 0)) is different from false [2022-07-14 06:17:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:41,367 INFO L93 Difference]: Finished difference Result 38929 states and 43862 transitions. [2022-07-14 06:17:41,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-07-14 06:17:41,368 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.375) internal successors, (249), 23 states have internal predecessors, (249), 0 states have call successors, (0), 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 176 [2022-07-14 06:17:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:41,421 INFO L225 Difference]: With dead ends: 38929 [2022-07-14 06:17:41,421 INFO L226 Difference]: Without dead ends: 38929 [2022-07-14 06:17:41,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 353 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=632, Invalid=3920, Unknown=28, NotChecked=822, Total=5402 [2022-07-14 06:17:41,429 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 813 mSDsluCounter, 3412 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 3676 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1928 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:41,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 3676 Invalid, 3378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1321 Invalid, 0 Unknown, 1928 Unchecked, 0.7s Time] [2022-07-14 06:17:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38929 states. [2022-07-14 06:17:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38929 to 26451. [2022-07-14 06:17:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26451 states, 26442 states have (on average 1.131079343468724) internal successors, (29908), 26450 states have internal predecessors, (29908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26451 states to 26451 states and 29908 transitions. [2022-07-14 06:17:41,868 INFO L78 Accepts]: Start accepts. Automaton has 26451 states and 29908 transitions. Word has length 176 [2022-07-14 06:17:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:41,887 INFO L495 AbstractCegarLoop]: Abstraction has 26451 states and 29908 transitions. [2022-07-14 06:17:41,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.375) internal successors, (249), 23 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 26451 states and 29908 transitions. [2022-07-14 06:17:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-14 06:17:41,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:41,910 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 10, 10, 10, 9, 8, 7, 6, 4, 4, 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] [2022-07-14 06:17:41,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-07-14 06:17:42,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:42,120 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:17:42,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:42,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1570485007, now seen corresponding path program 2 times [2022-07-14 06:17:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:42,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714495219] [2022-07-14 06:17:42,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:42,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 117 proven. 847 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-14 06:17:42,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:42,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714495219] [2022-07-14 06:17:42,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714495219] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:42,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724261626] [2022-07-14 06:17:42,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:17:42,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:42,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:17:42,466 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:17:42,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-07-14 06:17:42,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:17:42,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:17:42,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-14 06:17:42,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:17:42,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:17:42,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:17:42,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:17:43,250 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:17:43,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:17:43,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:43,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:43,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:43,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:43,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:43,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:43,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:43,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:17:43,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:17:43,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:17:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 113 proven. 841 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-14 06:17:43,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:17:43,923 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2705 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2705) c_~t4~0.base) (+ c_~t4~0.offset 4)) 0)) (forall ((v_ArrVal_2704 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2704) c_~t4~0.base) (+ c_~t4~0.offset 4)) 0))) is different from false [2022-07-14 06:17:44,238 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_52 Int)) (or (and (forall ((v_ArrVal_2705 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_52 v_ArrVal_2705) c_~S~0.base) (+ c_~S~0.offset 4)) 0)) (forall ((v_ArrVal_2704 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_52 v_ArrVal_2704) c_~S~0.base) (+ c_~S~0.offset 4)) 0))) (not (= 0 (select |c_#valid| v_~x1~0.base_52))))) is different from false [2022-07-14 06:17:45,881 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:45,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:45,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:45,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:45,893 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:45,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:45,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:45,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:45,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:45,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:45,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:45,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:45,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:45,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:45,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:45,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:45,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:45,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:45,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:45,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:46,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:46,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:46,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:46,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:46,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:46,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:46,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:46,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:46,088 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:46,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:46,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:46,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:46,123 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:46,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:46,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:46,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:46,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:46,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:46,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:46,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:46,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:46,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:46,217 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:46,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:46,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:46,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:46,250 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:46,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:46,269 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:46,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:46,290 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:46,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:46,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:46,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:46,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:17:46,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:17:46,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:46,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:17:46,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:46,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:17:46,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:17:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 103 proven. 441 refuted. 0 times theorem prover too weak. 63 trivial. 410 not checked. [2022-07-14 06:17:46,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724261626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:17:46,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:17:46,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 24 [2022-07-14 06:17:46,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586924648] [2022-07-14 06:17:46,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:17:46,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 06:17:46,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:46,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 06:17:46,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=446, Unknown=5, NotChecked=86, Total=600 [2022-07-14 06:17:46,780 INFO L87 Difference]: Start difference. First operand 26451 states and 29908 transitions. Second operand has 25 states, 25 states have (on average 10.32) internal successors, (258), 24 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:46,932 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_~x1~0.offset))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= (select (select |c_#memory_$Pointer$.base| c_~x1~0.base) .cse0) 0) (= c_~t4~0.base 0) (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) (forall ((v_~x1~0.base_52 Int)) (or (and (forall ((v_ArrVal_2705 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_52 v_ArrVal_2705) c_~S~0.base) (+ c_~S~0.offset 4)) 0)) (forall ((v_ArrVal_2704 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_52 v_ArrVal_2704) c_~S~0.base) (+ c_~S~0.offset 4)) 0))) (not (= 0 (select |c_#valid| v_~x1~0.base_52))))) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (= (select (select |c_#memory_$Pointer$.offset| c_~x1~0.base) .cse0) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) (= c_~x1~0.offset 0) (= (select |c_#valid| c_~S~0.base) 1) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:17:46,939 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_~x1~0.offset))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= (select (select |c_#memory_$Pointer$.base| c_~x1~0.base) .cse0) 0) (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) (forall ((v_~x1~0.base_52 Int)) (or (and (forall ((v_ArrVal_2705 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_52 v_ArrVal_2705) c_~S~0.base) (+ c_~S~0.offset 4)) 0)) (forall ((v_ArrVal_2704 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_52 v_ArrVal_2704) c_~S~0.base) (+ c_~S~0.offset 4)) 0))) (not (= 0 (select |c_#valid| v_~x1~0.base_52))))) (= (select (select |c_#memory_$Pointer$.offset| c_~x1~0.base) .cse0) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) (= c_~x1~0.offset 0) (= (select |c_#valid| c_~S~0.base) 1) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:17:50,489 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_~x1~0.offset)) (.cse1 (+ c_~t4~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= (select (select |c_#memory_$Pointer$.base| c_~x1~0.base) .cse0) 0) (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) 4) 0) (forall ((v_~x1~0.base_52 Int)) (or (and (forall ((v_ArrVal_2705 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_52 v_ArrVal_2705) c_~S~0.base) (+ c_~S~0.offset 4)) 0)) (forall ((v_ArrVal_2704 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_52 v_ArrVal_2704) c_~S~0.base) (+ c_~S~0.offset 4)) 0))) (not (= 0 (select |c_#valid| v_~x1~0.base_52))))) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) 0) (= (select (select |c_#memory_$Pointer$.offset| c_~x1~0.base) .cse0) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) 4)) (= c_~x1~0.offset 0) (= (select |c_#valid| c_~S~0.base) 1) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) 0) (not (= c_~x1~0.base c_~t4~0.base)) (= c_~S~0.offset 0))) is different from false [2022-07-14 06:17:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:58,707 INFO L93 Difference]: Finished difference Result 53438 states and 60101 transitions. [2022-07-14 06:17:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-14 06:17:58,707 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.32) internal successors, (258), 24 states have internal predecessors, (258), 0 states have call successors, (0), 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 176 [2022-07-14 06:17:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:58,786 INFO L225 Difference]: With dead ends: 53438 [2022-07-14 06:17:58,786 INFO L226 Difference]: Without dead ends: 53438 [2022-07-14 06:17:58,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 363 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1556 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=883, Invalid=4948, Unknown=41, NotChecked=770, Total=6642 [2022-07-14 06:17:58,788 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 1257 mSDsluCounter, 5170 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 5594 SdHoareTripleChecker+Invalid, 3437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1971 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:58,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 5594 Invalid, 3437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1347 Invalid, 0 Unknown, 1971 Unchecked, 0.7s Time] [2022-07-14 06:17:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53438 states. [2022-07-14 06:17:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53438 to 32282. [2022-07-14 06:17:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32282 states, 32273 states have (on average 1.1317819849409723) internal successors, (36526), 32281 states have internal predecessors, (36526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32282 states to 32282 states and 36526 transitions. [2022-07-14 06:17:59,381 INFO L78 Accepts]: Start accepts. Automaton has 32282 states and 36526 transitions. Word has length 176 [2022-07-14 06:17:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:59,382 INFO L495 AbstractCegarLoop]: Abstraction has 32282 states and 36526 transitions. [2022-07-14 06:17:59,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.32) internal successors, (258), 24 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:17:59,382 INFO L276 IsEmpty]: Start isEmpty. Operand 32282 states and 36526 transitions. [2022-07-14 06:17:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-14 06:17:59,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:59,399 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 10, 10, 10, 9, 8, 7, 6, 4, 4, 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] [2022-07-14 06:17:59,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-07-14 06:17:59,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-07-14 06:17:59,615 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:17:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1126112478, now seen corresponding path program 1 times [2022-07-14 06:17:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:59,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801160041] [2022-07-14 06:17:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 117 proven. 843 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-14 06:18:00,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:18:00,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801160041] [2022-07-14 06:18:00,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801160041] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:18:00,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773762685] [2022-07-14 06:18:00,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:00,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:18:00,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:18:00,018 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:18:00,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-07-14 06:18:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:00,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-14 06:18:00,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:00,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:18:00,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:18:00,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:18:00,765 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:18:00,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:18:00,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:00,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:00,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:00,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:00,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:00,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:01,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:18:01,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:18:01,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:18:01,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:18:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 113 proven. 837 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-14 06:18:01,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:18:01,433 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2833 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2833) c_~t4~0.base) (+ c_~t4~0.offset 4)) 0)) (forall ((v_ArrVal_2834 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2834) c_~t4~0.base) (+ c_~t4~0.offset 4)) 0))) is different from false [2022-07-14 06:18:01,484 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2834 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2834) c_~S~0.base) (+ c_~S~0.offset 4)) 0)) (forall ((v_ArrVal_2833 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2833) c_~S~0.base) (+ c_~S~0.offset 4)) 0))) is different from false [2022-07-14 06:18:02,064 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,174 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,189 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,218 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,231 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,289 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,311 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,378 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,391 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,411 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,448 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,482 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,710 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:02,783 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:02,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:02,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:02,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:02,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:02,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:03,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:18:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 103 proven. 440 refuted. 0 times theorem prover too weak. 67 trivial. 407 not checked. [2022-07-14 06:18:03,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773762685] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:18:03,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:18:03,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 23 [2022-07-14 06:18:03,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878557182] [2022-07-14 06:18:03,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:18:03,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 06:18:03,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:18:03,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 06:18:03,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=408, Unknown=4, NotChecked=82, Total=552 [2022-07-14 06:18:03,113 INFO L87 Difference]: Start difference. First operand 32282 states and 36526 transitions. Second operand has 24 states, 24 states have (on average 10.541666666666666) internal successors, (253), 23 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:04,715 INFO L93 Difference]: Finished difference Result 71224 states and 80018 transitions. [2022-07-14 06:18:04,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-14 06:18:04,718 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.541666666666666) internal successors, (253), 23 states have internal predecessors, (253), 0 states have call successors, (0), 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 176 [2022-07-14 06:18:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:04,819 INFO L225 Difference]: With dead ends: 71224 [2022-07-14 06:18:04,820 INFO L226 Difference]: Without dead ends: 71224 [2022-07-14 06:18:04,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 350 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=465, Invalid=2955, Unknown=10, NotChecked=230, Total=3660 [2022-07-14 06:18:04,821 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 1022 mSDsluCounter, 3236 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 3588 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1782 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:04,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 3588 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 741 Invalid, 0 Unknown, 1782 Unchecked, 0.5s Time] [2022-07-14 06:18:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71224 states. [2022-07-14 06:18:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71224 to 45861. [2022-07-14 06:18:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45861 states, 45852 states have (on average 1.1323388292768037) internal successors, (51920), 45860 states have internal predecessors, (51920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45861 states to 45861 states and 51920 transitions. [2022-07-14 06:18:05,960 INFO L78 Accepts]: Start accepts. Automaton has 45861 states and 51920 transitions. Word has length 176 [2022-07-14 06:18:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:05,960 INFO L495 AbstractCegarLoop]: Abstraction has 45861 states and 51920 transitions. [2022-07-14 06:18:05,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.541666666666666) internal successors, (253), 23 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 45861 states and 51920 transitions. [2022-07-14 06:18:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-14 06:18:05,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:05,984 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 10, 10, 10, 9, 8, 7, 6, 4, 4, 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] [2022-07-14 06:18:06,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:06,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-14 06:18:06,200 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:18:06,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1112908510, now seen corresponding path program 2 times [2022-07-14 06:18:06,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:18:06,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140940589] [2022-07-14 06:18:06,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:06,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:18:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 117 proven. 852 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-14 06:18:06,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:18:06,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140940589] [2022-07-14 06:18:06,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140940589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:18:06,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478881165] [2022-07-14 06:18:06,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:18:06,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:18:06,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:18:06,576 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:18:06,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-07-14 06:18:06,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:18:06,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:18:06,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-14 06:18:06,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:06,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:18:07,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:18:07,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:18:07,341 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:18:07,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:18:07,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:07,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:07,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:07,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:07,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:07,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:07,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:18:07,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:18:07,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:18:07,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:18:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 113 proven. 846 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-14 06:18:08,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:18:08,200 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2963 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2963) c_~t4~0.base) (+ c_~t4~0.offset 4)) 0)) (forall ((v_ArrVal_2962 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2962) c_~t4~0.base) (+ c_~t4~0.offset 4)) 0))) is different from false [2022-07-14 06:18:08,257 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2963 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2963) c_~S~0.base) (+ c_~S~0.offset 4)) 0)) (forall ((v_ArrVal_2962 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2962) c_~S~0.base) (+ c_~S~0.offset 4)) 0))) is different from false [2022-07-14 06:18:08,700 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:08,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:08,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:08,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:08,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((|#memory_$Pointer$.base| (Array Int (Array Int Int))) (v_~x1~0.base_56 Int) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (or (not (= (select |c_#valid| v_~x1~0.base_56) 0)) (and (forall ((v_ArrVal_2962 (Array Int Int))) (= (let ((.cse0 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.offset| c_~x1~0.base (store (select |#memory_$Pointer$.offset| c_~x1~0.base) .cse0 c_~t1~0.offset)) v_~x1~0.base_56 v_ArrVal_2962) c_~x1~0.base) .cse0)) 0)) (forall ((v_ArrVal_2963 (Array Int Int))) (= (let ((.cse1 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.base| c_~x1~0.base (store (select |#memory_$Pointer$.base| c_~x1~0.base) .cse1 c_~t1~0.base)) v_~x1~0.base_56 v_ArrVal_2963) c_~x1~0.base) .cse1)) 0))))) is different from false [2022-07-14 06:18:08,736 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:08,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:08,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:08,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:08,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:08,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:08,778 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:08,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:08,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:08,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:08,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:08,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:08,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:08,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:08,841 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:08,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:08,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:08,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:08,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:08,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:08,895 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:08,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:08,909 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:08,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:08,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:08,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:08,942 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:08,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:08,961 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:08,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:08,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:08,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:08,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:08,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:09,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:09,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:09,054 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:09,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:09,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:09,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:09,088 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:09,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:09,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:09,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:09,120 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:09,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:09,138 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:09,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:09,150 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:09,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:09,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:09,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:09,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:09,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:09,199 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:09,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:09,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:09,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:09,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:09,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:09,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:09,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:09,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:09,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:09,280 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:09,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:09,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:09,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:09,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:09,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:09,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:09,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:09,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:18:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 103 proven. 312 refuted. 0 times theorem prover too weak. 58 trivial. 544 not checked. [2022-07-14 06:18:09,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478881165] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:18:09,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:18:09,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 23 [2022-07-14 06:18:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669603278] [2022-07-14 06:18:09,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:18:09,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 06:18:09,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:18:09,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 06:18:09,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=371, Unknown=4, NotChecked=120, Total=552 [2022-07-14 06:18:09,593 INFO L87 Difference]: Start difference. First operand 45861 states and 51920 transitions. Second operand has 24 states, 24 states have (on average 10.541666666666666) internal successors, (253), 23 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:11,204 WARN L833 $PredicateComparison]: unable to prove that (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (forall ((|#memory_$Pointer$.base| (Array Int (Array Int Int))) (v_~x1~0.base_56 Int) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (or (not (= (select |c_#valid| v_~x1~0.base_56) 0)) (and (forall ((v_ArrVal_2962 (Array Int Int))) (= (let ((.cse0 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.offset| c_~x1~0.base (store (select |#memory_$Pointer$.offset| c_~x1~0.base) .cse0 c_~t1~0.offset)) v_~x1~0.base_56 v_ArrVal_2962) c_~x1~0.base) .cse0)) 0)) (forall ((v_ArrVal_2963 (Array Int Int))) (= (let ((.cse1 (+ 4 c_~x1~0.offset))) (select (select (store (store |#memory_$Pointer$.base| c_~x1~0.base (store (select |#memory_$Pointer$.base| c_~x1~0.base) .cse1 c_~t1~0.base)) v_~x1~0.base_56 v_ArrVal_2963) c_~x1~0.base) .cse1)) 0))))) (= c_~S~0.base 0) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (= c_~S~0.offset 0)) is different from false [2022-07-14 06:18:13,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:13,417 INFO L93 Difference]: Finished difference Result 124850 states and 140546 transitions. [2022-07-14 06:18:13,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-07-14 06:18:13,419 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.541666666666666) internal successors, (253), 23 states have internal predecessors, (253), 0 states have call successors, (0), 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 176 [2022-07-14 06:18:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:13,629 INFO L225 Difference]: With dead ends: 124850 [2022-07-14 06:18:13,629 INFO L226 Difference]: Without dead ends: 124850 [2022-07-14 06:18:13,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 358 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2999 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1010, Invalid=7910, Unknown=26, NotChecked=756, Total=9702 [2022-07-14 06:18:13,631 INFO L413 NwaCegarLoop]: 577 mSDtfsCounter, 1341 mSDsluCounter, 6016 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 6593 SdHoareTripleChecker+Invalid, 5676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3865 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:13,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 6593 Invalid, 5676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1662 Invalid, 0 Unknown, 3865 Unchecked, 1.0s Time] [2022-07-14 06:18:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124850 states. [2022-07-14 06:18:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124850 to 79115. [2022-07-14 06:18:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79115 states, 79106 states have (on average 1.1307865395798042) internal successors, (89452), 79114 states have internal predecessors, (89452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79115 states to 79115 states and 89452 transitions. [2022-07-14 06:18:15,566 INFO L78 Accepts]: Start accepts. Automaton has 79115 states and 89452 transitions. Word has length 176 [2022-07-14 06:18:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:15,567 INFO L495 AbstractCegarLoop]: Abstraction has 79115 states and 89452 transitions. [2022-07-14 06:18:15,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.541666666666666) internal successors, (253), 23 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 79115 states and 89452 transitions. [2022-07-14 06:18:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-14 06:18:15,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:15,612 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 10, 10, 10, 9, 8, 7, 6, 4, 4, 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] [2022-07-14 06:18:15,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:15,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-14 06:18:15,826 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:18:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:15,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1411330781, now seen corresponding path program 3 times [2022-07-14 06:18:15,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:18:15,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715484380] [2022-07-14 06:18:15,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:15,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:18:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 117 proven. 853 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-14 06:18:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:18:16,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715484380] [2022-07-14 06:18:16,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715484380] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:18:16,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557746417] [2022-07-14 06:18:16,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:18:16,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:18:16,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:18:16,354 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:18:16,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-07-14 06:18:17,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-07-14 06:18:17,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:18:17,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-14 06:18:17,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:17,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:18:17,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:18:17,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:18:17,947 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:18:17,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:18:17,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:17,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:17,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:18,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:18,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:18,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:18,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:18,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:18:18,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:18,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:18:18,291 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:18,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:18:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 155 proven. 760 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-14 06:18:18,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:18:18,809 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3091 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_3091) c_~S~0.base) (+ c_~S~0.offset 4)) 0)) (forall ((v_ArrVal_3092 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_3092) c_~S~0.base) (+ c_~S~0.offset 4)) 0))) is different from false [2022-07-14 06:18:19,530 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:19,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:19,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:19,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:19,549 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:19,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:19,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:19,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:19,574 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:19,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:19,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:18:19,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:18:19,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:19,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-14 06:18:19,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:19,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:18:20,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:18:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 103 proven. 485 refuted. 0 times theorem prover too weak. 102 trivial. 327 not checked. [2022-07-14 06:18:20,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557746417] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:18:20,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:18:20,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 25 [2022-07-14 06:18:20,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258753198] [2022-07-14 06:18:20,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:18:20,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 06:18:20,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:18:20,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 06:18:20,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=532, Unknown=1, NotChecked=46, Total=650 [2022-07-14 06:18:20,064 INFO L87 Difference]: Start difference. First operand 79115 states and 89452 transitions. Second operand has 26 states, 26 states have (on average 11.115384615384615) internal successors, (289), 25 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:24,890 INFO L93 Difference]: Finished difference Result 137688 states and 154807 transitions. [2022-07-14 06:18:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-07-14 06:18:24,891 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.115384615384615) internal successors, (289), 25 states have internal predecessors, (289), 0 states have call successors, (0), 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 176 [2022-07-14 06:18:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:25,112 INFO L225 Difference]: With dead ends: 137688 [2022-07-14 06:18:25,112 INFO L226 Difference]: Without dead ends: 137688 [2022-07-14 06:18:25,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 355 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2898 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1165, Invalid=7194, Unknown=17, NotChecked=180, Total=8556 [2022-07-14 06:18:25,113 INFO L413 NwaCegarLoop]: 474 mSDtfsCounter, 1455 mSDsluCounter, 5107 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 5581 SdHoareTripleChecker+Invalid, 3781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1853 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:25,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 5581 Invalid, 3781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1704 Invalid, 0 Unknown, 1853 Unchecked, 1.1s Time] [2022-07-14 06:18:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137688 states. [2022-07-14 06:18:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137688 to 45016. [2022-07-14 06:18:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45016 states, 45007 states have (on average 1.1284689048370253) internal successors, (50789), 45015 states have internal predecessors, (50789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45016 states to 45016 states and 50789 transitions. [2022-07-14 06:18:26,739 INFO L78 Accepts]: Start accepts. Automaton has 45016 states and 50789 transitions. Word has length 176 [2022-07-14 06:18:26,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:26,740 INFO L495 AbstractCegarLoop]: Abstraction has 45016 states and 50789 transitions. [2022-07-14 06:18:26,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.115384615384615) internal successors, (289), 25 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 45016 states and 50789 transitions. [2022-07-14 06:18:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-14 06:18:26,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:26,761 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 13, 13, 10, 8, 8, 7, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:26,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:26,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-07-14 06:18:26,980 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:18:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1498211354, now seen corresponding path program 6 times [2022-07-14 06:18:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:18:26,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435934919] [2022-07-14 06:18:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:26,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:18:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 286 proven. 800 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-14 06:18:27,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:18:27,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435934919] [2022-07-14 06:18:27,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435934919] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:18:27,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625941932] [2022-07-14 06:18:27,446 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:18:27,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:18:27,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:18:27,448 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:18:27,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-07-14 06:18:28,330 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-07-14 06:18:28,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:18:28,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-14 06:18:28,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:28,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:18:28,468 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:18:28,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:18:28,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:18:28,859 INFO L356 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2022-07-14 06:18:28,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-07-14 06:18:28,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-14 06:18:28,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-14 06:18:29,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:29,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2022-07-14 06:18:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 280 proven. 842 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-14 06:18:31,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:18:32,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:32,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-14 06:18:32,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:32,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2022-07-14 06:18:32,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-14 06:18:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 221 proven. 896 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-14 06:18:36,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625941932] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:18:36,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:18:36,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 44 [2022-07-14 06:18:36,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726604150] [2022-07-14 06:18:36,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:18:36,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-14 06:18:36,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:18:36,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-14 06:18:36,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1779, Unknown=1, NotChecked=0, Total=1980 [2022-07-14 06:18:36,711 INFO L87 Difference]: Start difference. First operand 45016 states and 50789 transitions. Second operand has 45 states, 44 states have (on average 9.25) internal successors, (407), 45 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)