./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/splice-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/splice-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:01:09,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:01:09,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:01:09,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:01:09,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:01:09,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:01:09,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:01:09,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:01:09,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:01:09,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:01:09,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:01:09,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:01:09,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:01:09,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:01:09,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:01:09,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:01:09,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:01:09,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:01:09,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:01:09,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:01:09,510 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:01:09,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:01:09,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:01:09,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:01:09,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:01:09,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:01:09,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:01:09,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:01:09,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:01:09,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:01:09,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:01:09,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:01:09,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:01:09,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:01:09,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:01:09,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:01:09,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:01:09,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:01:09,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:01:09,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:01:09,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:01:09,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:01:09,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:01:09,552 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:01:09,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:01:09,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:01:09,555 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:01:09,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:01:09,556 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:01:09,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:01:09,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:01:09,557 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:01:09,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:01:09,558 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:01:09,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:01:09,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:01:09,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:01:09,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:01:09,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:01:09,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:01:09,560 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:01:09,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:01:09,560 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:01:09,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:01:09,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:01:09,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:01:09,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:01:09,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:01:09,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:01:09,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:01:09,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:01:09,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:01:09,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:01:09,563 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:01:09,563 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:01:09,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:01:09,564 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 ! call(reach_error())) ) 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 -> 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc [2022-07-21 02:01:09,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:01:09,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:01:09,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:01:09,952 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:01:09,952 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:01:09,954 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/splice-2.i [2022-07-21 02:01:10,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a54cfb08/ae086857ea254eb69e8c51c795ec5ff9/FLAG70798bc97 [2022-07-21 02:01:10,589 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:01:10,592 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/splice-2.i [2022-07-21 02:01:10,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a54cfb08/ae086857ea254eb69e8c51c795ec5ff9/FLAG70798bc97 [2022-07-21 02:01:10,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a54cfb08/ae086857ea254eb69e8c51c795ec5ff9 [2022-07-21 02:01:10,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:01:10,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:01:10,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:01:10,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:01:11,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:01:11,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:01:10" (1/1) ... [2022-07-21 02:01:11,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec9cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11, skipping insertion in model container [2022-07-21 02:01:11,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:01:10" (1/1) ... [2022-07-21 02:01:11,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:01:11,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:01:11,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2022-07-21 02:01:11,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:01:11,309 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:01:11,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2022-07-21 02:01:11,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:01:11,369 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:01:11,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11 WrapperNode [2022-07-21 02:01:11,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:01:11,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:01:11,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:01:11,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:01:11,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11" (1/1) ... [2022-07-21 02:01:11,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11" (1/1) ... [2022-07-21 02:01:11,414 INFO L137 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2022-07-21 02:01:11,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:01:11,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:01:11,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:01:11,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:01:11,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11" (1/1) ... [2022-07-21 02:01:11,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11" (1/1) ... [2022-07-21 02:01:11,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11" (1/1) ... [2022-07-21 02:01:11,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11" (1/1) ... [2022-07-21 02:01:11,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11" (1/1) ... [2022-07-21 02:01:11,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11" (1/1) ... [2022-07-21 02:01:11,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11" (1/1) ... [2022-07-21 02:01:11,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:01:11,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:01:11,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:01:11,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:01:11,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11" (1/1) ... [2022-07-21 02:01:11,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:01:11,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:01:11,504 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-21 02:01:11,519 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-21 02:01:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-21 02:01:11,550 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-21 02:01:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:01:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:01:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:01:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:01:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:01:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:01:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:01:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:01:11,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:01:11,691 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:01:11,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:01:11,730 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-21 02:01:11,864 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:01:11,872 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:01:11,872 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 02:01:11,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:01:11 BoogieIcfgContainer [2022-07-21 02:01:11,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:01:11,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:01:11,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:01:11,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:01:11,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:01:10" (1/3) ... [2022-07-21 02:01:11,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7cf8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:01:11, skipping insertion in model container [2022-07-21 02:01:11,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:01:11" (2/3) ... [2022-07-21 02:01:11,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7cf8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:01:11, skipping insertion in model container [2022-07-21 02:01:11,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:01:11" (3/3) ... [2022-07-21 02:01:11,889 INFO L111 eAbstractionObserver]: Analyzing ICFG splice-2.i [2022-07-21 02:01:11,903 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:01:11,903 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:01:11,964 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:01:11,971 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@1a782117, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22d67d87 [2022-07-21 02:01:11,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:01:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 02:01:11,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:11,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:11,994 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:12,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:12,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1192551972, now seen corresponding path program 1 times [2022-07-21 02:01:12,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:12,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426796836] [2022-07-21 02:01:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:12,192 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-21 02:01:12,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:12,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426796836] [2022-07-21 02:01:12,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426796836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:01:12,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:01:12,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 02:01:12,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918239396] [2022-07-21 02:01:12,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:01:12,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 02:01:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:12,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 02:01:12,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:01:12,234 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:12,253 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2022-07-21 02:01:12,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 02:01:12,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-21 02:01:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:12,261 INFO L225 Difference]: With dead ends: 48 [2022-07-21 02:01:12,262 INFO L226 Difference]: Without dead ends: 23 [2022-07-21 02:01:12,264 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-21 02:01:12,269 INFO L413 NwaCegarLoop]: 40 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, 40 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-21 02:01:12,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:01:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-21 02:01:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-21 02:01:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-07-21 02:01:12,301 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-07-21 02:01:12,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:12,302 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-07-21 02:01:12,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-07-21 02:01:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 02:01:12,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:12,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:12,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:01:12,306 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:12,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:12,307 INFO L85 PathProgramCache]: Analyzing trace with hash 675462707, now seen corresponding path program 1 times [2022-07-21 02:01:12,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:12,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201771048] [2022-07-21 02:01:12,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:12,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:12,459 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-21 02:01:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:12,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201771048] [2022-07-21 02:01:12,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201771048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:01:12,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:01:12,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:01:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817019268] [2022-07-21 02:01:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:01:12,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:01:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:01:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:01:12,465 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:12,524 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-07-21 02:01:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 02:01:12,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-07-21 02:01:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:12,525 INFO L225 Difference]: With dead ends: 40 [2022-07-21 02:01:12,525 INFO L226 Difference]: Without dead ends: 33 [2022-07-21 02:01:12,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:01:12,527 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:12,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:01:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-21 02:01:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-21 02:01:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-07-21 02:01:12,532 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2022-07-21 02:01:12,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:12,533 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-21 02:01:12,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-07-21 02:01:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 02:01:12,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:12,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:12,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:01:12,534 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:12,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:12,535 INFO L85 PathProgramCache]: Analyzing trace with hash 577924040, now seen corresponding path program 1 times [2022-07-21 02:01:12,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:12,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361269145] [2022-07-21 02:01:12,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:12,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:12,631 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-21 02:01:12,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:12,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361269145] [2022-07-21 02:01:12,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361269145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:01:12,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:01:12,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:01:12,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607783593] [2022-07-21 02:01:12,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:01:12,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:01:12,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:12,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:01:12,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:01:12,635 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:12,690 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-07-21 02:01:12,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 02:01:12,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 02:01:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:12,694 INFO L225 Difference]: With dead ends: 47 [2022-07-21 02:01:12,694 INFO L226 Difference]: Without dead ends: 39 [2022-07-21 02:01:12,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:01:12,700 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:12,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:01:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-21 02:01:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-07-21 02:01:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 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-21 02:01:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-07-21 02:01:12,713 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 16 [2022-07-21 02:01:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:12,713 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-07-21 02:01:12,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-07-21 02:01:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 02:01:12,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:12,715 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:12,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 02:01:12,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:12,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1645466066, now seen corresponding path program 1 times [2022-07-21 02:01:12,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:12,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513487800] [2022-07-21 02:01:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:12,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:01:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:12,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513487800] [2022-07-21 02:01:12,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513487800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:01:12,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:01:12,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 02:01:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561889687] [2022-07-21 02:01:12,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:01:12,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:01:12,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:12,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:01:12,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:01:12,828 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:12,963 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2022-07-21 02:01:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:01:12,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-21 02:01:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:12,964 INFO L225 Difference]: With dead ends: 70 [2022-07-21 02:01:12,965 INFO L226 Difference]: Without dead ends: 43 [2022-07-21 02:01:12,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:01:12,973 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:12,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:01:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-21 02:01:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-21 02:01:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-07-21 02:01:12,986 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 17 [2022-07-21 02:01:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:12,986 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-07-21 02:01:12,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-07-21 02:01:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 02:01:12,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:12,988 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:12,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 02:01:12,988 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:12,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1334445095, now seen corresponding path program 1 times [2022-07-21 02:01:12,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:12,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525010937] [2022-07-21 02:01:12,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:12,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:01:13,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:13,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525010937] [2022-07-21 02:01:13,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525010937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:13,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720664441] [2022-07-21 02:01:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:01:13,298 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-21 02:01:13,299 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-21 02:01:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:13,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-21 02:01:13,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:01:13,457 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-21 02:01:13,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:01:13,572 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:01:13,573 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-21 02:01:13,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:13,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 02:01:13,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:01:13,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:13,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 21 treesize of output 20 [2022-07-21 02:01:13,721 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-21 02:01:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:01:13,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:01:13,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_102 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-21 02:01:13,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_98 Int) (v_ArrVal_102 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_98)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-21 02:01:13,921 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 02:01:13,921 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 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-21 02:01:13,939 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:01:13,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-21 02:01:13,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-21 02:01:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 02:01:14,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720664441] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:01:14,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:01:14,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-07-21 02:01:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961667274] [2022-07-21 02:01:14,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:01:14,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 02:01:14,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:14,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 02:01:14,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=389, Unknown=2, NotChecked=82, Total=552 [2022-07-21 02:01:14,109 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:18,843 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2022-07-21 02:01:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 02:01:18,844 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-21 02:01:18,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:18,844 INFO L225 Difference]: With dead ends: 138 [2022-07-21 02:01:18,844 INFO L226 Difference]: Without dead ends: 105 [2022-07-21 02:01:18,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=293, Invalid=1514, Unknown=7, NotChecked=166, Total=1980 [2022-07-21 02:01:18,846 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 98 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:18,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 259 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 344 Invalid, 0 Unknown, 165 Unchecked, 0.2s Time] [2022-07-21 02:01:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-21 02:01:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 61. [2022-07-21 02:01:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-07-21 02:01:18,853 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 23 [2022-07-21 02:01:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:18,854 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-07-21 02:01:18,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2022-07-21 02:01:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:01:18,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:18,855 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:18,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 02:01:19,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:19,080 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1115102530, now seen corresponding path program 1 times [2022-07-21 02:01:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:19,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758789046] [2022-07-21 02:01:19,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:19,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:01:19,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:19,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758789046] [2022-07-21 02:01:19,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758789046] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:19,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580559152] [2022-07-21 02:01:19,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:19,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:19,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:01:19,137 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-21 02:01:19,138 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-21 02:01:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:19,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 02:01:19,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:01:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 02:01:19,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:01:19,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580559152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:01:19,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 02:01:19,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-21 02:01:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980692140] [2022-07-21 02:01:19,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:01:19,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:01:19,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:19,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:01:19,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:01:19,242 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.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-21 02:01:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:19,258 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2022-07-21 02:01:19,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:01:19,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.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 25 [2022-07-21 02:01:19,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:19,261 INFO L225 Difference]: With dead ends: 115 [2022-07-21 02:01:19,261 INFO L226 Difference]: Without dead ends: 82 [2022-07-21 02:01:19,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:01:19,263 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:19,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 60 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:01:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-21 02:01:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-07-21 02:01:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 69 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2022-07-21 02:01:19,271 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 25 [2022-07-21 02:01:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:19,271 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2022-07-21 02:01:19,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.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-21 02:01:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-07-21 02:01:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:01:19,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:19,272 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:19,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 02:01:19,476 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,SelfDestructingSolverStorable5 [2022-07-21 02:01:19,477 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1793450878, now seen corresponding path program 1 times [2022-07-21 02:01:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:19,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587578394] [2022-07-21 02:01:19,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:19,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:01:19,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:19,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587578394] [2022-07-21 02:01:19,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587578394] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:19,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49115080] [2022-07-21 02:01:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:19,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:19,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:01:19,625 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-21 02:01:19,626 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-21 02:01:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:19,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-21 02:01:19,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:01:19,734 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-21 02:01:19,739 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-21 02:01:19,803 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 19 treesize of output 7 [2022-07-21 02:01:19,806 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 19 treesize of output 7 [2022-07-21 02:01:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 02:01:19,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:01:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 02:01:19,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49115080] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:01:19,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:01:19,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-07-21 02:01:19,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43355398] [2022-07-21 02:01:19,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:01:19,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 02:01:19,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:19,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 02:01:19,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-21 02:01:19,853 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:20,032 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-07-21 02:01:20,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 02:01:20,033 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-21 02:01:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:20,033 INFO L225 Difference]: With dead ends: 83 [2022-07-21 02:01:20,033 INFO L226 Difference]: Without dead ends: 75 [2022-07-21 02:01:20,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-07-21 02:01:20,034 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:20,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 111 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:01:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-21 02:01:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-21 02:01:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 71 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2022-07-21 02:01:20,041 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 25 [2022-07-21 02:01:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:20,041 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2022-07-21 02:01:20,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-07-21 02:01:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 02:01:20,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:20,042 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:20,067 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-21 02:01:20,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:20,260 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:20,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1425682976, now seen corresponding path program 1 times [2022-07-21 02:01:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:20,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575139114] [2022-07-21 02:01:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:20,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:01:20,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:20,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575139114] [2022-07-21 02:01:20,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575139114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:20,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851594005] [2022-07-21 02:01:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:20,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:20,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:01:20,541 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-21 02:01:20,542 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-21 02:01:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:20,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-21 02:01:20,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:01:20,642 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-21 02:01:20,709 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:01:20,710 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-21 02:01:20,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, 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-21 02:01:20,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, 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-21 02:01:20,801 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:01:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-21 02:01:20,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 42 treesize of output 44 [2022-07-21 02:01:20,809 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 29 treesize of output 19 [2022-07-21 02:01:20,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:01:20,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-07-21 02:01:20,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:01:20,874 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 21 treesize of output 11 [2022-07-21 02:01:20,905 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-21 02:01:20,931 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-21 02:01:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:01:20,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:01:21,007 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-07-21 02:01:21,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_298) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-07-21 02:01:21,023 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_298) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 3)) is different from false [2022-07-21 02:01:21,031 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:01:21,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-21 02:01:21,039 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:01:21,040 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 75 treesize of output 78 [2022-07-21 02:01:21,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 27 treesize of output 16 [2022-07-21 02:01:21,078 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_297 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-21 02:01:21,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:01:21,102 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-21 02:01:21,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:01:21,109 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 39 [2022-07-21 02:01:21,114 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-21 02:01:21,133 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 02:01:21,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-21 02:01:21,138 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 02:01:21,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-07-21 02:01:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-21 02:01:21,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851594005] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:01:21,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:01:21,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2022-07-21 02:01:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876154343] [2022-07-21 02:01:21,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:01:21,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 02:01:21,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:21,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 02:01:21,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=741, Unknown=4, NotChecked=228, Total=1056 [2022-07-21 02:01:21,300 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 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-21 02:01:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:22,059 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-07-21 02:01:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 02:01:22,059 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 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 26 [2022-07-21 02:01:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:22,060 INFO L225 Difference]: With dead ends: 103 [2022-07-21 02:01:22,060 INFO L226 Difference]: Without dead ends: 76 [2022-07-21 02:01:22,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=1777, Unknown=4, NotChecked=356, Total=2352 [2022-07-21 02:01:22,062 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 78 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:22,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 320 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 420 Invalid, 0 Unknown, 177 Unchecked, 0.2s Time] [2022-07-21 02:01:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-21 02:01:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2022-07-21 02:01:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2022-07-21 02:01:22,078 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2022-07-21 02:01:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:22,080 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2022-07-21 02:01:22,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 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-21 02:01:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-07-21 02:01:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 02:01:22,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:22,084 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:22,112 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-21 02:01:22,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:22,285 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:22,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:22,285 INFO L85 PathProgramCache]: Analyzing trace with hash -154506453, now seen corresponding path program 2 times [2022-07-21 02:01:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:22,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322096238] [2022-07-21 02:01:22,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:22,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 02:01:22,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:22,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322096238] [2022-07-21 02:01:22,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322096238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:01:22,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:01:22,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:01:22,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202992808] [2022-07-21 02:01:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:01:22,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:01:22,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:22,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:01:22,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:01:22,314 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:22,325 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2022-07-21 02:01:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:01:22,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-21 02:01:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:22,327 INFO L225 Difference]: With dead ends: 126 [2022-07-21 02:01:22,327 INFO L226 Difference]: Without dead ends: 72 [2022-07-21 02:01:22,327 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-21 02:01:22,328 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:22,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:01:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-21 02:01:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-07-21 02:01:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-07-21 02:01:22,333 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 32 [2022-07-21 02:01:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:22,333 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-07-21 02:01:22,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-07-21 02:01:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 02:01:22,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:22,334 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:22,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 02:01:22,335 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:22,335 INFO L85 PathProgramCache]: Analyzing trace with hash -972154903, now seen corresponding path program 1 times [2022-07-21 02:01:22,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:22,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804313077] [2022-07-21 02:01:22,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:22,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:22,680 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:01:22,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:22,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804313077] [2022-07-21 02:01:22,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804313077] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:22,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498033619] [2022-07-21 02:01:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:22,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:22,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:01:22,682 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-21 02:01:22,709 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-21 02:01:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:22,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-21 02:01:22,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:01:22,801 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-21 02:01:22,871 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-21 02:01:22,910 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:01:22,911 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-21 02:01:22,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 02:01:22,941 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-21 02:01:22,993 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:01:22,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-07-21 02:01:23,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:23,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-21 02:01:23,059 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:01:23,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-21 02:01:23,065 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 20 treesize of output 22 [2022-07-21 02:01:23,130 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:01:23,130 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 17 treesize of output 23 [2022-07-21 02:01:23,143 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 02:01:23,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-21 02:01:23,173 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 8 treesize of output 4 [2022-07-21 02:01:23,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:01:23,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2022-07-21 02:01:23,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:23,422 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:01:23,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 02:01:23,525 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-21 02:01:23,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2022-07-21 02:01:23,590 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-21 02:01:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:01:23,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:01:23,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) 1)) is different from false [2022-07-21 02:01:23,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|))) is different from false [2022-07-21 02:01:23,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base|) (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4) v_ArrVal_459)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset|) 1)) is different from false [2022-07-21 02:01:23,630 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_461)) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) (= 3 |c_ULTIMATE.start_main_#t~mem8#1|)) is different from false [2022-07-21 02:01:23,639 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_461)) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 3)) is different from false [2022-07-21 02:01:23,646 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-21 02:01:25,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 v_ArrVal_459))) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-21 02:01:25,712 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_51|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2022-07-21 02:01:25,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2022-07-21 02:01:25,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:01:25,791 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 110 treesize of output 111 [2022-07-21 02:01:25,809 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:01:25,809 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 820 treesize of output 817 [2022-07-21 02:01:25,822 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 399 treesize of output 391 [2022-07-21 02:01:25,831 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 790 treesize of output 774 [2022-07-21 02:01:38,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse6 (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse7 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse7 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse4 v_ArrVal_459))) (.cse1 (= |v_ULTIMATE.start_main_~p~0#1.base_51| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (and (not .cse1) (let ((.cse3 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= (select (select (store .cse2 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) .cse3) (and (not .cse3) (= (select (select (store .cse2 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (and (= (select (select (store .cse2 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) .cse1) (and (= .cse4 .cse5) (not (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_42)) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))))) is different from false [2022-07-21 02:02:23,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:02:23,623 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:02:23,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 367 treesize of output 203 [2022-07-21 02:02:23,703 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:02:23,704 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 907 treesize of output 897 [2022-07-21 02:02:23,724 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 915 treesize of output 883 [2022-07-21 02:02:23,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 873 treesize of output 825 [2022-07-21 02:02:24,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:02:24,840 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-21 02:02:24,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:02:24,855 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-21 02:02:25,173 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 6 treesize of output 4 [2022-07-21 02:02:25,183 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:02:25,183 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 21 treesize of output 25 [2022-07-21 02:02:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-07-21 02:02:25,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498033619] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:02:25,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:02:25,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 45 [2022-07-21 02:02:25,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025964794] [2022-07-21 02:02:25,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:02:25,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-21 02:02:25,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:02:25,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-21 02:02:25,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1074, Unknown=12, NotChecked=750, Total=1980 [2022-07-21 02:02:25,347 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:02:27,421 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse6 (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse7 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse7 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse4 v_ArrVal_459))) (.cse1 (= |v_ULTIMATE.start_main_~p~0#1.base_51| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (and (not .cse1) (let ((.cse3 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= (select (select (store .cse2 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) .cse3) (and (not .cse3) (= (select (select (store .cse2 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (and (= (select (select (store .cse2 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) .cse1) (and (= .cse4 .cse5) (not (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_42)) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) is different from false [2022-07-21 02:02:29,426 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse6 (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse7 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse7 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse4 v_ArrVal_459))) (.cse1 (= |v_ULTIMATE.start_main_~p~0#1.base_51| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (and (not .cse1) (let ((.cse3 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= (select (select (store .cse2 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) .cse3) (and (not .cse3) (= (select (select (store .cse2 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (and (= (select (select (store .cse2 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) .cse1) (and (= .cse4 .cse5) (not (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_42)) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) is different from false [2022-07-21 02:02:29,431 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_51|) 0 3))))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 .cse3 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-21 02:02:29,436 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_51| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_51|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 .cse3 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-21 02:02:31,439 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 v_ArrVal_459))) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2022-07-21 02:02:31,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:02:31,665 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-07-21 02:02:31,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 02:02:31,665 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-21 02:02:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:02:31,666 INFO L225 Difference]: With dead ends: 77 [2022-07-21 02:02:31,666 INFO L226 Difference]: Without dead ends: 75 [2022-07-21 02:02:31,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 15 IntricatePredicates, 3 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=202, Invalid=1563, Unknown=17, NotChecked=1410, Total=3192 [2022-07-21 02:02:31,668 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 317 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:02:31,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 144 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 161 Invalid, 0 Unknown, 317 Unchecked, 0.1s Time] [2022-07-21 02:02:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-21 02:02:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2022-07-21 02:02:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 66 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:02:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2022-07-21 02:02:31,672 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 32 [2022-07-21 02:02:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:02:31,673 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2022-07-21 02:02:31,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:02:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-07-21 02:02:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 02:02:31,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:02:31,674 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 02:02:31,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-21 02:02:31,887 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,SelfDestructingSolverStorable9 [2022-07-21 02:02:31,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:02:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:02:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2060333054, now seen corresponding path program 1 times [2022-07-21 02:02:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:02:31,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641341621] [2022-07-21 02:02:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:02:31,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:02:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 02:02:31,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:02:31,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641341621] [2022-07-21 02:02:31,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641341621] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:02:31,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396208841] [2022-07-21 02:02:31,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:02:31,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:02:31,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:02:31,956 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-21 02:02:31,957 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-21 02:02:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:32,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 02:02:32,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:02:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 02:02:32,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:02:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 02:02:32,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396208841] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:02:32,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:02:32,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2022-07-21 02:02:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782626692] [2022-07-21 02:02:32,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:02:32,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:02:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:02:32,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:02:32,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:02:32,106 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-21 02:02:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:02:32,193 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2022-07-21 02:02:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 02:02:32,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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 34 [2022-07-21 02:02:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:02:32,194 INFO L225 Difference]: With dead ends: 90 [2022-07-21 02:02:32,194 INFO L226 Difference]: Without dead ends: 85 [2022-07-21 02:02:32,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-21 02:02:32,195 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 73 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:02:32,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 64 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:02:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-21 02:02:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2022-07-21 02:02:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 71 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-21 02:02:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-07-21 02:02:32,200 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 34 [2022-07-21 02:02:32,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:02:32,200 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-07-21 02:02:32,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-21 02:02:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-07-21 02:02:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 02:02:32,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:02:32,201 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:02:32,222 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-21 02:02:32,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:02:32,402 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:02:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:02:32,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2062043076, now seen corresponding path program 1 times [2022-07-21 02:02:32,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:02:32,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098317080] [2022-07-21 02:02:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:02:32,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:02:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:02:32,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:02:32,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098317080] [2022-07-21 02:02:32,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098317080] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:02:32,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286172808] [2022-07-21 02:02:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:02:32,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:02:32,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:02:32,744 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-21 02:02:32,745 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-21 02:02:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:32,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-21 02:02:32,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:02:32,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-21 02:02:32,934 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-21 02:02:32,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-07-21 02:02:32,999 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-21 02:02:32,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-21 02:02:33,012 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-21 02:02:33,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-21 02:02:33,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 19 treesize of output 7 [2022-07-21 02:02:33,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 19 treesize of output 7 [2022-07-21 02:02:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 02:02:33,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:02:50,611 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 10 treesize of output 4 [2022-07-21 02:02:50,614 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 44 treesize of output 32 [2022-07-21 02:02:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 02:02:50,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286172808] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:02:50,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:02:50,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 9] total 26 [2022-07-21 02:02:50,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567783664] [2022-07-21 02:02:50,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:02:50,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 02:02:50,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:02:50,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 02:02:50,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=563, Unknown=12, NotChecked=0, Total=650 [2022-07-21 02:02:50,629 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:02:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:02:54,091 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-07-21 02:02:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 02:02:54,091 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-21 02:02:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:02:54,092 INFO L225 Difference]: With dead ends: 102 [2022-07-21 02:02:54,092 INFO L226 Difference]: Without dead ends: 95 [2022-07-21 02:02:54,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=160, Invalid=1231, Unknown=15, NotChecked=0, Total=1406 [2022-07-21 02:02:54,093 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 76 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:02:54,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 230 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 397 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2022-07-21 02:02:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-21 02:02:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2022-07-21 02:02:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:02:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-21 02:02:54,098 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 34 [2022-07-21 02:02:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:02:54,098 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-21 02:02:54,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:02:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-21 02:02:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 02:02:54,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:02:54,099 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:02:54,120 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-21 02:02:54,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:02:54,312 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:02:54,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:02:54,312 INFO L85 PathProgramCache]: Analyzing trace with hash 355505244, now seen corresponding path program 2 times [2022-07-21 02:02:54,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:02:54,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948733379] [2022-07-21 02:02:54,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:02:54,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:02:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:02:54,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:02:54,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948733379] [2022-07-21 02:02:54,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948733379] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:02:54,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151935861] [2022-07-21 02:02:54,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:02:54,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:02:54,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:02:54,734 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-21 02:02:54,734 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-21 02:02:54,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:02:54,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:02:54,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-21 02:02:54,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:02:54,845 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-21 02:02:54,917 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:02:54,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 02:02:54,963 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-21 02:02:54,971 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-21 02:02:55,033 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:02:55,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-07-21 02:02:55,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:55,043 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-21 02:02:55,066 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-21 02:02:55,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:02:55,127 INFO L356 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2022-07-21 02:02:55,128 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 85 [2022-07-21 02:02:55,132 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 96 [2022-07-21 02:02:55,217 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-21 02:02:55,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 158 [2022-07-21 02:02:55,232 INFO L356 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-07-21 02:02:55,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 149 [2022-07-21 02:02:55,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2022-07-21 02:02:55,402 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:02:55,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 83 [2022-07-21 02:02:55,407 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 76 treesize of output 62 [2022-07-21 02:02:55,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2022-07-21 02:02:55,415 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 52 treesize of output 42 [2022-07-21 02:02:55,431 INFO L356 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2022-07-21 02:02:55,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2022-07-21 02:02:55,457 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 33 treesize of output 15 [2022-07-21 02:02:55,460 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 19 treesize of output 7 [2022-07-21 02:02:55,488 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-21 02:02:55,494 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-21 02:02:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:02:55,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:02:55,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-07-21 02:02:55,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int))) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_789) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-07-21 02:02:55,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_789) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_786) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_787) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-07-21 02:02:55,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= 3 (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_788) .cse0 v_ArrVal_789) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_786) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_787) .cse0) .cse1)))))) is different from false [2022-07-21 02:02:55,564 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_788) .cse0 v_ArrVal_789) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_786) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_787) .cse0) .cse1)))) 3)) (= 3 |c_ULTIMATE.start_main_#t~mem7#1|)) is different from false [2022-07-21 02:02:55,584 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-21 02:02:55,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 119 [2022-07-21 02:02:55,618 INFO L356 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2022-07-21 02:02:55,618 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 433 treesize of output 503 [2022-07-21 02:02:55,625 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 354 treesize of output 290 [2022-07-21 02:02:55,632 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 160 treesize of output 128 [2022-07-21 02:02:57,745 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:02:57,746 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 306 treesize of output 279 [2022-07-21 02:02:57,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:02:57,761 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 271 treesize of output 234 [2022-07-21 02:02:58,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:02:58,289 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 248 treesize of output 216 [2022-07-21 02:02:58,301 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:02:58,302 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 208 treesize of output 191 [2022-07-21 02:02:58,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:02:58,673 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 57 treesize of output 56 [2022-07-21 02:02:58,677 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:02:58,678 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 47 treesize of output 51 [2022-07-21 02:02:58,689 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:02:58,689 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 57 treesize of output 56 [2022-07-21 02:02:58,693 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:02:58,693 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 47 treesize of output 51 [2022-07-21 02:03:06,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:03:06,773 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 84 treesize of output 75 [2022-07-21 02:03:06,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:03:06,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 48973 treesize of output 37724 [2022-07-21 02:03:06,931 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:03:06,932 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 37534 treesize of output 27324 [2022-07-21 02:03:07,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:03:07,006 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 177302 treesize of output 165047 [2022-07-21 02:03:07,784 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 165028 treesize of output 148676 [2022-07-21 02:03:08,198 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:03:08,199 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 148697 treesize of output 105741 [2022-07-21 02:03:08,656 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:03:08,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 105318 treesize of output 103908 [2022-07-21 02:03:09,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:03:09,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 103574 treesize of output 103164 [2022-07-21 02:03:10,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:03:10,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102662 treesize of output 102174