./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condg.c --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/array-fpi/condg.c -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 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 22:00:52,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:00:52,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:00:52,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:00:52,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:00:52,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:00:52,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:00:52,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:00:52,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:00:52,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:00:52,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:00:52,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:00:52,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:00:52,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:00:52,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:00:52,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:00:52,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:00:52,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:00:52,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:00:52,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:00:52,175 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:00:52,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:00:52,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:00:52,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:00:52,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:00:52,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:00:52,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:00:52,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:00:52,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:00:52,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:00:52,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:00:52,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:00:52,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:00:52,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:00:52,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:00:52,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:00:52,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:00:52,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:00:52,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:00:52,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:00:52,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:00:52,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:00:52,198 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:00:52,233 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:00:52,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:00:52,234 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:00:52,234 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:00:52,235 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:00:52,235 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:00:52,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:00:52,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:00:52,236 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:00:52,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:00:52,238 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:00:52,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:00:52,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:00:52,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:00:52,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:00:52,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:00:52,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:00:52,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:00:52,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:00:52,241 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:00:52,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:00:52,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:00:52,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:00:52,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:00:52,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:00:52,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:00:52,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:00:52,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:00:52,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:00:52,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:00:52,243 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:00:52,244 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:00:52,244 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:00:52,244 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 -> 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 [2022-07-20 22:00:52,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:00:52,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:00:52,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:00:52,474 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:00:52,475 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:00:52,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condg.c [2022-07-20 22:00:52,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8099d01/df6d9689bf27428d831110fd84afdef6/FLAG0d6906b79 [2022-07-20 22:00:52,975 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:00:52,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c [2022-07-20 22:00:52,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8099d01/df6d9689bf27428d831110fd84afdef6/FLAG0d6906b79 [2022-07-20 22:00:53,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8099d01/df6d9689bf27428d831110fd84afdef6 [2022-07-20 22:00:53,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:00:53,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:00:53,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:00:53,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:00:53,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:00:53,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:00:53" (1/1) ... [2022-07-20 22:00:53,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7d3a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53, skipping insertion in model container [2022-07-20 22:00:53,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:00:53" (1/1) ... [2022-07-20 22:00:53,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:00:53,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:00:53,538 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/array-fpi/condg.c[588,601] [2022-07-20 22:00:53,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:00:53,570 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:00:53,581 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/array-fpi/condg.c[588,601] [2022-07-20 22:00:53,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:00:53,603 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:00:53,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53 WrapperNode [2022-07-20 22:00:53,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:00:53,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:00:53,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:00:53,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:00:53,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53" (1/1) ... [2022-07-20 22:00:53,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53" (1/1) ... [2022-07-20 22:00:53,656 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-07-20 22:00:53,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:00:53,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:00:53,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:00:53,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:00:53,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53" (1/1) ... [2022-07-20 22:00:53,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53" (1/1) ... [2022-07-20 22:00:53,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53" (1/1) ... [2022-07-20 22:00:53,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53" (1/1) ... [2022-07-20 22:00:53,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53" (1/1) ... [2022-07-20 22:00:53,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53" (1/1) ... [2022-07-20 22:00:53,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53" (1/1) ... [2022-07-20 22:00:53,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:00:53,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:00:53,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:00:53,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:00:53,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53" (1/1) ... [2022-07-20 22:00:53,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:00:53,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:00:53,711 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-20 22:00:53,717 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-20 22:00:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:00:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:00:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 22:00:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 22:00:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:00:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:00:53,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:00:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 22:00:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 22:00:53,799 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:00:53,801 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:00:53,996 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:00:54,002 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:00:54,002 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-20 22:00:54,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:00:54 BoogieIcfgContainer [2022-07-20 22:00:54,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:00:54,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:00:54,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:00:54,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:00:54,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:00:53" (1/3) ... [2022-07-20 22:00:54,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee9724c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:00:54, skipping insertion in model container [2022-07-20 22:00:54,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:00:53" (2/3) ... [2022-07-20 22:00:54,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee9724c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:00:54, skipping insertion in model container [2022-07-20 22:00:54,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:00:54" (3/3) ... [2022-07-20 22:00:54,013 INFO L111 eAbstractionObserver]: Analyzing ICFG condg.c [2022-07-20 22:00:54,026 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:00:54,027 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:00:54,071 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:00:54,077 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@6315c635, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3bc6698f [2022-07-20 22:00:54,078 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:00:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 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-20 22:00:54,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 22:00:54,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:00:54,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:00:54,090 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:00:54,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:00:54,095 INFO L85 PathProgramCache]: Analyzing trace with hash -592817118, now seen corresponding path program 1 times [2022-07-20 22:00:54,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:00:54,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850241436] [2022-07-20 22:00:54,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:54,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:00:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:54,229 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-20 22:00:54,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:00:54,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850241436] [2022-07-20 22:00:54,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850241436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:00:54,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:00:54,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 22:00:54,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986975870] [2022-07-20 22:00:54,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:00:54,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 22:00:54,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:00:54,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 22:00:54,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 22:00:54,265 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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-20 22:00:54,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:00:54,279 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-07-20 22:00:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 22:00:54,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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-20 22:00:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:00:54,288 INFO L225 Difference]: With dead ends: 46 [2022-07-20 22:00:54,289 INFO L226 Difference]: Without dead ends: 21 [2022-07-20 22:00:54,293 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-20 22:00:54,300 INFO L413 NwaCegarLoop]: 30 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, 30 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-20 22:00:54,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:00:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-20 22:00:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-20 22:00:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-20 22:00:54,333 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-07-20 22:00:54,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:00:54,334 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-20 22:00:54,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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-20 22:00:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-07-20 22:00:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 22:00:54,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:00:54,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:00:54,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:00:54,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:00:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:00:54,336 INFO L85 PathProgramCache]: Analyzing trace with hash 108247460, now seen corresponding path program 1 times [2022-07-20 22:00:54,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:00:54,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106895711] [2022-07-20 22:00:54,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:54,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:00:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:54,417 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-20 22:00:54,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:00:54,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106895711] [2022-07-20 22:00:54,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106895711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:00:54,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:00:54,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:00:54,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335432627] [2022-07-20 22:00:54,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:00:54,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:00:54,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:00:54,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:00:54,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:00:54,422 INFO L87 Difference]: Start difference. First operand 21 states and 25 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-20 22:00:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:00:54,526 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-07-20 22:00:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:00:54,527 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-20 22:00:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:00:54,528 INFO L225 Difference]: With dead ends: 48 [2022-07-20 22:00:54,528 INFO L226 Difference]: Without dead ends: 34 [2022-07-20 22:00:54,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:00:54,529 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:00:54,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:00:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-20 22:00:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2022-07-20 22:00:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-20 22:00:54,537 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2022-07-20 22:00:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:00:54,537 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-20 22:00:54,537 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-20 22:00:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-20 22:00:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 22:00:54,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:00:54,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:00:54,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 22:00:54,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:00:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:00:54,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1242970242, now seen corresponding path program 1 times [2022-07-20 22:00:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:00:54,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429189830] [2022-07-20 22:00:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:00:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:00:54,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:00:54,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429189830] [2022-07-20 22:00:54,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429189830] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:00:54,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559358339] [2022-07-20 22:00:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:54,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:00:54,997 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-20 22:00:55,020 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-20 22:00:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:55,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 22:00:55,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:00:55,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:00:55,166 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 18 treesize of output 14 [2022-07-20 22:00:55,223 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-20 22:00:55,292 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 0 case distinctions, treesize of input 46 treesize of output 20 [2022-07-20 22:00:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:00:55,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:00:55,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_44 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_44) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)) is different from false [2022-07-20 22:00:55,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:00:55,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-20 22:00:55,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:00:55,568 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 38 treesize of output 38 [2022-07-20 22:00:55,573 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 9 [2022-07-20 22:00:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 22:00:55,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559358339] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:00:55,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:00:55,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-07-20 22:00:55,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266279883] [2022-07-20 22:00:55,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:00:55,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 22:00:55,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:00:55,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 22:00:55,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2022-07-20 22:00:55,639 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:55,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:00:55,886 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-07-20 22:00:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 22:00:55,887 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 22:00:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:00:55,888 INFO L225 Difference]: With dead ends: 56 [2022-07-20 22:00:55,889 INFO L226 Difference]: Without dead ends: 54 [2022-07-20 22:00:55,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=370, Unknown=1, NotChecked=40, Total=506 [2022-07-20 22:00:55,890 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:00:55,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 96 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 158 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-07-20 22:00:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-20 22:00:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2022-07-20 22:00:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-07-20 22:00:55,903 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2022-07-20 22:00:55,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:00:55,904 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-20 22:00:55,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-07-20 22:00:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 22:00:55,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:00:55,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:00:55,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 22:00:56,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:56,123 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:00:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:00:56,124 INFO L85 PathProgramCache]: Analyzing trace with hash 532037120, now seen corresponding path program 1 times [2022-07-20 22:00:56,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:00:56,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456111126] [2022-07-20 22:00:56,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:56,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:00:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:00:56,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:00:56,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456111126] [2022-07-20 22:00:56,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456111126] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:00:56,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975169287] [2022-07-20 22:00:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:56,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:56,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:00:56,443 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-20 22:00:56,445 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-20 22:00:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:56,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 22:00:56,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:00:56,514 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-20 22:00:56,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:00:56,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:00:56,711 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 36 treesize of output 23 [2022-07-20 22:00:56,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-20 22:00:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:00:56,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:00:56,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:00:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:00:56,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975169287] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:00:56,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:00:56,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-07-20 22:00:56,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848853003] [2022-07-20 22:00:56,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:00:56,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 22:00:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:00:56,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 22:00:56,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-07-20 22:00:56,965 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:00:57,200 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-07-20 22:00:57,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 22:00:57,200 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 22:00:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:00:57,201 INFO L225 Difference]: With dead ends: 66 [2022-07-20 22:00:57,201 INFO L226 Difference]: Without dead ends: 56 [2022-07-20 22:00:57,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-07-20 22:00:57,203 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:00:57,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-07-20 22:00:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-20 22:00:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2022-07-20 22:00:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-07-20 22:00:57,211 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 21 [2022-07-20 22:00:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:00:57,212 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-07-20 22:00:57,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-07-20 22:00:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 22:00:57,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:00:57,213 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-20 22:00:57,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 22:00:57,438 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,SelfDestructingSolverStorable3 [2022-07-20 22:00:57,439 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:00:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:00:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1912499326, now seen corresponding path program 2 times [2022-07-20 22:00:57,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:00:57,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452660645] [2022-07-20 22:00:57,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:00:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 22:00:57,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:00:57,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452660645] [2022-07-20 22:00:57,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452660645] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:00:57,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304652474] [2022-07-20 22:00:57,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:00:57,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:57,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:00:57,505 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-20 22:00:57,512 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-20 22:00:57,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:00:57,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:00:57,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 22:00:57,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:00:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 22:00:57,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:00:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 22:00:57,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304652474] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:00:57,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:00:57,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-07-20 22:00:57,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330100466] [2022-07-20 22:00:57,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:00:57,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 22:00:57,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:00:57,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 22:00:57,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:00:57,668 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:00:57,928 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-07-20 22:00:57,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 22:00:57,929 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 22:00:57,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:00:57,933 INFO L225 Difference]: With dead ends: 93 [2022-07-20 22:00:57,933 INFO L226 Difference]: Without dead ends: 55 [2022-07-20 22:00:57,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-07-20 22:00:57,937 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 161 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:00:57,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 82 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:00:57,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-20 22:00:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-07-20 22:00:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-07-20 22:00:57,956 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2022-07-20 22:00:57,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:00:57,956 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-07-20 22:00:57,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:57,957 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-07-20 22:00:57,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 22:00:57,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:00:57,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:00:57,987 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-20 22:00:58,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:58,184 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:00:58,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:00:58,184 INFO L85 PathProgramCache]: Analyzing trace with hash 550852762, now seen corresponding path program 1 times [2022-07-20 22:00:58,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:00:58,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992589657] [2022-07-20 22:00:58,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:00:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 22:00:58,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:00:58,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992589657] [2022-07-20 22:00:58,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992589657] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:00:58,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332048912] [2022-07-20 22:00:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:58,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:58,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:00:58,244 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-20 22:00:58,275 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-20 22:00:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:58,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 22:00:58,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:00:58,368 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-20 22:00:58,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:58,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-20 22:00:58,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 22:00:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 22:00:58,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:00:58,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-07-20 22:00:58,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-20 22:00:58,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:00:58,444 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 18 treesize of output 19 [2022-07-20 22:00:58,446 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 18 treesize of output 14 [2022-07-20 22:00:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2022-07-20 22:00:58,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332048912] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:00:58,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:00:58,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2022-07-20 22:00:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179455727] [2022-07-20 22:00:58,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:00:58,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:00:58,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:00:58,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:00:58,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-07-20 22:00:58,462 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:00:58,532 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-07-20 22:00:58,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:00:58,532 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 22:00:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:00:58,533 INFO L225 Difference]: With dead ends: 50 [2022-07-20 22:00:58,533 INFO L226 Difference]: Without dead ends: 40 [2022-07-20 22:00:58,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=79, Unknown=2, NotChecked=38, Total=156 [2022-07-20 22:00:58,536 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:00:58,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2022-07-20 22:00:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-20 22:00:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-20 22:00:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-07-20 22:00:58,548 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 28 [2022-07-20 22:00:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:00:58,549 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-07-20 22:00:58,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-07-20 22:00:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 22:00:58,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:00:58,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:00:58,576 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-20 22:00:58,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:58,771 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:00:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:00:58,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1969107172, now seen corresponding path program 3 times [2022-07-20 22:00:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:00:58,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795587344] [2022-07-20 22:00:58,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:58,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:00:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 22:00:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:00:59,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795587344] [2022-07-20 22:00:59,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795587344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:00:59,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975479450] [2022-07-20 22:00:59,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:00:59,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:59,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:00:59,508 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-20 22:00:59,518 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-20 22:00:59,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 22:00:59,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:00:59,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-20 22:00:59,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:00:59,599 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-20 22:00:59,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:59,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:00:59,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:59,710 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 22:00:59,710 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 22:00:59,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:00:59,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:59,898 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 22:00:59,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 41 [2022-07-20 22:01:00,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:01:00,022 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-20 22:01:00,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 48 [2022-07-20 22:01:00,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:01:00,307 INFO L356 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2022-07-20 22:01:00,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-07-20 22:01:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:01:00,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:01:03,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (let ((.cse1 (<= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (<= |v_ULTIMATE.start_main_~i~0#1_69| 0)) (.cse0 (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse6))))))) (and (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_69| 1) .cse0) .cse1 .cse2) (or .cse1 .cse2 (<= .cse0 2)))) (not (<= |v_ULTIMATE.start_main_~i~0#1_69| 1)))) is different from false [2022-07-20 22:01:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 22:01:38,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975479450] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:01:38,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:01:38,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 46 [2022-07-20 22:01:38,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517171580] [2022-07-20 22:01:38,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:01:38,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-20 22:01:38,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:01:38,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-20 22:01:38,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1693, Unknown=19, NotChecked=86, Total=2070 [2022-07-20 22:01:38,199 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:11,217 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-07-20 22:02:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 22:02:11,217 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 22:02:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:11,219 INFO L225 Difference]: With dead ends: 79 [2022-07-20 22:02:11,219 INFO L226 Difference]: Without dead ends: 64 [2022-07-20 22:02:11,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 70.7s TimeCoverageRelationStatistics Valid=473, Invalid=3039, Unknown=32, NotChecked=116, Total=3660 [2022-07-20 22:02:11,221 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:11,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 151 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 258 Unchecked, 0.1s Time] [2022-07-20 22:02:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-20 22:02:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-07-20 22:02:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-07-20 22:02:11,230 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 28 [2022-07-20 22:02:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:11,230 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-07-20 22:02:11,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-07-20 22:02:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 22:02:11,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:11,231 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] [2022-07-20 22:02:11,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:11,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:11,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:11,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1202810022, now seen corresponding path program 4 times [2022-07-20 22:02:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:02:11,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637696778] [2022-07-20 22:02:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:11,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:02:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 22:02:11,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:02:11,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637696778] [2022-07-20 22:02:11,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637696778] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:02:11,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982878171] [2022-07-20 22:02:11,533 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 22:02:11,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:11,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:02:11,534 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-20 22:02:11,536 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-20 22:02:11,596 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 22:02:11,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:02:11,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 22:02:11,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 22:02:11,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:02:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 22:02:11,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982878171] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:02:11,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:02:11,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-20 22:02:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345400186] [2022-07-20 22:02:11,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:02:11,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 22:02:11,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:02:11,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 22:02:11,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:02:11,695 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:11,871 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2022-07-20 22:02:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:02:11,871 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-20 22:02:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:11,872 INFO L225 Difference]: With dead ends: 142 [2022-07-20 22:02:11,872 INFO L226 Difference]: Without dead ends: 113 [2022-07-20 22:02:11,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:02:11,873 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 118 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:11,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 70 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:02:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-20 22:02:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 85. [2022-07-20 22:02:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2023809523809523) internal successors, (101), 84 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2022-07-20 22:02:11,891 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 30 [2022-07-20 22:02:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:11,892 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2022-07-20 22:02:11,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2022-07-20 22:02:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 22:02:11,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:11,894 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:11,919 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-20 22:02:12,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:12,116 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash -736332014, now seen corresponding path program 1 times [2022-07-20 22:02:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:02:12,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720538693] [2022-07-20 22:02:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:02:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:02:12,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:02:12,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720538693] [2022-07-20 22:02:12,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720538693] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:02:12,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110847232] [2022-07-20 22:02:12,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:12,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:12,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:02:12,701 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-20 22:02:12,701 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-20 22:02:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:12,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-20 22:02:12,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:12,775 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-20 22:02:12,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:12,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:02:12,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:12,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:12,879 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 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-20 22:02:12,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:12,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:12,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:12,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-20 22:02:13,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:13,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:13,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-07-20 22:02:13,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:13,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:13,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:13,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2022-07-20 22:02:13,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:13,307 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 40 treesize of output 27 [2022-07-20 22:02:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:02:13,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:02:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:02:14,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110847232] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:02:14,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:02:14,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 50 [2022-07-20 22:02:14,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146407386] [2022-07-20 22:02:14,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:02:14,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 22:02:14,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:02:14,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 22:02:14,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2182, Unknown=0, NotChecked=0, Total=2450 [2022-07-20 22:02:14,214 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 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-20 22:02:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:16,248 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-07-20 22:02:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-20 22:02:16,248 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 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-20 22:02:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:16,248 INFO L225 Difference]: With dead ends: 106 [2022-07-20 22:02:16,248 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 22:02:16,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=900, Invalid=5580, Unknown=0, NotChecked=0, Total=6480 [2022-07-20 22:02:16,250 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 87 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:16,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 227 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 436 Invalid, 0 Unknown, 113 Unchecked, 0.4s Time] [2022-07-20 22:02:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 22:02:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-07-20 22:02:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.186046511627907) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2022-07-20 22:02:16,263 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 32 [2022-07-20 22:02:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:16,263 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2022-07-20 22:02:16,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 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-20 22:02:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-07-20 22:02:16,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 22:02:16,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:16,265 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:16,286 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-20 22:02:16,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:16,480 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash -35267436, now seen corresponding path program 1 times [2022-07-20 22:02:16,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:02:16,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683049387] [2022-07-20 22:02:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:16,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:02:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 22:02:16,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:02:16,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683049387] [2022-07-20 22:02:16,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683049387] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:02:16,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672091189] [2022-07-20 22:02:16,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:16,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:16,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:02:16,538 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-20 22:02:16,550 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-20 22:02:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:16,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 22:02:16,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:16,640 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-20 22:02:16,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:16,661 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-20 22:02:16,667 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-20 22:02:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 22:02:16,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:02:16,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-07-20 22:02:16,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-20 22:02:16,692 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:02:16,693 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 18 treesize of output 19 [2022-07-20 22:02:16,695 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 18 treesize of output 14 [2022-07-20 22:02:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2022-07-20 22:02:16,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672091189] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:02:16,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:02:16,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2022-07-20 22:02:16,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716455713] [2022-07-20 22:02:16,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:02:16,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:02:16,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:02:16,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:02:16,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-07-20 22:02:16,706 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:16,777 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-07-20 22:02:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:02:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-20 22:02:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:16,778 INFO L225 Difference]: With dead ends: 101 [2022-07-20 22:02:16,778 INFO L226 Difference]: Without dead ends: 68 [2022-07-20 22:02:16,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=79, Unknown=2, NotChecked=38, Total=156 [2022-07-20 22:02:16,779 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:16,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2022-07-20 22:02:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-20 22:02:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-20 22:02:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 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-20 22:02:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-07-20 22:02:16,791 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 32 [2022-07-20 22:02:16,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:16,791 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-07-20 22:02:16,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-07-20 22:02:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 22:02:16,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:16,793 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:16,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:17,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-20 22:02:17,012 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash -767176616, now seen corresponding path program 5 times [2022-07-20 22:02:17,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:02:17,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410165518] [2022-07-20 22:02:17,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:17,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:02:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 22:02:17,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:02:17,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410165518] [2022-07-20 22:02:17,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410165518] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:02:17,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219393211] [2022-07-20 22:02:17,100 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 22:02:17,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:17,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:02:17,104 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:02:17,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 22:02:17,180 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-20 22:02:17,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:02:17,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 22:02:17,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 22:02:17,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:02:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 22:02:17,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219393211] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:02:17,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:02:17,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-20 22:02:17,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632308571] [2022-07-20 22:02:17,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:02:17,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 22:02:17,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:02:17,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 22:02:17,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:02:17,313 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:17,478 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-07-20 22:02:17,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 22:02:17,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-20 22:02:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:17,479 INFO L225 Difference]: With dead ends: 91 [2022-07-20 22:02:17,479 INFO L226 Difference]: Without dead ends: 74 [2022-07-20 22:02:17,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-20 22:02:17,480 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:17,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 65 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:02:17,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-20 22:02:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 41. [2022-07-20 22:02:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-07-20 22:02:17,486 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 32 [2022-07-20 22:02:17,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:17,487 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-07-20 22:02:17,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-07-20 22:02:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 22:02:17,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:17,496 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:17,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:17,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:17,697 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:17,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash -143226682, now seen corresponding path program 2 times [2022-07-20 22:02:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:02:17,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355420185] [2022-07-20 22:02:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:17,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:02:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 22:02:18,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:02:18,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355420185] [2022-07-20 22:02:18,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355420185] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:02:18,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819082930] [2022-07-20 22:02:18,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:02:18,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:18,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:02:18,059 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:02:18,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 22:02:18,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:02:18,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:02:18,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 22:02:18,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:18,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 22:02:18,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:18,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:02:18,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:18,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:02:18,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:18,277 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-20 22:02:18,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:18,293 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-20 22:02:18,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:18,307 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-20 22:02:18,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:18,368 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:02:18,368 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-07-20 22:02:18,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:18,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:02:18,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:18,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:02:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 22:02:18,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:02:20,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-07-20 22:02:26,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)))) is different from false [2022-07-20 22:02:28,426 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-20 22:02:30,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)) (= (select (store (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-20 22:02:30,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) is different from false [2022-07-20 22:02:30,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) is different from false [2022-07-20 22:02:30,174 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-20 22:02:30,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)) (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))))) is different from false [2022-07-20 22:02:30,242 INFO L356 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2022-07-20 22:02:30,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 73 [2022-07-20 22:02:30,248 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 78 treesize of output 72 [2022-07-20 22:02:30,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:30,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:30,254 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 9 [2022-07-20 22:02:30,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:02:30,262 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 174 treesize of output 176 [2022-07-20 22:02:30,326 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 22 not checked. [2022-07-20 22:02:30,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819082930] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:02:30,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:02:30,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 17] total 42 [2022-07-20 22:02:30,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558230792] [2022-07-20 22:02:30,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:02:30,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-20 22:02:30,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:02:30,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-20 22:02:30,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=945, Unknown=21, NotChecked=568, Total=1722 [2022-07-20 22:02:30,329 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 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-20 22:02:32,355 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)) (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))))) (or (= (select .cse0 0) 0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-20 22:02:34,384 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (or (= (select .cse1 0) 0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-20 22:02:37,665 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)) is different from false [2022-07-20 22:02:39,723 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-20 22:02:41,779 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-20 22:02:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:42,050 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-07-20 22:02:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-20 22:02:42,050 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 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 35 [2022-07-20 22:02:42,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:42,051 INFO L225 Difference]: With dead ends: 80 [2022-07-20 22:02:42,051 INFO L226 Difference]: Without dead ends: 78 [2022-07-20 22:02:42,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=463, Invalid=2317, Unknown=28, NotChecked=1482, Total=4290 [2022-07-20 22:02:42,052 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 75 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:42,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 216 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 347 Invalid, 0 Unknown, 422 Unchecked, 0.2s Time] [2022-07-20 22:02:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-20 22:02:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2022-07-20 22:02:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-20 22:02:42,060 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 35 [2022-07-20 22:02:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:42,061 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-20 22:02:42,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 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-20 22:02:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-20 22:02:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 22:02:42,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:42,062 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:42,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:42,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-20 22:02:42,272 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1123059706, now seen corresponding path program 2 times [2022-07-20 22:02:42,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:02:42,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610259040] [2022-07-20 22:02:42,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:42,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:02:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 22:02:42,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:02:42,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610259040] [2022-07-20 22:02:42,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610259040] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:02:42,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144081810] [2022-07-20 22:02:42,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:02:42,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:42,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:02:42,328 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:02:42,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 22:02:42,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:02:42,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:02:42,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 22:02:42,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:42,467 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-20 22:02:42,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:42,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-20 22:02:42,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:42,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-20 22:02:42,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 22:02:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 22:02:42,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:02:42,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) is different from false [2022-07-20 22:02:42,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-20 22:02:42,546 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-20 22:02:42,559 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:02:42,559 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 18 treesize of output 19 [2022-07-20 22:02:42,561 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 18 treesize of output 14 [2022-07-20 22:02:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 12 not checked. [2022-07-20 22:02:42,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144081810] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:02:42,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:02:42,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 8] total 16 [2022-07-20 22:02:42,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421879036] [2022-07-20 22:02:42,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:02:42,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 22:02:42,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:02:42,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 22:02:42,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=119, Unknown=3, NotChecked=72, Total=240 [2022-07-20 22:02:42,583 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:42,935 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-07-20 22:02:42,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 22:02:42,940 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-20 22:02:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:42,941 INFO L225 Difference]: With dead ends: 116 [2022-07-20 22:02:42,941 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 22:02:42,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=342, Unknown=3, NotChecked=126, Total=600 [2022-07-20 22:02:42,943 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 110 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:42,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 170 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 311 Invalid, 0 Unknown, 205 Unchecked, 0.2s Time] [2022-07-20 22:02:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 22:02:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 52. [2022-07-20 22:02:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-20 22:02:42,955 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-07-20 22:02:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:42,956 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-20 22:02:42,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-20 22:02:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 22:02:42,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:42,957 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:42,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:43,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-20 22:02:43,171 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:43,172 INFO L85 PathProgramCache]: Analyzing trace with hash 651947656, now seen corresponding path program 6 times [2022-07-20 22:02:43,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:02:43,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298681543] [2022-07-20 22:02:43,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:43,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:02:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 22:02:44,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:02:44,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298681543] [2022-07-20 22:02:44,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298681543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:02:44,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324609530] [2022-07-20 22:02:44,056 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 22:02:44,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:44,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:02:44,058 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:02:44,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 22:02:44,143 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-20 22:02:44,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:02:44,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-20 22:02:44,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:44,153 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-20 22:02:44,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:02:44,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,268 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 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-20 22:02:44,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-07-20 22:02:44,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:44,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-20 22:02:44,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,663 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-20 22:02:44,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 60 [2022-07-20 22:02:44,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:44,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:44,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2022-07-20 22:02:44,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:44,996 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 63 treesize of output 55 [2022-07-20 22:02:45,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:45,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:45,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:45,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 25 [2022-07-20 22:02:45,082 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-20 22:02:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 22:02:45,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:02:45,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-20 22:02:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 11 refuted. 2 times theorem prover too weak. 2 trivial. 7 not checked. [2022-07-20 22:02:52,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324609530] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:02:52,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:02:52,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 18] total 53 [2022-07-20 22:02:52,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372592540] [2022-07-20 22:02:52,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:02:52,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-20 22:02:52,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:02:52,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-20 22:02:52,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2347, Unknown=11, NotChecked=100, Total=2756 [2022-07-20 22:02:52,271 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:53,078 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) is different from false [2022-07-20 22:02:53,144 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)))) is different from false [2022-07-20 22:02:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:53,251 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2022-07-20 22:02:53,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 22:02:53,251 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-20 22:02:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:53,252 INFO L225 Difference]: With dead ends: 90 [2022-07-20 22:02:53,252 INFO L226 Difference]: Without dead ends: 72 [2022-07-20 22:02:53,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=454, Invalid=3705, Unknown=13, NotChecked=384, Total=4556 [2022-07-20 22:02:53,254 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:53,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 165 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 249 Invalid, 0 Unknown, 135 Unchecked, 0.1s Time] [2022-07-20 22:02:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-20 22:02:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-07-20 22:02:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 68 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-07-20 22:02:53,265 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 35 [2022-07-20 22:02:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:53,266 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-20 22:02:53,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:53,266 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-07-20 22:02:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 22:02:53,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:53,267 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:53,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:53,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-20 22:02:53,480 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:53,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1015472054, now seen corresponding path program 7 times [2022-07-20 22:02:53,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:02:53,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389637230] [2022-07-20 22:02:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:53,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:02:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 22:02:53,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:02:53,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389637230] [2022-07-20 22:02:53,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389637230] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:02:53,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262435535] [2022-07-20 22:02:53,547 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 22:02:53,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:53,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:02:53,549 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:02:53,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 22:02:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:53,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:02:53,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 22:02:53,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:02:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 22:02:53,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262435535] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:02:53,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:02:53,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-20 22:02:53,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062373590] [2022-07-20 22:02:53,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:02:53,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 22:02:53,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:02:53,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 22:02:53,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:02:53,738 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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-20 22:02:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:54,027 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2022-07-20 22:02:54,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 22:02:54,028 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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 37 [2022-07-20 22:02:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:54,028 INFO L225 Difference]: With dead ends: 173 [2022-07-20 22:02:54,028 INFO L226 Difference]: Without dead ends: 141 [2022-07-20 22:02:54,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-20 22:02:54,029 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 138 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:54,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 192 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 22:02:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-20 22:02:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 85. [2022-07-20 22:02:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 84 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2022-07-20 22:02:54,043 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 37 [2022-07-20 22:02:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:54,043 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2022-07-20 22:02:54,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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-20 22:02:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2022-07-20 22:02:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 22:02:54,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:54,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:54,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:54,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-20 22:02:54,260 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:54,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:54,260 INFO L85 PathProgramCache]: Analyzing trace with hash -590527364, now seen corresponding path program 2 times [2022-07-20 22:02:54,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:02:54,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697327272] [2022-07-20 22:02:54,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:54,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:02:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:02:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:02:54,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697327272] [2022-07-20 22:02:54,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697327272] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:02:54,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597581248] [2022-07-20 22:02:54,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:02:54,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:54,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:02:54,888 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:02:54,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 22:02:54,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:02:54,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:02:54,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-20 22:02:54,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:54,965 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-20 22:02:54,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:54,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:02:55,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,057 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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 22:02:55,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-07-20 22:02:55,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:55,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-20 22:02:55,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:55,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-07-20 22:02:55,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 55 [2022-07-20 22:02:55,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:55,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2022-07-20 22:02:55,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:55,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2022-07-20 22:02:55,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:55,824 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-20 22:02:55,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-07-20 22:02:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:02:56,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:02:58,179 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) is different from false [2022-07-20 22:02:58,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)))) is different from false [2022-07-20 22:02:59,227 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_216|)) (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-07-20 22:03:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-20 22:03:07,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597581248] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:03:07,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:03:07,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 23] total 67 [2022-07-20 22:03:07,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617826048] [2022-07-20 22:03:07,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:03:07,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-20 22:03:07,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:03:07,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-20 22:03:07,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=3519, Unknown=12, NotChecked=378, Total=4422 [2022-07-20 22:03:07,870 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 67 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 67 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:03:15,741 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (= (select .cse0 .cse1) 0))) (and (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (or (not (= .cse1 4)) .cse2) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|))) .cse2 (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)))) is different from false [2022-07-20 22:03:16,198 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse2 4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 1))) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-20 22:03:18,256 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse0 4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-20 22:03:58,701 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-20 22:04:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:04:00,285 INFO L93 Difference]: Finished difference Result 147 states and 171 transitions. [2022-07-20 22:04:00,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-07-20 22:04:00,286 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 67 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 22:04:00,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:04:00,287 INFO L225 Difference]: With dead ends: 147 [2022-07-20 22:04:00,287 INFO L226 Difference]: Without dead ends: 145 [2022-07-20 22:04:00,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 2763 ImplicationChecksByTransitivity, 64.8s TimeCoverageRelationStatistics Valid=1197, Invalid=7127, Unknown=76, NotChecked=1302, Total=9702 [2022-07-20 22:04:00,290 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 75 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 515 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:04:00,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 258 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 278 Invalid, 0 Unknown, 515 Unchecked, 0.2s Time] [2022-07-20 22:04:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-20 22:04:00,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 101. [2022-07-20 22:04:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.19) internal successors, (119), 100 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:04:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2022-07-20 22:04:00,303 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 39 [2022-07-20 22:04:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:04:00,303 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2022-07-20 22:04:00,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 67 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:04:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2022-07-20 22:04:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 22:04:00,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:04:00,304 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:04:00,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 22:04:00,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:04:00,509 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:04:00,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:04:00,509 INFO L85 PathProgramCache]: Analyzing trace with hash 110537214, now seen corresponding path program 2 times [2022-07-20 22:04:00,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:04:00,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905865191] [2022-07-20 22:04:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:04:00,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:04:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:04:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 22:04:00,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:04:00,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905865191] [2022-07-20 22:04:00,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905865191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:04:00,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909436216] [2022-07-20 22:04:00,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:04:00,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:04:00,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:04:00,572 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:04:00,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 22:04:00,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:04:00,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:04:00,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 22:04:00,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:04:00,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:04:00,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:00,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:04:00,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:00,748 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-20 22:04:00,761 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-20 22:04:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:04:00,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:04:00,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-20 22:04:00,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-07-20 22:04:00,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-20 22:04:00,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:04:00,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-20 22:04:00,795 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 18 treesize of output 14 [2022-07-20 22:04:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 12 not checked. [2022-07-20 22:04:00,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909436216] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:04:00,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:04:00,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 8] total 16 [2022-07-20 22:04:00,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094455807] [2022-07-20 22:04:00,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:04:00,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 22:04:00,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:04:00,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 22:04:00,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=119, Unknown=3, NotChecked=72, Total=240 [2022-07-20 22:04:00,810 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:04:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:04:01,173 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-07-20 22:04:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 22:04:01,173 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 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 39 [2022-07-20 22:04:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:04:01,174 INFO L225 Difference]: With dead ends: 150 [2022-07-20 22:04:01,174 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 22:04:01,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=342, Unknown=3, NotChecked=126, Total=600 [2022-07-20 22:04:01,175 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 83 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:04:01,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 163 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 315 Invalid, 0 Unknown, 218 Unchecked, 0.2s Time] [2022-07-20 22:04:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 22:04:01,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 96. [2022-07-20 22:04:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 95 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:04:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2022-07-20 22:04:01,191 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 39 [2022-07-20 22:04:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:04:01,191 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2022-07-20 22:04:01,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:04:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-07-20 22:04:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 22:04:01,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:04:01,192 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:04:01,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 22:04:01,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-20 22:04:01,400 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:04:01,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:04:01,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1487374188, now seen corresponding path program 8 times [2022-07-20 22:04:01,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:04:01,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468286678] [2022-07-20 22:04:01,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:04:01,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:04:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:04:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 22:04:02,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:04:02,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468286678] [2022-07-20 22:04:02,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468286678] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:04:02,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078198721] [2022-07-20 22:04:02,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:04:02,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:04:02,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:04:02,787 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:04:02,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 22:04:02,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:04:02,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:04:02,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-20 22:04:02,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:04:02,869 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-20 22:04:02,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:02,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:04:02,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:02,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:02,968 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 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-20 22:04:03,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-20 22:04:03,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-07-20 22:04:03,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:04:03,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-07-20 22:04:03,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:04:03,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-07-20 22:04:03,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:04:03,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 68 [2022-07-20 22:04:03,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-07-20 22:04:03,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:03,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 23 [2022-07-20 22:04:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 22:04:03,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:04:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 22:04:06,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078198721] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:04:06,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:04:06,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 60 [2022-07-20 22:04:06,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312836255] [2022-07-20 22:04:06,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:04:06,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-20 22:04:06,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:04:06,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-20 22:04:06,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3268, Unknown=0, NotChecked=0, Total=3540 [2022-07-20 22:04:06,698 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 60 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:04:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:04:09,074 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-07-20 22:04:09,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 22:04:09,075 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 22:04:09,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:04:09,076 INFO L225 Difference]: With dead ends: 132 [2022-07-20 22:04:09,076 INFO L226 Difference]: Without dead ends: 114 [2022-07-20 22:04:09,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=332, Invalid=4090, Unknown=0, NotChecked=0, Total=4422 [2022-07-20 22:04:09,077 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 22:04:09,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 243 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1280 Invalid, 0 Unknown, 26 Unchecked, 1.8s Time] [2022-07-20 22:04:09,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-20 22:04:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-07-20 22:04:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.1333333333333333) internal successors, (119), 105 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:04:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-07-20 22:04:09,095 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 42 [2022-07-20 22:04:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:04:09,095 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-07-20 22:04:09,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:04:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-07-20 22:04:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 22:04:09,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:04:09,096 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:04:09,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 22:04:09,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-20 22:04:09,311 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:04:09,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:04:09,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2085827890, now seen corresponding path program 3 times [2022-07-20 22:04:09,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:04:09,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998687023] [2022-07-20 22:04:09,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:04:09,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:04:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:04:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:04:09,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:04:09,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998687023] [2022-07-20 22:04:09,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998687023] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:04:09,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828764581] [2022-07-20 22:04:09,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:04:09,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:04:09,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:04:09,894 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:04:09,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 22:04:09,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 22:04:09,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:04:09,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-20 22:04:09,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:04:10,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 22:04:10,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:10,116 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 18 treesize of output 20 [2022-07-20 22:04:10,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:10,165 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 18 treesize of output 20 [2022-07-20 22:04:10,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:04:10,212 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 18 treesize of output 20 [2022-07-20 22:04:10,366 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-20 22:04:10,366 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 27 treesize of output 34 [2022-07-20 22:04:10,449 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-20 22:04:10,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2022-07-20 22:04:10,620 INFO L356 Elim1Store]: treesize reduction 34, result has 48.5 percent of original size [2022-07-20 22:04:10,620 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 52 [2022-07-20 22:04:11,211 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-20 22:04:11,212 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 48 treesize of output 27 [2022-07-20 22:04:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 22:04:11,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:04:54,488 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_282| Int)) (or (forall ((v_ArrVal_880 Int) (|v_ULTIMATE.start_main_~i~0#1_276| Int) (|v_ULTIMATE.start_main_~i~0#1_281| Int) (v_ArrVal_879 Int)) (or (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_281|) c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_276| 1)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_281| 1) c_~N~0)) (< |v_ULTIMATE.start_main_~i~0#1_276| 1) (= (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_281| 4))) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_282| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_879)) (.cse2 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_880) .cse2 (+ (- 1) (select .cse0 .cse2))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_276| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (not (<= |v_ULTIMATE.start_main_~i~0#1_282| 0)))) is different from false