./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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/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-?-f4b24e3 [2022-07-13 11:18:26,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:18:26,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:18:26,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:18:26,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:18:26,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:18:26,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:18:26,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:18:26,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:18:26,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:18:26,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:18:26,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:18:26,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:18:26,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:18:26,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:18:26,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:18:26,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:18:26,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:18:26,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:18:26,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:18:26,754 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:18:26,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:18:26,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:18:26,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:18:26,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:18:26,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:18:26,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:18:26,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:18:26,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:18:26,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:18:26,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:18:26,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:18:26,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:18:26,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:18:26,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:18:26,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:18:26,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:18:26,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:18:26,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:18:26,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:18:26,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:18:26,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:18:26,772 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:18:26,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:18:26,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:18:26,793 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:18:26,793 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:18:26,793 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:18:26,794 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:18:26,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:18:26,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:18:26,794 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:18:26,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:18:26,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:18:26,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:18:26,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:18:26,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:18:26,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:18:26,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:18:26,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:18:26,796 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:18:26,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:18:26,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:18:26,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:18:26,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:18:26,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:18:26,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:18:26,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:18:26,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:18:26,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:18:26,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:18:26,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:18:26,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:18:26,799 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:18:26,799 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:18:26,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:18:26,799 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-13 11:18:26,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:18:26,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:18:26,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:18:26,989 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:18:26,989 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:18:26,990 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-13 11:18:27,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ffb0502/03d45d074ed24478a4e969b282bb9d6f/FLAGb3b0dfff6 [2022-07-13 11:18:27,390 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:18:27,391 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina2.c [2022-07-13 11:18:27,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ffb0502/03d45d074ed24478a4e969b282bb9d6f/FLAGb3b0dfff6 [2022-07-13 11:18:27,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ffb0502/03d45d074ed24478a4e969b282bb9d6f [2022-07-13 11:18:27,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:18:27,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:18:27,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:18:27,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:18:27,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:18:27,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:18:27" (1/1) ... [2022-07-13 11:18:27,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df90dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27, skipping insertion in model container [2022-07-13 11:18:27,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:18:27" (1/1) ... [2022-07-13 11:18:27,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:18:27,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:18:27,540 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-13 11:18:27,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:18:27,562 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:18:27,570 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-13 11:18:27,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:18:27,582 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:18:27,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27 WrapperNode [2022-07-13 11:18:27,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:18:27,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:18:27,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:18:27,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:18:27,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27" (1/1) ... [2022-07-13 11:18:27,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27" (1/1) ... [2022-07-13 11:18:27,603 INFO L137 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2022-07-13 11:18:27,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:18:27,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:18:27,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:18:27,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:18:27,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27" (1/1) ... [2022-07-13 11:18:27,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27" (1/1) ... [2022-07-13 11:18:27,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27" (1/1) ... [2022-07-13 11:18:27,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27" (1/1) ... [2022-07-13 11:18:27,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27" (1/1) ... [2022-07-13 11:18:27,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27" (1/1) ... [2022-07-13 11:18:27,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27" (1/1) ... [2022-07-13 11:18:27,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:18:27,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:18:27,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:18:27,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:18:27,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27" (1/1) ... [2022-07-13 11:18:27,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:18:27,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:27,646 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-13 11:18:27,648 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-13 11:18:27,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:18:27,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:18:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:18:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:18:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:18:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:18:27,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:18:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:18:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:18:27,709 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:18:27,710 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:18:27,791 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:18:27,795 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:18:27,796 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 11:18:27,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:18:27 BoogieIcfgContainer [2022-07-13 11:18:27,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:18:27,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:18:27,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:18:27,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:18:27,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:18:27" (1/3) ... [2022-07-13 11:18:27,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bedb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:18:27, skipping insertion in model container [2022-07-13 11:18:27,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:27" (2/3) ... [2022-07-13 11:18:27,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bedb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:18:27, skipping insertion in model container [2022-07-13 11:18:27,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:18:27" (3/3) ... [2022-07-13 11:18:27,802 INFO L111 eAbstractionObserver]: Analyzing ICFG sina2.c [2022-07-13 11:18:27,811 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:18:27,811 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:18:27,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:18:27,861 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@11924bd7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@637dfe49 [2022-07-13 11:18:27,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:18:27,873 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-13 11:18:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 11:18:27,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:27,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:27,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:27,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:27,883 INFO L85 PathProgramCache]: Analyzing trace with hash -592971038, now seen corresponding path program 1 times [2022-07-13 11:18:27,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:27,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277982567] [2022-07-13 11:18:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:27,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:28,037 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-13 11:18:28,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:28,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277982567] [2022-07-13 11:18:28,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277982567] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:18:28,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:18:28,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:18:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165292267] [2022-07-13 11:18:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:18:28,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:18:28,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:28,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:18:28,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:18:28,073 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-13 11:18:28,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:28,087 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-07-13 11:18:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:18:28,089 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-13 11:18:28,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:28,095 INFO L225 Difference]: With dead ends: 44 [2022-07-13 11:18:28,095 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 11:18:28,102 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-13 11:18:28,108 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-13 11:18:28,109 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-13 11:18:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 11:18:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 11:18:28,131 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-13 11:18:28,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-13 11:18:28,132 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-07-13 11:18:28,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:28,133 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 11:18:28,133 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-13 11:18:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-13 11:18:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 11:18:28,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:28,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:28,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:18:28,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:28,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash 108093540, now seen corresponding path program 1 times [2022-07-13 11:18:28,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:28,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586325875] [2022-07-13 11:18:28,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:28,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:28,234 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-13 11:18:28,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:28,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586325875] [2022-07-13 11:18:28,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586325875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:18:28,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:18:28,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:18:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682454006] [2022-07-13 11:18:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:18:28,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:18:28,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:28,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:18:28,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:18:28,239 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-13 11:18:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:28,299 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-13 11:18:28,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:18:28,299 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-13 11:18:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:28,301 INFO L225 Difference]: With dead ends: 45 [2022-07-13 11:18:28,301 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 11:18:28,304 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-13 11:18:28,305 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-13 11:18:28,306 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-13 11:18:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 11:18:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-07-13 11:18:28,318 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-13 11:18:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-07-13 11:18:28,319 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2022-07-13 11:18:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:28,321 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-13 11:18:28,322 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-13 11:18:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-07-13 11:18:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:18:28,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:28,324 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-13 11:18:28,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:18:28,325 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:28,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:28,326 INFO L85 PathProgramCache]: Analyzing trace with hash 615941150, now seen corresponding path program 1 times [2022-07-13 11:18:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:28,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368631270] [2022-07-13 11:18:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:28,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:28,802 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-13 11:18:28,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:28,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368631270] [2022-07-13 11:18:28,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368631270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:28,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237277571] [2022-07-13 11:18:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:28,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:28,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:28,805 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-13 11:18:28,806 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-13 11:18:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:28,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 11:18:28,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:28,904 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-13 11:18:28,911 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-13 11:18:28,923 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-13 11:18:29,025 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-13 11:18:29,113 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-13 11:18:29,241 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-13 11:18:29,263 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-13 11:18:29,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:29,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:18:29,504 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-13 11:18:29,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237277571] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:29,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:29,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 28 [2022-07-13 11:18:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565974620] [2022-07-13 11:18:29,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:29,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-13 11:18:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:29,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 11:18:29,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2022-07-13 11:18:29,510 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-13 11:18:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:29,719 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-07-13 11:18:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 11:18:29,720 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-13 11:18:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:29,720 INFO L225 Difference]: With dead ends: 45 [2022-07-13 11:18:29,720 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 11:18:29,721 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-13 11:18:29,721 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-13 11:18:29,722 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-13 11:18:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 11:18:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2022-07-13 11:18:29,726 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-13 11:18:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-13 11:18:29,726 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 20 [2022-07-13 11:18:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:29,727 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-13 11:18:29,727 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-13 11:18:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-07-13 11:18:29,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 11:18:29,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:29,728 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-13 11:18:29,746 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-13 11:18:29,943 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-13 11:18:29,944 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash 859342364, now seen corresponding path program 2 times [2022-07-13 11:18:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:29,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808889355] [2022-07-13 11:18:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:29,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:29,997 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-13 11:18:29,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:29,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808889355] [2022-07-13 11:18:29,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808889355] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:29,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382299858] [2022-07-13 11:18:29,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:18:29,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:29,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:29,999 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-13 11:18:30,000 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-13 11:18:30,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:18:30,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:30,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:18:30,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:30,093 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-13 11:18:30,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:30,112 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-13 11:18:30,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382299858] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:30,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:30,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:18:30,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346510707] [2022-07-13 11:18:30,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:30,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:18:30,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:30,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:18:30,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:18:30,114 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-13 11:18:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:30,210 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-07-13 11:18:30,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:18:30,210 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-13 11:18:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:30,211 INFO L225 Difference]: With dead ends: 81 [2022-07-13 11:18:30,211 INFO L226 Difference]: Without dead ends: 54 [2022-07-13 11:18:30,211 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-13 11:18:30,212 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-13 11:18:30,212 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-13 11:18:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-13 11:18:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2022-07-13 11:18:30,215 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-13 11:18:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-13 11:18:30,216 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2022-07-13 11:18:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:30,216 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-13 11:18:30,216 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-13 11:18:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-07-13 11:18:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 11:18:30,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:30,217 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-13 11:18:30,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 11:18:30,434 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-13 11:18:30,434 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash 803751580, now seen corresponding path program 3 times [2022-07-13 11:18:30,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:30,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194506276] [2022-07-13 11:18:30,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:30,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:30,471 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-13 11:18:30,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194506276] [2022-07-13 11:18:30,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194506276] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081470904] [2022-07-13 11:18:30,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:18:30,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:30,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:30,473 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-13 11:18:30,474 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-13 11:18:30,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:18:30,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:30,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:18:30,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:30,552 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-13 11:18:30,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:30,577 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-13 11:18:30,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081470904] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:30,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:30,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:18:30,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652144217] [2022-07-13 11:18:30,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:30,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:18:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:30,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:18:30,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:18:30,579 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-13 11:18:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:30,682 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-07-13 11:18:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:18:30,682 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-13 11:18:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:30,683 INFO L225 Difference]: With dead ends: 52 [2022-07-13 11:18:30,683 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 11:18:30,683 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-13 11:18:30,684 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 11:18:30,684 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-13 11:18:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 11:18:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2022-07-13 11:18:30,688 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-13 11:18:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-07-13 11:18:30,688 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2022-07-13 11:18:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:30,688 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-13 11:18:30,689 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-13 11:18:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-07-13 11:18:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 11:18:30,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:30,690 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-13 11:18:30,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:30,903 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-13 11:18:30,903 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1304966232, now seen corresponding path program 4 times [2022-07-13 11:18:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:30,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895591491] [2022-07-13 11:18:30,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:30,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:31,483 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-13 11:18:31,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:31,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895591491] [2022-07-13 11:18:31,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895591491] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:31,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445480692] [2022-07-13 11:18:31,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:18:31,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:31,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:31,491 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-13 11:18:31,492 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-13 11:18:31,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:18:31,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:31,540 WARN L261 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-13 11:18:31,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:31,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 11:18:31,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:31,586 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-13 11:18:31,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:31,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:31,666 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-13 11:18:31,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:31,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:18:31,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:31,825 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-13 11:18:31,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:31,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:31,921 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-13 11:18:32,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:32,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:18:32,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:32,033 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-13 11:18:32,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:32,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:32,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:32,140 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-13 11:18:32,140 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-13 11:18:32,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:32,266 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-13 11:18:32,291 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-13 11:18:32,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:34,432 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-13 11:18:45,462 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-13 11:18:45,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445480692] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:45,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:45,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 51 [2022-07-13 11:18:45,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85450025] [2022-07-13 11:18:45,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:45,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-13 11:18:45,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:45,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-13 11:18:45,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2192, Unknown=16, NotChecked=96, Total=2550 [2022-07-13 11:18:45,464 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-13 11:18:48,766 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-13 11:18:50,813 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-13 11:18:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:50,907 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-07-13 11:18:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 11:18:50,907 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-13 11:18:50,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:50,908 INFO L225 Difference]: With dead ends: 58 [2022-07-13 11:18:50,908 INFO L226 Difference]: Without dead ends: 56 [2022-07-13 11:18:50,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=311, Invalid=2873, Unknown=20, NotChecked=336, Total=3540 [2022-07-13 11:18:50,909 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-13 11:18:50,909 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-13 11:18:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-13 11:18:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2022-07-13 11:18:50,914 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-13 11:18:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-07-13 11:18:50,914 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 26 [2022-07-13 11:18:50,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:50,914 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-07-13 11:18:50,915 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-13 11:18:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-07-13 11:18:50,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:18:50,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:50,915 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-13 11:18:50,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 11:18:51,131 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-13 11:18:51,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:51,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1135931414, now seen corresponding path program 5 times [2022-07-13 11:18:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:51,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53601062] [2022-07-13 11:18:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:51,175 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-13 11:18:51,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:51,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53601062] [2022-07-13 11:18:51,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53601062] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:51,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910828794] [2022-07-13 11:18:51,180 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:18:51,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:51,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:51,181 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-13 11:18:51,182 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-13 11:18:51,237 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 11:18:51,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:51,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:18:51,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:51,299 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-13 11:18:51,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:51,317 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-13 11:18:51,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910828794] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:51,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:51,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:18:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607912196] [2022-07-13 11:18:51,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:51,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:18:51,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:51,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:18:51,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:18:51,319 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-13 11:18:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:51,430 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-07-13 11:18:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:18:51,430 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-13 11:18:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:51,431 INFO L225 Difference]: With dead ends: 112 [2022-07-13 11:18:51,431 INFO L226 Difference]: Without dead ends: 89 [2022-07-13 11:18:51,431 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-13 11:18:51,432 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-13 11:18:51,432 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-13 11:18:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-13 11:18:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2022-07-13 11:18:51,439 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-13 11:18:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-07-13 11:18:51,440 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 28 [2022-07-13 11:18:51,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:51,440 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-07-13 11:18:51,440 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-13 11:18:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-07-13 11:18:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:18:51,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:51,441 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-13 11:18:51,459 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-13 11:18:51,651 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-13 11:18:51,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash -227434410, now seen corresponding path program 6 times [2022-07-13 11:18:51,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:51,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945337105] [2022-07-13 11:18:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:51,717 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-13 11:18:51,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:51,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945337105] [2022-07-13 11:18:51,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945337105] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:51,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11719721] [2022-07-13 11:18:51,718 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:18:51,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:51,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:51,719 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-13 11:18:51,720 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-13 11:18:51,766 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-13 11:18:51,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:51,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:18:51,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:51,819 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-13 11:18:51,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:51,851 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-13 11:18:51,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11719721] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:51,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:51,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:18:51,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493678620] [2022-07-13 11:18:51,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:51,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:18:51,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:51,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:18:51,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:18:51,853 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-13 11:18:52,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:52,012 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-07-13 11:18:52,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:18:52,012 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-13 11:18:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:52,013 INFO L225 Difference]: With dead ends: 91 [2022-07-13 11:18:52,013 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 11:18:52,013 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-13 11:18:52,014 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-13 11:18:52,014 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-13 11:18:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 11:18:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2022-07-13 11:18:52,019 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-13 11:18:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-07-13 11:18:52,019 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 28 [2022-07-13 11:18:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:52,019 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-07-13 11:18:52,020 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-13 11:18:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-07-13 11:18:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 11:18:52,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:52,020 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-13 11:18:52,039 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-13 11:18:52,235 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-13 11:18:52,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 341343694, now seen corresponding path program 1 times [2022-07-13 11:18:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:52,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246144249] [2022-07-13 11:18:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:52,823 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-13 11:18:52,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:52,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246144249] [2022-07-13 11:18:52,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246144249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:52,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221074915] [2022-07-13 11:18:52,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:52,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:52,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:52,836 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-13 11:18:52,837 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-13 11:18:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:52,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-13 11:18:52,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:52,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:18:52,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:52,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 11:18:52,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:52,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:52,987 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-13 11:18:53,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:53,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:18:53,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:53,143 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-13 11:18:53,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:53,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:53,228 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-13 11:18:53,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:53,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:53,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:18:53,341 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-13 11:18:53,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:53,420 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-13 11:18:53,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:53,610 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-13 11:18:53,636 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-13 11:18:53,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:54,828 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-13 11:18:54,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221074915] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:54,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:54,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 53 [2022-07-13 11:18:54,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880945641] [2022-07-13 11:18:54,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:54,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-13 11:18:54,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:54,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-13 11:18:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2487, Unknown=0, NotChecked=0, Total=2756 [2022-07-13 11:18:54,831 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-13 11:18:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:55,773 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-07-13 11:18:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 11:18:55,773 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-13 11:18:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:55,774 INFO L225 Difference]: With dead ends: 57 [2022-07-13 11:18:55,774 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 11:18:55,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=340, Invalid=3200, Unknown=0, NotChecked=0, Total=3540 [2022-07-13 11:18:55,775 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:55,775 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.2s Time] [2022-07-13 11:18:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 11:18:55,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-07-13 11:18:55,778 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-13 11:18:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-13 11:18:55,778 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 30 [2022-07-13 11:18:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:55,779 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-13 11:18:55,779 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-13 11:18:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-13 11:18:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 11:18:55,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:55,780 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-13 11:18:55,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-13 11:18:55,995 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-13 11:18:55,995 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:55,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1505554158, now seen corresponding path program 7 times [2022-07-13 11:18:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:55,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232528787] [2022-07-13 11:18:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:56,879 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-13 11:18:56,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:56,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232528787] [2022-07-13 11:18:56,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232528787] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:56,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798515238] [2022-07-13 11:18:56,880 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:18:56,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:56,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:56,881 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-13 11:18:56,882 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-13 11:18:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:56,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-13 11:18:56,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:56,943 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-13 11:18:56,947 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-13 11:18:56,952 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-13 11:18:56,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:56,985 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-13 11:18:57,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,025 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-13 11:18:57,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:18:57,142 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-13 11:18:57,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:18:57,220 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-13 11:18:57,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:18:57,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,308 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-13 11:18:57,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:18:57,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,424 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-13 11:18:57,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:18:57,532 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-13 11:18:57,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:57,645 INFO L356 Elim1Store]: treesize reduction 30, result has 42.3 percent of original size [2022-07-13 11:18:57,645 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-13 11:18:57,749 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-13 11:18:57,774 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-13 11:18:57,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:59,883 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-13 11:19:00,240 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-13 11:19:22,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:22,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:22,639 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-13 11:19:22,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 1 [2022-07-13 11:19:22,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:22,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:22,644 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-13 11:19:22,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 1 [2022-07-13 11:19:22,645 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-13 11:19:22,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798515238] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:22,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:22,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 60 [2022-07-13 11:19:22,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107243921] [2022-07-13 11:19:22,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:22,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-13 11:19:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:22,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-13 11:19:22,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2989, Unknown=39, NotChecked=226, Total=3540 [2022-07-13 11:19:22,648 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-13 11:19:24,897 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-13 11:19:26,991 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-13 11:19:29,543 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-13 11:19:29,914 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-13 11:19:31,917 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-13 11:19:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:31,985 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-07-13 11:19:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-13 11:19:31,985 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-13 11:19:31,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:31,985 INFO L225 Difference]: With dead ends: 70 [2022-07-13 11:19:31,985 INFO L226 Difference]: Without dead ends: 68 [2022-07-13 11:19:31,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=360, Invalid=3530, Unknown=44, NotChecked=896, Total=4830 [2022-07-13 11:19:31,987 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-13 11:19:31,987 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-13 11:19:31,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-13 11:19:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2022-07-13 11:19:31,992 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-13 11:19:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-07-13 11:19:31,993 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 32 [2022-07-13 11:19:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:31,993 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-07-13 11:19:31,993 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-13 11:19:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-07-13 11:19:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:19:31,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:31,994 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-13 11:19:32,011 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-13 11:19:32,207 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-13 11:19:32,207 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:32,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:32,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2062841424, now seen corresponding path program 8 times [2022-07-13 11:19:32,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:32,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165042672] [2022-07-13 11:19:32,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:32,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:32,265 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-13 11:19:32,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:32,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165042672] [2022-07-13 11:19:32,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165042672] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:32,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676621321] [2022-07-13 11:19:32,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:19:32,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:32,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:32,267 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-13 11:19:32,267 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-13 11:19:32,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:19:32,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:32,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:19:32,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:32,378 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-13 11:19:32,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:32,401 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-13 11:19:32,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676621321] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:32,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:32,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:19:32,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434901597] [2022-07-13 11:19:32,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:32,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:19:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:32,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:19:32,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:19:32,402 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-13 11:19:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:32,522 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2022-07-13 11:19:32,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:19:32,522 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-13 11:19:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:32,523 INFO L225 Difference]: With dead ends: 142 [2022-07-13 11:19:32,523 INFO L226 Difference]: Without dead ends: 113 [2022-07-13 11:19:32,523 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-13 11:19:32,523 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-13 11:19:32,524 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-13 11:19:32,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-13 11:19:32,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 79. [2022-07-13 11:19:32,529 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-13 11:19:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-07-13 11:19:32,530 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 34 [2022-07-13 11:19:32,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:32,530 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-07-13 11:19:32,530 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-13 11:19:32,530 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-07-13 11:19:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:19:32,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:32,531 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-13 11:19:32,549 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-13 11:19:32,735 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-13 11:19:32,735 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:32,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash 526321296, now seen corresponding path program 9 times [2022-07-13 11:19:32,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:32,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132918136] [2022-07-13 11:19:32,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:32,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:32,795 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-13 11:19:32,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:32,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132918136] [2022-07-13 11:19:32,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132918136] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:32,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255528193] [2022-07-13 11:19:32,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:19:32,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:32,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:32,797 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-13 11:19:32,804 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-13 11:19:32,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 11:19:32,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:32,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:19:32,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:32,935 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-13 11:19:32,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:32,963 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-13 11:19:32,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255528193] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:32,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:32,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:19:32,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504508844] [2022-07-13 11:19:32,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:32,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:19:32,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:32,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:19:32,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:19:32,965 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-13 11:19:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:33,140 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-07-13 11:19:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:19:33,141 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-13 11:19:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:33,141 INFO L225 Difference]: With dead ends: 119 [2022-07-13 11:19:33,141 INFO L226 Difference]: Without dead ends: 98 [2022-07-13 11:19:33,141 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-13 11:19:33,142 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-13 11:19:33,142 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-13 11:19:33,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-13 11:19:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2022-07-13 11:19:33,152 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-13 11:19:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-07-13 11:19:33,152 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 34 [2022-07-13 11:19:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:33,152 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-07-13 11:19:33,152 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-13 11:19:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-07-13 11:19:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 11:19:33,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:33,153 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-13 11:19:33,171 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-13 11:19:33,355 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-13 11:19:33,355 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:33,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash -968725112, now seen corresponding path program 2 times [2022-07-13 11:19:33,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:33,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215147557] [2022-07-13 11:19:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:34,518 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-13 11:19:34,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:34,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215147557] [2022-07-13 11:19:34,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215147557] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:34,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225826064] [2022-07-13 11:19:34,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:19:34,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:34,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:34,520 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-13 11:19:34,520 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-13 11:19:34,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:19:34,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:34,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-13 11:19:34,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:34,588 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-13 11:19:34,614 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-13 11:19:34,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:34,669 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-13 11:19:34,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:34,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:34,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:34,736 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-13 11:19:34,778 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-13 11:19:34,790 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-13 11:19:34,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:34,806 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-13 11:19:34,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:34,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:34,858 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-13 11:19:34,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:34,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:34,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:34,937 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-13 11:19:35,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:35,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:35,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:35,034 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-13 11:19:35,319 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-13 11:19:35,345 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-13 11:19:35,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:20:00,100 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-13 11:20:00,708 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|) 8 |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 (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-13 11:20:31,038 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-13 11:20:31,049 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:20:31,049 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-13 11:20:31,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_arrayElimArr_3 (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_3))) (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_3 |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-13 11:20:31,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_arrayElimArr_3 (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 |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_3))) (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_3 |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-13 11:20:31,103 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_3 (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_3))) (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_3 |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-13 11:20:31,114 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_3 (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|) |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_3))) (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_3 |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 (<= (+ |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-13 11:20:31,125 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_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_187|)) (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|) 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_3))) (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_3 |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-13 11:20:31,163 INFO L356 Elim1Store]: treesize reduction 127, result has 23.0 percent of original size [2022-07-13 11:20:31,163 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-13 11:20:31,167 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-13 11:20:31,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:20:31,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:20:31,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:20:31,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:20:31,227 INFO L356 Elim1Store]: treesize reduction 29, result has 74.8 percent of original size [2022-07-13 11:20:31,227 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-13 11:20:31,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:20:31,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:20:31,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:20:31,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:20:31,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:20:31,246 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-13 11:20:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2022-07-13 11:20:31,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225826064] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:20:31,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:20:31,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19, 21] total 63 [2022-07-13 11:20:31,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836249512] [2022-07-13 11:20:31,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:20:31,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-13 11:20:31,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:31,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-13 11:20:31,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2640, Unknown=42, NotChecked=904, Total=3906 [2022-07-13 11:20:31,627 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-13 11:20:31,666 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))))) (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_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_187|)) (let ((.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (store (let ((.cse10 (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_3))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse8 .cse7 (+ (select .cse9 .cse7) (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |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 .cse6 .cse7) (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (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) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-13 11:20:31,670 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= (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|)) (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_3 (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|) |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_3))) (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_3 |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 (<= (+ |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|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-13 11:20:33,673 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) (= (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|)) (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_3 (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_3))) (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_3 |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|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-13 11:20:45,883 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) (.cse6 (+ c_~N~0 1)) (.cse4 (select .cse0 0))) (and (= (select .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (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 (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= .cse4 .cse5) (<= .cse5 .cse4) (<= .cse4 .cse6) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 8) 1) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse6 .cse4) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-07-13 11:20:46,518 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (select .cse8 8)) (.cse7 (+ c_~N~0 1)) (.cse4 (select .cse8 0))) (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|) 8 |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 (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_179|)))) (<= .cse3 .cse4) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (and (= .cse5 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (<= .cse4 .cse7) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse4 .cse3) (<= .cse7 .cse4)))) is different from false [2022-07-13 11:20:51,680 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (select .cse8 8)) (.cse7 (+ c_~N~0 1)) (.cse4 (select .cse8 0))) (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|)))) (<= .cse3 .cse4) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (and (= .cse5 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (<= .cse4 .cse7) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse4 .cse3) (<= .cse7 .cse4)))) is different from false [2022-07-13 11:20:55,180 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-13 11:20:57,236 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-13 11:21:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:21:00,753 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-07-13 11:21:00,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-13 11:21:00,754 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-13 11:21:00,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:21:00,754 INFO L225 Difference]: With dead ends: 80 [2022-07-13 11:21:00,754 INFO L226 Difference]: Without dead ends: 78 [2022-07-13 11:21:00,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 89 ConstructedPredicates, 16 IntricatePredicates, 1 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 85.6s TimeCoverageRelationStatistics Valid=589, Invalid=4964, Unknown=61, NotChecked=2576, Total=8190 [2022-07-13 11:21:00,756 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:21:00,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 142 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 343 Invalid, 0 Unknown, 447 Unchecked, 0.2s Time] [2022-07-13 11:21:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-13 11:21:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-07-13 11:21:00,762 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-13 11:21:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-07-13 11:21:00,763 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 36 [2022-07-13 11:21:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:21:00,763 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-07-13 11:21:00,763 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-13 11:21:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-07-13 11:21:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 11:21:00,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:21:00,764 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-13 11:21:00,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-13 11:21:00,964 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-13 11:21:00,964 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:21:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:21:00,965 INFO L85 PathProgramCache]: Analyzing trace with hash -389301684, now seen corresponding path program 10 times [2022-07-13 11:21:00,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:21:00,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770463313] [2022-07-13 11:21:00,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:21:00,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:21:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:21:02,191 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-13 11:21:02,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:21:02,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770463313] [2022-07-13 11:21:02,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770463313] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:21:02,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794323844] [2022-07-13 11:21:02,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:21:02,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:21:02,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:21:02,193 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-13 11:21:02,194 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-13 11:21:02,254 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:21:02,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:21:02,255 WARN L261 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-13 11:21:02,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:21:02,263 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-13 11:21:02,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,296 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-13 11:21:02,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,383 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-13 11:21:02,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,467 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-13 11:21:02,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,561 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-13 11:21:02,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:02,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,773 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-13 11:21:02,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:02,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,883 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-13 11:21:02,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:02,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:02,994 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-13 11:21:03,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,129 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-13 11:21:03,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:03,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,279 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-13 11:21:03,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:03,422 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-13 11:21:03,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,575 INFO L356 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2022-07-13 11:21:03,575 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-13 11:21:03,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,754 INFO L356 Elim1Store]: treesize reduction 78, result has 29.1 percent of original size [2022-07-13 11:21:03,754 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-13 11:21:03,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,882 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-13 11:21:03,919 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-13 11:21:03,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:21:06,082 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-13 11:21:06,444 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-13 11:21:08,457 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-13 11:21:10,472 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