./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/sina2.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 1ea1eb4a8af9eb0da04a9f2b25d1b98ecd98ff3b6d87ba0d8e53000f12b8adcc --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:57:04,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:57:04,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:57:04,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:57:04,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:57:04,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:57:04,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:57:04,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:57:04,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:57:04,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:57:04,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:57:04,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:57:04,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:57:04,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:57:04,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:57:04,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:57:04,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:57:04,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:57:04,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:57:04,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:57:04,669 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:57:04,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:57:04,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:57:04,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:57:04,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:57:04,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:57:04,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:57:04,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:57:04,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:57:04,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:57:04,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:57:04,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:57:04,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:57:04,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:57:04,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:57:04,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:57:04,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:57:04,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:57:04,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:57:04,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:57:04,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:57:04,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:57:04,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:57:04,703 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:57:04,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:57:04,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:57:04,705 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:57:04,705 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:57:04,705 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:57:04,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:57:04,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:57:04,706 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:57:04,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:57:04,707 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:57:04,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:57:04,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:57:04,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:57:04,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:57:04,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:57:04,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:57:04,708 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:57:04,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:57:04,708 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:57:04,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:57:04,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:57:04,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:57:04,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:57:04,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:57:04,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:57:04,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:57:04,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:57:04,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:57:04,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:57:04,711 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:57:04,711 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:57:04,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:57:04,711 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 -> 1ea1eb4a8af9eb0da04a9f2b25d1b98ecd98ff3b6d87ba0d8e53000f12b8adcc [2022-07-22 10:57:04,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:57:04,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:57:04,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:57:04,887 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:57:04,887 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:57:04,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina2.c [2022-07-22 10:57:04,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628fc3169/6e5b9744f83d41f085550a1dee8f9648/FLAGec0c172b2 [2022-07-22 10:57:05,274 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:57:05,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina2.c [2022-07-22 10:57:05,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628fc3169/6e5b9744f83d41f085550a1dee8f9648/FLAGec0c172b2 [2022-07-22 10:57:05,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628fc3169/6e5b9744f83d41f085550a1dee8f9648 [2022-07-22 10:57:05,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:57:05,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:57:05,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:57:05,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:57:05,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:57:05,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:57:05" (1/1) ... [2022-07-22 10:57:05,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4436c23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05, skipping insertion in model container [2022-07-22 10:57:05,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:57:05" (1/1) ... [2022-07-22 10:57:05,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:57:05,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:57:05,438 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/sina2.c[588,601] [2022-07-22 10:57:05,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:57:05,467 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:57:05,476 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/sina2.c[588,601] [2022-07-22 10:57:05,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:57:05,501 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:57:05,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05 WrapperNode [2022-07-22 10:57:05,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:57:05,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:57:05,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:57:05,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:57:05,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05" (1/1) ... [2022-07-22 10:57:05,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05" (1/1) ... [2022-07-22 10:57:05,538 INFO L137 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2022-07-22 10:57:05,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:57:05,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:57:05,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:57:05,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:57:05,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05" (1/1) ... [2022-07-22 10:57:05,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05" (1/1) ... [2022-07-22 10:57:05,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05" (1/1) ... [2022-07-22 10:57:05,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05" (1/1) ... [2022-07-22 10:57:05,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05" (1/1) ... [2022-07-22 10:57:05,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05" (1/1) ... [2022-07-22 10:57:05,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05" (1/1) ... [2022-07-22 10:57:05,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:57:05,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:57:05,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:57:05,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:57:05,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05" (1/1) ... [2022-07-22 10:57:05,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:57:05,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:05,600 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-22 10:57:05,632 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-22 10:57:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:57:05,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:57:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 10:57:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:57:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:57:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:57:05,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:57:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:57:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 10:57:05,694 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:57:05,695 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:57:05,880 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:57:05,884 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:57:05,884 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 10:57:05,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:57:05 BoogieIcfgContainer [2022-07-22 10:57:05,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:57:05,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:57:05,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:57:05,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:57:05,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:57:05" (1/3) ... [2022-07-22 10:57:05,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41133c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:57:05, skipping insertion in model container [2022-07-22 10:57:05,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:05" (2/3) ... [2022-07-22 10:57:05,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41133c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:57:05, skipping insertion in model container [2022-07-22 10:57:05,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:57:05" (3/3) ... [2022-07-22 10:57:05,892 INFO L111 eAbstractionObserver]: Analyzing ICFG sina2.c [2022-07-22 10:57:05,901 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:57:05,902 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:57:05,931 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:57:05,936 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@71d16e6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@139007c [2022-07-22 10:57:05,936 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:57:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 10:57:05,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:05,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:05,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:05,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash -592971038, now seen corresponding path program 1 times [2022-07-22 10:57:05,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:05,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679857159] [2022-07-22 10:57:05,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:05,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:06,070 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-22 10:57:06,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:06,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679857159] [2022-07-22 10:57:06,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679857159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:57:06,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:57:06,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:57:06,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818267159] [2022-07-22 10:57:06,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:57:06,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:57:06,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:06,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:57:06,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:57:06,104 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-22 10:57:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:06,120 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-07-22 10:57:06,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:57:06,122 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-22 10:57:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:06,127 INFO L225 Difference]: With dead ends: 44 [2022-07-22 10:57:06,127 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 10:57:06,129 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-22 10:57:06,134 INFO L413 NwaCegarLoop]: 28 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, 28 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-22 10:57:06,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:57:06,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 10:57:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 10:57:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-22 10:57:06,156 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-07-22 10:57:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:06,157 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-22 10:57:06,157 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-22 10:57:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-22 10:57:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 10:57:06,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:06,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:06,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:57:06,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:06,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash 108093540, now seen corresponding path program 1 times [2022-07-22 10:57:06,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:06,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665201749] [2022-07-22 10:57:06,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:06,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:06,268 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-22 10:57:06,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:06,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665201749] [2022-07-22 10:57:06,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665201749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:57:06,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:57:06,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:57:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086361233] [2022-07-22 10:57:06,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:57:06,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:57:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:06,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:57:06,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:57:06,270 INFO L87 Difference]: Start difference. First operand 20 states and 23 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-22 10:57:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:06,315 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-22 10:57:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:57:06,315 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-22 10:57:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:06,316 INFO L225 Difference]: With dead ends: 45 [2022-07-22 10:57:06,316 INFO L226 Difference]: Without dead ends: 32 [2022-07-22 10:57:06,317 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-22 10:57:06,317 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:06,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 16 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:57:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-22 10:57:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-07-22 10:57:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-07-22 10:57:06,322 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2022-07-22 10:57:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:06,322 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-22 10:57:06,323 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-22 10:57:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-07-22 10:57:06,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 10:57:06,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:06,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:06,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:57:06,324 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:06,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:06,324 INFO L85 PathProgramCache]: Analyzing trace with hash 615941150, now seen corresponding path program 1 times [2022-07-22 10:57:06,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:06,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132475123] [2022-07-22 10:57:06,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:06,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:06,833 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-22 10:57:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:06,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132475123] [2022-07-22 10:57:06,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132475123] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:06,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429427609] [2022-07-22 10:57:06,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:06,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:06,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:06,837 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-22 10:57:06,842 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-22 10:57:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:06,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 10:57:06,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:06,967 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-22 10:57:06,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:57:06,998 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-22 10:57:07,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-22 10:57:07,195 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-22 10:57:07,354 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 51 treesize of output 31 [2022-07-22 10:57:07,376 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-22 10:57:07,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:07,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:07,630 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-22 10:57:07,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429427609] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:07,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:07,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 28 [2022-07-22 10:57:07,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85405262] [2022-07-22 10:57:07,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:07,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-22 10:57:07,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:07,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 10:57:07,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2022-07-22 10:57:07,636 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 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-22 10:57:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:07,851 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-07-22 10:57:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 10:57:07,852 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 10:57:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:07,854 INFO L225 Difference]: With dead ends: 45 [2022-07-22 10:57:07,854 INFO L226 Difference]: Without dead ends: 43 [2022-07-22 10:57:07,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-07-22 10:57:07,857 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:07,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 86 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 210 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2022-07-22 10:57:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-22 10:57:07,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2022-07-22 10:57:07,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 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-22 10:57:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-22 10:57:07,865 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 20 [2022-07-22 10:57:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:07,867 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-22 10:57:07,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 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-22 10:57:07,867 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-07-22 10:57:07,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 10:57:07,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:07,868 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] [2022-07-22 10:57:07,887 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-22 10:57:08,083 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-22 10:57:08,084 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash 859342364, now seen corresponding path program 2 times [2022-07-22 10:57:08,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:08,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578422156] [2022-07-22 10:57:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:08,138 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-22 10:57:08,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:08,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578422156] [2022-07-22 10:57:08,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578422156] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:08,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293892170] [2022-07-22 10:57:08,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:57:08,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:08,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:08,142 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-22 10:57:08,167 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-22 10:57:08,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:57:08,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:57:08,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:57:08,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:57:08,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:08,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:57:08,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293892170] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:08,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:08,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:57:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004139226] [2022-07-22 10:57:08,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:08,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:57:08,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:08,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:57:08,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:57:08,268 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:08,362 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-07-22 10:57:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:57:08,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-22 10:57:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:08,363 INFO L225 Difference]: With dead ends: 81 [2022-07-22 10:57:08,363 INFO L226 Difference]: Without dead ends: 54 [2022-07-22 10:57:08,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-22 10:57:08,364 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:08,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 61 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:57:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-22 10:57:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2022-07-22 10:57:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 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-22 10:57:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-22 10:57:08,374 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2022-07-22 10:57:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:08,375 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-22 10:57:08,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-07-22 10:57:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 10:57:08,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:08,376 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] [2022-07-22 10:57:08,392 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-22 10:57:08,589 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-22 10:57:08,589 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:08,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash 803751580, now seen corresponding path program 3 times [2022-07-22 10:57:08,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:08,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181853200] [2022-07-22 10:57:08,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:08,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:57:08,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:08,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181853200] [2022-07-22 10:57:08,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181853200] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:08,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888591125] [2022-07-22 10:57:08,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:57:08,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:08,648 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-22 10:57:08,649 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-22 10:57:08,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 10:57:08,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:57:08,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:57:08,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:08,725 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-22 10:57:08,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:08,767 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-22 10:57:08,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888591125] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:08,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:08,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:57:08,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429170574] [2022-07-22 10:57:08,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:08,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:57:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:08,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:57:08,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:57:08,769 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:08,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:08,852 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-07-22 10:57:08,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:57:08,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-22 10:57:08,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:08,854 INFO L225 Difference]: With dead ends: 52 [2022-07-22 10:57:08,854 INFO L226 Difference]: Without dead ends: 43 [2022-07-22 10:57:08,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-22 10:57:08,855 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:08,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 45 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:57:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-22 10:57:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2022-07-22 10:57:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-07-22 10:57:08,858 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2022-07-22 10:57:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:08,859 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-22 10:57:08,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-07-22 10:57:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 10:57:08,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:08,859 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] [2022-07-22 10:57:08,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-22 10:57:09,078 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-22 10:57:09,078 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1304966232, now seen corresponding path program 4 times [2022-07-22 10:57:09,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:09,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870186855] [2022-07-22 10:57:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:09,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870186855] [2022-07-22 10:57:09,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870186855] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:09,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244044328] [2022-07-22 10:57:09,666 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:57:09,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:09,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:09,667 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-22 10:57:09,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 10:57:09,706 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:57:09,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:57:09,708 WARN L261 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-22 10:57:09,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:09,720 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-22 10:57:09,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:09,746 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-22 10:57:09,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:09,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:09,810 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-22 10:57:09,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:09,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:09,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:09,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-22 10:57:10,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:10,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:10,050 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 49 treesize of output 37 [2022-07-22 10:57:10,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:10,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:10,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:10,165 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 55 treesize of output 41 [2022-07-22 10:57:10,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:10,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:10,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:10,281 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-22 10:57:10,281 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-22 10:57:10,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:10,397 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 45 treesize of output 29 [2022-07-22 10:57:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:10,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:12,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (or (forall ((v_ArrVal_160 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_160) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_57|)))) is different from false [2022-07-22 10:57:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-22 10:57:24,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244044328] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:24,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:24,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 51 [2022-07-22 10:57:24,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440097605] [2022-07-22 10:57:24,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:24,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-22 10:57:24,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:24,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-22 10:57:24,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2189, Unknown=19, NotChecked=96, Total=2550 [2022-07-22 10:57:24,298 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 51 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:27,935 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse8 (= (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8)) 0)) (.cse11 (select .cse0 0))) (let ((.cse6 (+ c_~N~0 1)) (.cse3 (= .cse11 1)) (.cse1 (+ c_~N~0 .cse11)) (.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (not .cse8)) (.cse7 (select .cse0 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (<= c_~N~0 2) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (or (let ((.cse2 (+ .cse4 1))) (and (<= .cse1 .cse2) .cse3 (<= .cse2 .cse1))) .cse5) (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) (<= .cse6 .cse7) (forall ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (or (forall ((v_ArrVal_160 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_160) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_57|)))) (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse7 .cse6) (or (and (<= 2 c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) .cse8) (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|) 2) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|))) (or (let ((.cse9 (+ .cse4 2))) (and (= .cse7 1) .cse3 (<= .cse1 .cse9) (<= .cse9 .cse1))) .cse5) (= (+ (- 2) .cse7) 1))))) is different from false [2022-07-22 10:57:29,983 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ (- 2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= c_~N~0 2) (forall ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (or (forall ((v_ArrVal_160 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_160) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_57|)))) (< 1 c_~N~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|) 2) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-22 10:57:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:30,097 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-07-22 10:57:30,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-22 10:57:30,097 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-22 10:57:30,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:30,098 INFO L225 Difference]: With dead ends: 58 [2022-07-22 10:57:30,098 INFO L226 Difference]: Without dead ends: 56 [2022-07-22 10:57:30,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=311, Invalid=2869, Unknown=24, NotChecked=336, Total=3540 [2022-07-22 10:57:30,101 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:30,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 148 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 286 Invalid, 0 Unknown, 360 Unchecked, 0.2s Time] [2022-07-22 10:57:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-22 10:57:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2022-07-22 10:57:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 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-22 10:57:30,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-07-22 10:57:30,106 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 26 [2022-07-22 10:57:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:30,106 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-07-22 10:57:30,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-07-22 10:57:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 10:57:30,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:30,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:30,124 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-22 10:57:30,324 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-22 10:57:30,324 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:30,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:30,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1135931414, now seen corresponding path program 5 times [2022-07-22 10:57:30,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:30,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3905299] [2022-07-22 10:57:30,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:30,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:30,390 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:57:30,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:30,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3905299] [2022-07-22 10:57:30,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3905299] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:30,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693352567] [2022-07-22 10:57:30,391 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:57:30,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:30,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:30,393 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-22 10:57:30,395 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-22 10:57:30,446 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 10:57:30,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:57:30,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:57:30,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:57:30,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:57:30,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693352567] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:30,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:30,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:57:30,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267417901] [2022-07-22 10:57:30,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:30,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:57:30,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:30,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:57:30,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:57:30,534 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:30,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:30,645 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-07-22 10:57:30,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 10:57:30,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 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-22 10:57:30,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:30,646 INFO L225 Difference]: With dead ends: 112 [2022-07-22 10:57:30,646 INFO L226 Difference]: Without dead ends: 89 [2022-07-22 10:57:30,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 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-22 10:57:30,647 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:30,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 72 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:57:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-22 10:57:30,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2022-07-22 10:57:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-07-22 10:57:30,654 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 28 [2022-07-22 10:57:30,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:30,654 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-07-22 10:57:30,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-07-22 10:57:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 10:57:30,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:30,655 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:30,677 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-22 10:57:30,867 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-22 10:57:30,868 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:30,868 INFO L85 PathProgramCache]: Analyzing trace with hash -227434410, now seen corresponding path program 6 times [2022-07-22 10:57:30,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:30,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872476514] [2022-07-22 10:57:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:30,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:57:30,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:30,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872476514] [2022-07-22 10:57:30,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872476514] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:30,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593635981] [2022-07-22 10:57:30,926 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:57:30,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:30,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:30,927 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-22 10:57:30,928 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-22 10:57:30,976 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-22 10:57:30,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:57:30,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:57:30,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:57:31,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:57:31,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593635981] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:31,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:31,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:57:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206184438] [2022-07-22 10:57:31,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:31,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:57:31,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:57:31,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:57:31,052 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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-22 10:57:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:31,201 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-07-22 10:57:31,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 10:57:31,202 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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 28 [2022-07-22 10:57:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:31,202 INFO L225 Difference]: With dead ends: 91 [2022-07-22 10:57:31,202 INFO L226 Difference]: Without dead ends: 76 [2022-07-22 10:57:31,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 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-22 10:57:31,203 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 108 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:31,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 105 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:57:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-22 10:57:31,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2022-07-22 10:57:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 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-22 10:57:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-07-22 10:57:31,223 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 28 [2022-07-22 10:57:31,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:31,223 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-07-22 10:57:31,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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-22 10:57:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-07-22 10:57:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 10:57:31,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:31,224 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] [2022-07-22 10:57:31,253 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-22 10:57:31,439 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-22 10:57:31,439 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:31,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:31,440 INFO L85 PathProgramCache]: Analyzing trace with hash 341343694, now seen corresponding path program 1 times [2022-07-22 10:57:31,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:31,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392309105] [2022-07-22 10:57:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:31,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:32,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392309105] [2022-07-22 10:57:32,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392309105] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:32,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210314672] [2022-07-22 10:57:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:32,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:32,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:32,024 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-22 10:57:32,024 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-22 10:57:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:32,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-22 10:57:32,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:32,083 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-22 10:57:32,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,119 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-22 10:57:32,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,180 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-22 10:57:32,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:32,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,323 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-22 10:57:32,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,422 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-22 10:57:32,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:32,532 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 45 treesize of output 39 [2022-07-22 10:57:32,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,609 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 42 treesize of output 25 [2022-07-22 10:57:32,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,803 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 51 treesize of output 31 [2022-07-22 10:57:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:32,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:34,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210314672] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:34,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:34,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 53 [2022-07-22 10:57:34,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706145231] [2022-07-22 10:57:34,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:34,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-22 10:57:34,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:34,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-22 10:57:34,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2487, Unknown=0, NotChecked=0, Total=2756 [2022-07-22 10:57:34,175 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:35,067 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-07-22 10:57:35,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 10:57:35,067 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-22 10:57:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:35,068 INFO L225 Difference]: With dead ends: 57 [2022-07-22 10:57:35,068 INFO L226 Difference]: Without dead ends: 36 [2022-07-22 10:57:35,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=340, Invalid=3200, Unknown=0, NotChecked=0, Total=3540 [2022-07-22 10:57:35,069 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:35,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 154 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 246 Invalid, 0 Unknown, 212 Unchecked, 0.1s Time] [2022-07-22 10:57:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-22 10:57:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-07-22 10:57:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-22 10:57:35,077 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 30 [2022-07-22 10:57:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:35,078 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-22 10:57:35,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-22 10:57:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 10:57:35,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:35,080 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:35,098 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-22 10:57:35,296 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-22 10:57:35,299 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:35,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:35,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1505554158, now seen corresponding path program 7 times [2022-07-22 10:57:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:35,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183410064] [2022-07-22 10:57:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:35,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:36,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183410064] [2022-07-22 10:57:36,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183410064] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:36,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034543124] [2022-07-22 10:57:36,203 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 10:57:36,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:36,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:36,204 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-22 10:57:36,208 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-22 10:57:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:36,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-22 10:57:36,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:36,264 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-22 10:57:36,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-22 10:57:36,272 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-22 10:57:36,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,290 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-22 10:57:36,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,318 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 37 treesize of output 42 [2022-07-22 10:57:36,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:36,441 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 59 treesize of output 52 [2022-07-22 10:57:36,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:36,539 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 61 treesize of output 54 [2022-07-22 10:57:36,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:36,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,625 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 70 treesize of output 55 [2022-07-22 10:57:36,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:36,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,736 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 76 treesize of output 56 [2022-07-22 10:57:36,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:36,872 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 62 treesize of output 57 [2022-07-22 10:57:36,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:36,980 INFO L356 Elim1Store]: treesize reduction 30, result has 42.3 percent of original size [2022-07-22 10:57:36,980 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 42 treesize of output 57 [2022-07-22 10:57:37,098 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 43 treesize of output 27 [2022-07-22 10:57:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:37,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:39,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_367 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) is different from false [2022-07-22 10:57:39,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_367 Int) (v_ArrVal_365 Int) (|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_365) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) is different from false [2022-07-22 10:57:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-22 10:57:57,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034543124] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:57,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:57,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 60 [2022-07-22 10:57:57,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402571557] [2022-07-22 10:57:57,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:57,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-22 10:57:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-22 10:57:57,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2997, Unknown=31, NotChecked=226, Total=3540 [2022-07-22 10:57:57,918 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 60 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:00,164 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (+ c_~N~0 1)) (.cse2 (select .cse1 0))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_367 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) (not (<= (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 7)) (= (select .cse1 (+ (* c_~N~0 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse1 (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 4) (<= .cse2 .cse3) (<= 3 c_~N~0) (<= c_~N~0 3) (= |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) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (<= .cse3 .cse2) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)))) is different from false [2022-07-22 10:58:02,259 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_367 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) (forall ((v_ArrVal_367 Int) (v_ArrVal_365 Int) (|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_120|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_365) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) (<= 3 c_~N~0) (<= c_~N~0 3) (= |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) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (= 4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-22 10:58:04,856 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_367 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) (forall ((v_ArrVal_367 Int) (v_ArrVal_365 Int) (|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_120|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_365) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) is different from false [2022-07-22 10:58:05,221 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_367 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (forall ((v_ArrVal_367 Int) (v_ArrVal_365 Int) (|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_365) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) is different from false [2022-07-22 10:58:07,223 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ c_~N~0 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_367 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) is different from false [2022-07-22 10:58:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:58:07,291 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-07-22 10:58:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-22 10:58:07,292 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 10:58:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:58:07,292 INFO L225 Difference]: With dead ends: 70 [2022-07-22 10:58:07,292 INFO L226 Difference]: Without dead ends: 68 [2022-07-22 10:58:07,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=360, Invalid=3538, Unknown=36, NotChecked=896, Total=4830 [2022-07-22 10:58:07,293 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:58:07,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 164 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 235 Invalid, 0 Unknown, 363 Unchecked, 0.1s Time] [2022-07-22 10:58:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-22 10:58:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2022-07-22 10:58:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-07-22 10:58:07,300 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 32 [2022-07-22 10:58:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:58:07,301 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-07-22 10:58:07,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-07-22 10:58:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 10:58:07,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:58:07,308 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:58:07,324 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-22 10:58:07,524 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-22 10:58:07,524 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:58:07,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:58:07,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2062841424, now seen corresponding path program 8 times [2022-07-22 10:58:07,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:58:07,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022716102] [2022-07-22 10:58:07,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:58:07,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:58:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:58:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:58:07,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:58:07,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022716102] [2022-07-22 10:58:07,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022716102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:58:07,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487066748] [2022-07-22 10:58:07,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:58:07,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:58:07,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:58:07,593 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-22 10:58:07,601 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-22 10:58:07,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:58:07,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:58:07,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:58:07,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:58:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:58:07,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:58:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:58:07,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487066748] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:58:07,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:58:07,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-22 10:58:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143553580] [2022-07-22 10:58:07,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:58:07,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:58:07,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:58:07,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:58:07,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:58:07,742 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:58:07,878 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2022-07-22 10:58:07,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 10:58:07,878 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-22 10:58:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:58:07,879 INFO L225 Difference]: With dead ends: 142 [2022-07-22 10:58:07,879 INFO L226 Difference]: Without dead ends: 113 [2022-07-22 10:58:07,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-22 10:58:07,880 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 152 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:58:07,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 80 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:58:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-22 10:58:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 79. [2022-07-22 10:58:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.1153846153846154) internal successors, (87), 78 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-07-22 10:58:07,886 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 34 [2022-07-22 10:58:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:58:07,886 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-07-22 10:58:07,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-07-22 10:58:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 10:58:07,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:58:07,887 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:58:07,904 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-22 10:58:08,095 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-22 10:58:08,096 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:58:08,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:58:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash 526321296, now seen corresponding path program 9 times [2022-07-22 10:58:08,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:58:08,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174671680] [2022-07-22 10:58:08,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:58:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:58:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:58:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:58:08,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:58:08,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174671680] [2022-07-22 10:58:08,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174671680] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:58:08,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434389920] [2022-07-22 10:58:08,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:58:08,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:58:08,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:58:08,151 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-22 10:58:08,163 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-22 10:58:08,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 10:58:08,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:58:08,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:58:08,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:58:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:58:08,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:58:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:58:08,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434389920] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:58:08,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:58:08,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-22 10:58:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640149194] [2022-07-22 10:58:08,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:58:08,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:58:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:58:08,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:58:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:58:08,340 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:58:08,530 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-07-22 10:58:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 10:58:08,531 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-22 10:58:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:58:08,531 INFO L225 Difference]: With dead ends: 119 [2022-07-22 10:58:08,532 INFO L226 Difference]: Without dead ends: 98 [2022-07-22 10:58:08,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 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-22 10:58:08,532 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 150 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:58:08,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 145 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:58:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-22 10:58:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2022-07-22 10:58:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-07-22 10:58:08,537 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 34 [2022-07-22 10:58:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:58:08,537 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-07-22 10:58:08,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-07-22 10:58:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 10:58:08,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:58:08,538 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, 1] [2022-07-22 10:58:08,556 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-22 10:58:08,747 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-22 10:58:08,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:58:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:58:08,748 INFO L85 PathProgramCache]: Analyzing trace with hash -968725112, now seen corresponding path program 2 times [2022-07-22 10:58:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:58:08,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494906823] [2022-07-22 10:58:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:58:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:58:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:58:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:58:09,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:58:09,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494906823] [2022-07-22 10:58:09,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494906823] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:58:09,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625710341] [2022-07-22 10:58:09,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:58:09,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:58:09,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:58:09,900 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-22 10:58:09,900 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-22 10:58:09,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:58:09,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:58:09,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-22 10:58:09,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:58:09,968 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-22 10:58:09,991 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 15 treesize of output 11 [2022-07-22 10:58:10,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:10,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:58:10,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:10,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:10,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:10,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-22 10:58:10,178 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 23 [2022-07-22 10:58:10,196 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 23 [2022-07-22 10:58:10,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:10,223 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-22 10:58:10,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:58:10,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:10,276 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 46 treesize of output 36 [2022-07-22 10:58:10,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:10,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:10,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:58:10,356 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 54 treesize of output 38 [2022-07-22 10:58:10,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:10,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:10,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:10,445 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 44 treesize of output 45 [2022-07-22 10:58:10,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 59 treesize of output 27 [2022-07-22 10:58:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:58:10,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:58:35,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse2)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-22 10:59:04,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (let ((.cse0 (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (+ .cse5 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (let ((.cse4 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse3 .cse4 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse4)))))) (store .cse1 .cse2 (+ (select .cse3 .cse2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-22 10:59:05,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_537 Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_537)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_537 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse1)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 .cse1)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-22 10:59:05,715 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:59:05,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 150 [2022-07-22 10:59:05,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (+ (select .cse3 .cse1) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-22 10:59:05,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse3 (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|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse1)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 .cse1)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-22 10:59:05,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_187| Int)) (or (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (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|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_187|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (+ (select .cse3 .cse1) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 .cse1)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_187|)))) is different from false [2022-07-22 10:59:05,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (|v_ULTIMATE.start_main_~i~0#1_187| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (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|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_187|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse2 .cse1 (+ (select .cse3 .cse1) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_187|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-22 10:59:05,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (|v_ULTIMATE.start_main_~i~0#1_187| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse3 (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|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_187|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse1)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 .cse1)))) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_187|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-22 10:59:05,841 INFO L356 Elim1Store]: treesize reduction 127, result has 23.0 percent of original size [2022-07-22 10:59:05,841 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 475 treesize of output 189 [2022-07-22 10:59:05,845 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 391 treesize of output 355 [2022-07-22 10:59:05,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:05,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:05,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:05,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:05,913 INFO L356 Elim1Store]: treesize reduction 29, result has 74.8 percent of original size [2022-07-22 10:59:05,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 101 treesize of output 151 [2022-07-22 10:59:05,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:05,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:05,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:05,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:05,932 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:59:05,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 112 [2022-07-22 10:59:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2022-07-22 10:59:06,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625710341] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:59:06,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:59:06,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19, 21] total 63 [2022-07-22 10:59:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585971143] [2022-07-22 10:59:06,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:59:06,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-22 10:59:06,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:59:06,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-22 10:59:06,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2614, Unknown=66, NotChecked=904, Total=3906 [2022-07-22 10:59:06,111 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 63 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:06,162 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= .cse2 0) (or (<= (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 1) (* c_~N~0 8)) (let ((.cse5 (select .cse0 0))) (let ((.cse4 (+ .cse2 1)) (.cse3 (+ c_~N~0 .cse5))) (and (<= .cse3 .cse4) (= .cse5 1) (= (select .cse0 8) 1) (<= .cse4 .cse3))))) (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) (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (|v_ULTIMATE.start_main_~i~0#1_187| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (let ((.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (store (let ((.cse9 (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|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_187|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse8 .cse7 (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse10 .cse7)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse6 .cse7)))) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_187|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 10:59:06,166 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (|v_ULTIMATE.start_main_~i~0#1_187| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (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|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_187|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse2 .cse1 (+ (select .cse3 .cse1) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_187|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (<= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 7)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-22 10:59:08,170 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select .cse0 .cse1) 1) (= (select .cse0 0) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_187| Int)) (or (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (store (let ((.cse6 (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|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_187|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse4 .cse3 (+ (select .cse5 .cse3) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse2 .cse3)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_187|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (<= .cse1 7)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-22 10:59:20,443 WARN L233 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 100 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:59:36,032 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse9 8)) (.cse8 (+ c_~N~0 1)) (.cse5 (select .cse9 0))) (and (not (= .cse0 0)) (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (let ((.cse1 (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|)))) (not (= .cse0 8)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= .cse4 .cse5) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (and (= .cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse6) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (<= .cse5 .cse8) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse5 .cse4) (<= .cse8 .cse5)))) is different from false [2022-07-22 10:59:38,069 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse6 8)) (.cse4 (+ c_~N~0 1)) (.cse1 (select .cse6 0))) (and (<= .cse0 .cse1) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (and (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse2) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (<= .cse1 .cse4) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|)) (forall ((v_ArrVal_544 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse1 .cse0) (<= .cse4 .cse1)))) is different from false [2022-07-22 10:59:41,856 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse2)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (and (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-22 10:59:44,482 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (and (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|)) (forall ((v_ArrVal_544 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-22 10:59:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:59:47,653 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-07-22 10:59:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-22 10:59:47,654 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-22 10:59:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:59:47,654 INFO L225 Difference]: With dead ends: 80 [2022-07-22 10:59:47,654 INFO L226 Difference]: Without dead ends: 78 [2022-07-22 10:59:47,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 36 SyntacticMatches, 10 SemanticMatches, 88 ConstructedPredicates, 15 IntricatePredicates, 1 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 97.2s TimeCoverageRelationStatistics Valid=586, Invalid=4922, Unknown=102, NotChecked=2400, Total=8010 [2022-07-22 10:59:47,656 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 451 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:59:47,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 132 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 323 Invalid, 0 Unknown, 451 Unchecked, 0.2s Time] [2022-07-22 10:59:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-22 10:59:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-07-22 10:59:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-07-22 10:59:47,662 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 36 [2022-07-22 10:59:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:59:47,663 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-07-22 10:59:47,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-07-22 10:59:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-22 10:59:47,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:59:47,663 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:59:47,680 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-22 10:59:47,872 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-22 10:59:47,873 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:59:47,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:59:47,873 INFO L85 PathProgramCache]: Analyzing trace with hash -389301684, now seen corresponding path program 10 times [2022-07-22 10:59:47,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:59:47,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685675010] [2022-07-22 10:59:47,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:59:47,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:59:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:59:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:59:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:59:49,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685675010] [2022-07-22 10:59:49,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685675010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:59:49,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380723281] [2022-07-22 10:59:49,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:59:49,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:59:49,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:59:49,185 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-22 10:59:49,186 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-22 10:59:49,244 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:59:49,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:59:49,246 WARN L261 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-22 10:59:49,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:59:49,257 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-22 10:59:49,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,320 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-22 10:59:49,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,396 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-22 10:59:49,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,487 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-22 10:59:49,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,588 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-22 10:59:49,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:49,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,819 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-22 10:59:49,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:49,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:49,939 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 69 treesize of output 63 [2022-07-22 10:59:50,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:50,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,059 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 75 treesize of output 65 [2022-07-22 10:59:50,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,197 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 73 treesize of output 61 [2022-07-22 10:59:50,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:50,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,357 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 79 treesize of output 65 [2022-07-22 10:59:50,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:50,497 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 63 [2022-07-22 10:59:50,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,649 INFO L356 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2022-07-22 10:59:50,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 68 [2022-07-22 10:59:50,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,836 INFO L356 Elim1Store]: treesize reduction 78, result has 29.1 percent of original size [2022-07-22 10:59:50,836 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 3 case distinctions, treesize of input 57 treesize of output 71 [2022-07-22 10:59:50,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:50,967 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 43 treesize of output 27 [2022-07-22 10:59:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:59:51,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:59:53,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_202|)) (forall ((v_ArrVal_632 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) is different from false [2022-07-22 10:59:53,558 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_202|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) is different from false [2022-07-22 10:59:55,567 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_203| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_203|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_203| 1) |v_ULTIMATE.start_main_~i~0#1_202|)))))) is different from false [2022-07-22 10:59:57,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_628 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_203|)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_628) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_203| 1) |v_ULTIMATE.start_main_~i~0#1_202|)))) is different from false