./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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/s4if.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 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:39:05,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:39:05,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:39:05,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:39:05,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:39:05,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:39:05,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:39:05,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:39:05,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:39:05,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:39:05,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:39:05,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:39:05,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:39:05,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:39:05,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:39:05,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:39:05,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:39:05,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:39:05,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:39:05,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:39:05,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:39:05,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:39:05,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:39:05,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:39:05,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:39:05,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:39:05,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:39:05,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:39:05,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:39:05,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:39:05,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:39:05,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:39:05,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:39:05,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:39:05,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:39:05,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:39:05,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:39:05,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:39:05,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:39:05,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:39:05,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:39:05,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 11:39:05,733 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:39:05,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:39:05,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:39:05,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:39:05,735 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:39:05,735 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:39:05,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:39:05,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:39:05,736 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:39:05,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:39:05,736 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:39:05,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 11:39:05,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:39:05,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:39:05,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:39:05,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:39:05,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:39:05,737 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:39:05,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:39:05,738 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:39:05,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:39:05,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:39:05,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:39:05,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:39:05,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:39:05,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:39:05,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:39:05,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:39:05,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 11:39:05,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 11:39:05,739 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:39:05,739 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:39:05,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:39:05,740 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:39:05,740 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 -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2021-12-14 11:39:05,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:39:05,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:39:05,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:39:05,940 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:39:05,940 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:39:05,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s4if.c [2021-12-14 11:39:05,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708b4a4ff/a808a926c1f041418c5a91f38ac709d4/FLAGad7c51baa [2021-12-14 11:39:06,339 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:39:06,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c [2021-12-14 11:39:06,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708b4a4ff/a808a926c1f041418c5a91f38ac709d4/FLAGad7c51baa [2021-12-14 11:39:06,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708b4a4ff/a808a926c1f041418c5a91f38ac709d4 [2021-12-14 11:39:06,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:39:06,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:39:06,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:39:06,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:39:06,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:39:06,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:39:06" (1/1) ... [2021-12-14 11:39:06,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50513787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06, skipping insertion in model container [2021-12-14 11:39:06,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:39:06" (1/1) ... [2021-12-14 11:39:06,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:39:06,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:39:06,500 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/s4if.c[587,600] [2021-12-14 11:39:06,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:39:06,532 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:39:06,543 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/s4if.c[587,600] [2021-12-14 11:39:06,559 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:39:06,568 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:39:06,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06 WrapperNode [2021-12-14 11:39:06,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:39:06,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:39:06,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:39:06,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:39:06,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06" (1/1) ... [2021-12-14 11:39:06,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06" (1/1) ... [2021-12-14 11:39:06,603 INFO L137 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2021-12-14 11:39:06,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:39:06,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:39:06,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:39:06,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:39:06,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06" (1/1) ... [2021-12-14 11:39:06,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06" (1/1) ... [2021-12-14 11:39:06,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06" (1/1) ... [2021-12-14 11:39:06,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06" (1/1) ... [2021-12-14 11:39:06,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06" (1/1) ... [2021-12-14 11:39:06,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06" (1/1) ... [2021-12-14 11:39:06,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06" (1/1) ... [2021-12-14 11:39:06,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:39:06,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:39:06,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:39:06,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:39:06,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06" (1/1) ... [2021-12-14 11:39:06,661 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:39:06,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:06,699 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) [2021-12-14 11:39:06,754 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 [2021-12-14 11:39:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:39:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 11:39:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 11:39:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 11:39:06,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 11:39:06,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:39:06,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:39:06,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 11:39:06,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 11:39:06,822 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:39:06,823 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:39:07,010 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:39:07,014 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:39:07,014 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 11:39:07,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:39:07 BoogieIcfgContainer [2021-12-14 11:39:07,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:39:07,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:39:07,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:39:07,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:39:07,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:39:06" (1/3) ... [2021-12-14 11:39:07,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48514619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:39:07, skipping insertion in model container [2021-12-14 11:39:07,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:39:06" (2/3) ... [2021-12-14 11:39:07,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48514619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:39:07, skipping insertion in model container [2021-12-14 11:39:07,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:39:07" (3/3) ... [2021-12-14 11:39:07,021 INFO L111 eAbstractionObserver]: Analyzing ICFG s4if.c [2021-12-14 11:39:07,024 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:39:07,024 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:39:07,052 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:39:07,056 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 11:39:07,057 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:39:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) [2021-12-14 11:39:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 11:39:07,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:07,068 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:07,069 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:07,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:07,072 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2021-12-14 11:39:07,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:07,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061574316] [2021-12-14 11:39:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:07,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:07,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:07,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061574316] [2021-12-14 11:39:07,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061574316] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:39:07,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:39:07,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:39:07,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370259305] [2021-12-14 11:39:07,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:39:07,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:39:07,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:07,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:39:07,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:39:07,196 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:07,207 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-12-14 11:39:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:39:07,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-14 11:39:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:07,213 INFO L225 Difference]: With dead ends: 34 [2021-12-14 11:39:07,214 INFO L226 Difference]: Without dead ends: 15 [2021-12-14 11:39:07,216 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:39:07,218 INFO L933 BasicCegarLoop]: 22 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, 22 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 [2021-12-14 11:39:07,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:39:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-14 11:39:07,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-14 11:39:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-14 11:39:07,244 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-12-14 11:39:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:07,245 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-14 11:39:07,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-14 11:39:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 11:39:07,245 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:07,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:07,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 11:39:07,246 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:07,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:07,247 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2021-12-14 11:39:07,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:07,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811708562] [2021-12-14 11:39:07,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:07,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:07,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:07,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811708562] [2021-12-14 11:39:07,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811708562] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:39:07,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:39:07,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:39:07,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442862379] [2021-12-14 11:39:07,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:39:07,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:39:07,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:07,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:39:07,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:39:07,311 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:07,363 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-14 11:39:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:39:07,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-14 11:39:07,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:07,364 INFO L225 Difference]: With dead ends: 28 [2021-12-14 11:39:07,365 INFO L226 Difference]: Without dead ends: 20 [2021-12-14 11:39:07,365 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:39:07,366 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:07,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:39:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-14 11:39:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2021-12-14 11:39:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-14 11:39:07,370 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2021-12-14 11:39:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:07,370 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-14 11:39:07,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-12-14 11:39:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 11:39:07,371 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:07,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:07,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 11:39:07,383 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:07,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:07,384 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2021-12-14 11:39:07,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:07,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304067373] [2021-12-14 11:39:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:07,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:07,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:07,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304067373] [2021-12-14 11:39:07,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304067373] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:07,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442872244] [2021-12-14 11:39:07,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:07,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:07,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:07,648 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) [2021-12-14 11:39:07,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 11:39:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:07,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-14 11:39:07,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:07,767 INFO L388 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 [2021-12-14 11:39:07,780 INFO L388 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 [2021-12-14 11:39:07,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:08,039 INFO L388 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 44 treesize of output 27 [2021-12-14 11:39:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:08,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:08,402 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:39:08,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-14 11:39:08,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:39:08,407 INFO L388 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 26 treesize of output 18 [2021-12-14 11:39:08,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-14 11:39:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:08,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442872244] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:08,422 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:08,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2021-12-14 11:39:08,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277608202] [2021-12-14 11:39:08,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:08,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-14 11:39:08,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:08,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-14 11:39:08,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=397, Unknown=2, NotChecked=0, Total=506 [2021-12-14 11:39:08,425 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 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) [2021-12-14 11:39:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:08,560 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-12-14 11:39:08,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:39:08,561 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 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 16 [2021-12-14 11:39:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:08,561 INFO L225 Difference]: With dead ends: 33 [2021-12-14 11:39:08,561 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 11:39:08,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=496, Unknown=2, NotChecked=0, Total=650 [2021-12-14 11:39:08,563 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:08,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 41 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2021-12-14 11:39:08,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 11:39:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2021-12-14 11:39:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:08,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-14 11:39:08,567 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2021-12-14 11:39:08,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:08,568 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-14 11:39:08,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 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) [2021-12-14 11:39:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-14 11:39:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 11:39:08,568 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:08,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:08,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:08,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:08,782 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:08,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:08,783 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2021-12-14 11:39:08,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:08,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601859292] [2021-12-14 11:39:08,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:08,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:08,797 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 11:39:08,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2125025929] [2021-12-14 11:39:08,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:08,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:08,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:08,815 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) [2021-12-14 11:39:08,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 11:39:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:08,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 11:39:08,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:08,877 INFO L388 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 [2021-12-14 11:39:08,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 11:39:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:08,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:08,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-14 11:39:08,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-14 11:39:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:08,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:08,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601859292] [2021-12-14 11:39:08,950 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 11:39:08,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125025929] [2021-12-14 11:39:08,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125025929] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:08,950 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:39:08,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-14 11:39:08,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121972199] [2021-12-14 11:39:08,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:08,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:39:08,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:08,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:39:08,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:39:08,952 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:08,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:08,991 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-12-14 11:39:08,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:39:08,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 11:39:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:08,992 INFO L225 Difference]: With dead ends: 33 [2021-12-14 11:39:08,992 INFO L226 Difference]: Without dead ends: 26 [2021-12-14 11:39:08,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:39:08,993 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:08,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:39:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-14 11:39:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-14 11:39:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-14 11:39:08,997 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2021-12-14 11:39:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:08,997 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-14 11:39:08,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-14 11:39:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 11:39:08,998 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:08,998 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:09,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-14 11:39:09,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-14 11:39:09,214 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:09,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2021-12-14 11:39:09,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:09,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228543819] [2021-12-14 11:39:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:09,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:09,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:09,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228543819] [2021-12-14 11:39:09,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228543819] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:09,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653940683] [2021-12-14 11:39:09,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:39:09,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:09,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:09,292 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) [2021-12-14 11:39:09,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 11:39:09,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:39:09,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:09,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:39:09,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:09,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:09,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653940683] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:09,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:09,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-14 11:39:09,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224360718] [2021-12-14 11:39:09,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:09,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:39:09,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:09,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:39:09,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:39:09,418 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:09,509 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-12-14 11:39:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:39:09,509 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 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 18 [2021-12-14 11:39:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:09,510 INFO L225 Difference]: With dead ends: 33 [2021-12-14 11:39:09,510 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 11:39:09,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-14 11:39:09,511 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:09,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 28 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:39:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 11:39:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2021-12-14 11:39:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-14 11:39:09,514 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2021-12-14 11:39:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:09,514 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-14 11:39:09,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-12-14 11:39:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 11:39:09,515 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:09,515 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:09,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:09,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:09,735 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:09,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2021-12-14 11:39:09,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:09,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894559704] [2021-12-14 11:39:09,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:09,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:09,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:09,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894559704] [2021-12-14 11:39:09,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894559704] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:09,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591011156] [2021-12-14 11:39:09,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 11:39:09,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:09,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:09,793 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) [2021-12-14 11:39:09,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 11:39:09,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-14 11:39:09,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:09,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:39:09,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:09,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:09,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591011156] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:09,913 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:09,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-14 11:39:09,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16878097] [2021-12-14 11:39:09,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:09,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:39:09,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:39:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:39:09,915 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:09,971 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-12-14 11:39:09,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:39:09,971 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 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 19 [2021-12-14 11:39:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:09,972 INFO L225 Difference]: With dead ends: 37 [2021-12-14 11:39:09,972 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 11:39:09,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-14 11:39:09,973 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:09,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 31 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:39:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 11:39:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-14 11:39:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-14 11:39:09,976 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2021-12-14 11:39:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:09,976 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-14 11:39:09,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-14 11:39:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 11:39:09,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:09,977 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:09,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-14 11:39:10,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:10,194 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:10,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:10,195 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2021-12-14 11:39:10,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:10,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497920521] [2021-12-14 11:39:10,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:10,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:10,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:10,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497920521] [2021-12-14 11:39:10,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497920521] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:10,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679430361] [2021-12-14 11:39:10,425 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 11:39:10,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:10,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:10,427 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) [2021-12-14 11:39:10,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 11:39:10,465 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 11:39:10,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:10,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-14 11:39:10,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:10,480 INFO L388 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 [2021-12-14 11:39:10,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:10,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:10,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:10,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:10,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:10,671 INFO L388 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 44 treesize of output 27 [2021-12-14 11:39:10,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:10,769 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:10,769 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-14 11:39:10,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:10,909 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:10,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 64 treesize of output 32 [2021-12-14 11:39:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:10,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:13,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_152 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse2 (div (+ .cse0 .cse1 .cse3) 4)) (<= (div (+ (* .cse1 (- 1)) (* .cse0 (- 1)) (* .cse3 (- 1))) (- 4)) .cse2))))))))) is different from false [2021-12-14 11:39:13,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_152 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= .cse2 (div (+ .cse0 .cse1 .cse3) 4)) (<= (div (+ (* .cse1 (- 1)) (* .cse0 (- 1)) (* .cse3 (- 1))) (- 4)) .cse2))))))))) is different from false [2021-12-14 11:39:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-14 11:39:13,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679430361] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:13,812 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:13,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2021-12-14 11:39:13,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559308676] [2021-12-14 11:39:13,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:13,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-14 11:39:13,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:13,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-14 11:39:13,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=762, Unknown=3, NotChecked=114, Total=992 [2021-12-14 11:39:13,816 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:13,953 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-12-14 11:39:13,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 11:39:13,953 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-14 11:39:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:13,953 INFO L225 Difference]: With dead ends: 36 [2021-12-14 11:39:13,953 INFO L226 Difference]: Without dead ends: 32 [2021-12-14 11:39:13,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=152, Invalid=909, Unknown=3, NotChecked=126, Total=1190 [2021-12-14 11:39:13,954 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:13,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 74 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 89 Invalid, 0 Unknown, 115 Unchecked, 0.0s Time] [2021-12-14 11:39:13,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-14 11:39:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-12-14 11:39:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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) [2021-12-14 11:39:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-12-14 11:39:13,958 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2021-12-14 11:39:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:13,958 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-12-14 11:39:13,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-12-14 11:39:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 11:39:13,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:13,958 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:13,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:14,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:14,171 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:14,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:14,172 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2021-12-14 11:39:14,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:14,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995625090] [2021-12-14 11:39:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:14,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:14,181 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 11:39:14,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698320434] [2021-12-14 11:39:14,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:14,187 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:14,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:14,192 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) [2021-12-14 11:39:14,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 11:39:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:14,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 11:39:14,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:14,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 11:39:14,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:14,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 11:39:14,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 11:39:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:14,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:14,395 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)))) is different from false [2021-12-14 11:39:14,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2021-12-14 11:39:14,414 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:39:14,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-14 11:39:14,419 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:39:14,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-14 11:39:14,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:39:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-14 11:39:14,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:14,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995625090] [2021-12-14 11:39:14,468 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 11:39:14,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698320434] [2021-12-14 11:39:14,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698320434] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:14,468 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:39:14,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-14 11:39:14,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689639292] [2021-12-14 11:39:14,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:14,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 11:39:14,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:14,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 11:39:14,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2021-12-14 11:39:14,470 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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) [2021-12-14 11:39:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:14,597 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-12-14 11:39:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:39:14,598 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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 21 [2021-12-14 11:39:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:14,598 INFO L225 Difference]: With dead ends: 41 [2021-12-14 11:39:14,598 INFO L226 Difference]: Without dead ends: 34 [2021-12-14 11:39:14,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=215, Unknown=2, NotChecked=62, Total=342 [2021-12-14 11:39:14,599 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:14,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 56 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 130 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2021-12-14 11:39:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-14 11:39:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-14 11:39:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-12-14 11:39:14,603 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2021-12-14 11:39:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:14,603 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-12-14 11:39:14,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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) [2021-12-14 11:39:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-12-14 11:39:14,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 11:39:14,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:14,604 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:14,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:14,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:14,815 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:14,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:14,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2021-12-14 11:39:14,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:14,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64242280] [2021-12-14 11:39:14,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:14,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:14,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:14,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64242280] [2021-12-14 11:39:14,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64242280] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:14,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264385276] [2021-12-14 11:39:14,888 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 11:39:14,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:14,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:14,889 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) [2021-12-14 11:39:14,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 11:39:15,001 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-14 11:39:15,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:15,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 11:39:15,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:15,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:15,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264385276] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:15,117 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:15,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-14 11:39:15,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578636207] [2021-12-14 11:39:15,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:15,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 11:39:15,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:15,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 11:39:15,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:39:15,119 INFO L87 Difference]: Start difference. First operand 33 states and 36 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) [2021-12-14 11:39:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:15,240 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-12-14 11:39:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 11:39:15,240 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 23 [2021-12-14 11:39:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:15,241 INFO L225 Difference]: With dead ends: 41 [2021-12-14 11:39:15,241 INFO L226 Difference]: Without dead ends: 37 [2021-12-14 11:39:15,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-14 11:39:15,242 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:15,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 25 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:39:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-14 11:39:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2021-12-14 11:39:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-14 11:39:15,246 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2021-12-14 11:39:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:15,246 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-14 11:39:15,246 INFO L471 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) [2021-12-14 11:39:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-12-14 11:39:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 11:39:15,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:15,247 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:15,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-14 11:39:15,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:15,467 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:15,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:15,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 6 times [2021-12-14 11:39:15,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:15,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054092949] [2021-12-14 11:39:15,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:15,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:15,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:15,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054092949] [2021-12-14 11:39:15,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054092949] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:15,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400372392] [2021-12-14 11:39:15,516 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 11:39:15,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:15,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:15,531 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) [2021-12-14 11:39:15,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 11:39:15,579 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-14 11:39:15,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:15,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 11:39:15,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:15,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:15,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400372392] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:15,690 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:15,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-14 11:39:15,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800646454] [2021-12-14 11:39:15,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:15,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 11:39:15,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 11:39:15,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:39:15,691 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:15,780 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2021-12-14 11:39:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 11:39:15,780 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-14 11:39:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:15,781 INFO L225 Difference]: With dead ends: 45 [2021-12-14 11:39:15,781 INFO L226 Difference]: Without dead ends: 30 [2021-12-14 11:39:15,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:39:15,781 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:15,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 27 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:39:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-14 11:39:15,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-12-14 11:39:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-12-14 11:39:15,785 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2021-12-14 11:39:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:15,785 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-12-14 11:39:15,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-12-14 11:39:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 11:39:15,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:15,786 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:15,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:16,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 11:39:16,004 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:16,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 7 times [2021-12-14 11:39:16,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:16,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118910850] [2021-12-14 11:39:16,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:16,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:16,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:16,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118910850] [2021-12-14 11:39:16,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118910850] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:16,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371220157] [2021-12-14 11:39:16,463 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-14 11:39:16,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:16,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:16,480 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) [2021-12-14 11:39:16,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 11:39:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:16,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-14 11:39:16,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:16,557 INFO L388 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 [2021-12-14 11:39:16,559 INFO L388 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 [2021-12-14 11:39:16,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:16,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:16,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:16,753 INFO L388 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 44 treesize of output 27 [2021-12-14 11:39:16,858 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:16,859 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-14 11:39:16,977 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:16,978 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-14 11:39:17,119 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:17,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 58 treesize of output 30 [2021-12-14 11:39:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:17,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:24,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_89| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= 4 .cse0)) (= (* 4 ~N~0) (+ .cse1 .cse2 .cse3 .cse0)) (not (= 4 .cse3)) (not (= .cse2 4))))))))) (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))) is different from false [2021-12-14 11:39:25,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_89| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= 4 .cse0)) (= (* 4 ~N~0) (+ .cse1 .cse2 .cse3 .cse0)) (not (= 4 .cse3)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= .cse2 4)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))))))))) is different from false [2021-12-14 11:39:25,352 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_89| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= 4 .cse0)) (= (* 4 ~N~0) (+ .cse1 .cse2 .cse3 .cse0)) (<= ~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (not (= 4 .cse3)) (not (= .cse2 4)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))))))) is different from false [2021-12-14 11:39:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-14 11:39:25,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371220157] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:25,511 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:25,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 42 [2021-12-14 11:39:25,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589827284] [2021-12-14 11:39:25,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:25,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-14 11:39:25,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-14 11:39:25,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1331, Unknown=7, NotChecked=228, Total=1722 [2021-12-14 11:39:25,513 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:25,713 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2021-12-14 11:39:25,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 11:39:25,714 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-14 11:39:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:25,714 INFO L225 Difference]: With dead ends: 45 [2021-12-14 11:39:25,714 INFO L226 Difference]: Without dead ends: 41 [2021-12-14 11:39:25,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=203, Invalid=1524, Unknown=7, NotChecked=246, Total=1980 [2021-12-14 11:39:25,715 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:25,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 122 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 160 Invalid, 0 Unknown, 197 Unchecked, 0.1s Time] [2021-12-14 11:39:25,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-14 11:39:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2021-12-14 11:39:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 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) [2021-12-14 11:39:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-12-14 11:39:25,719 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2021-12-14 11:39:25,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:25,719 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-14 11:39:25,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-12-14 11:39:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 11:39:25,720 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:25,720 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:25,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-14 11:39:25,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:25,945 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:25,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2021-12-14 11:39:25,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:25,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581065695] [2021-12-14 11:39:25,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:25,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:25,955 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 11:39:25,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631752731] [2021-12-14 11:39:25,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:39:25,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:25,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:25,972 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) [2021-12-14 11:39:26,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 11:39:26,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:39:26,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:26,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-14 11:39:26,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:26,071 INFO L388 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 [2021-12-14 11:39:26,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 11:39:26,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 11:39:26,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 11:39:26,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-14 11:39:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:26,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:26,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) 4)) is different from false [2021-12-14 11:39:26,261 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 (* |c_ULTIMATE.start_main_~i~0#1| 4))))) is different from false [2021-12-14 11:39:26,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 4)) is different from false [2021-12-14 11:39:26,279 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:39:26,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-14 11:39:26,284 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:39:26,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-14 11:39:26,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:39:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-14 11:39:26,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:26,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581065695] [2021-12-14 11:39:26,323 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 11:39:26,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631752731] [2021-12-14 11:39:26,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631752731] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:26,323 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:39:26,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-12-14 11:39:26,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820360746] [2021-12-14 11:39:26,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:26,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 11:39:26,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:26,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 11:39:26,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=128, Unknown=3, NotChecked=72, Total=240 [2021-12-14 11:39:26,325 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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) [2021-12-14 11:39:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:26,469 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-12-14 11:39:26,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 11:39:26,470 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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 26 [2021-12-14 11:39:26,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:26,470 INFO L225 Difference]: With dead ends: 49 [2021-12-14 11:39:26,470 INFO L226 Difference]: Without dead ends: 42 [2021-12-14 11:39:26,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=250, Unknown=3, NotChecked=102, Total=420 [2021-12-14 11:39:26,471 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:26,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 163 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2021-12-14 11:39:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-14 11:39:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-14 11:39:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 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) [2021-12-14 11:39:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-12-14 11:39:26,474 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2021-12-14 11:39:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:26,474 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-12-14 11:39:26,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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) [2021-12-14 11:39:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-12-14 11:39:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 11:39:26,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:26,475 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:26,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:26,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 11:39:26,687 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:26,688 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 8 times [2021-12-14 11:39:26,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:26,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721296537] [2021-12-14 11:39:26,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:26,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:26,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:26,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721296537] [2021-12-14 11:39:26,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721296537] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:26,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722568830] [2021-12-14 11:39:26,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:39:26,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:26,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:26,788 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) [2021-12-14 11:39:26,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 11:39:26,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:39:26,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:26,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 11:39:26,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:26,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:26,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722568830] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:26,999 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:27,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-14 11:39:27,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519451527] [2021-12-14 11:39:27,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:27,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 11:39:27,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:27,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 11:39:27,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:39:27,000 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:27,166 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-12-14 11:39:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 11:39:27,166 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-14 11:39:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:27,167 INFO L225 Difference]: With dead ends: 49 [2021-12-14 11:39:27,167 INFO L226 Difference]: Without dead ends: 45 [2021-12-14 11:39:27,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-14 11:39:27,168 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:27,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 28 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:39:27,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-14 11:39:27,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2021-12-14 11:39:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 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) [2021-12-14 11:39:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-12-14 11:39:27,171 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2021-12-14 11:39:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:27,171 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-14 11:39:27,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-12-14 11:39:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 11:39:27,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:27,172 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:27,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:27,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 11:39:27,379 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:27,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:27,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838205, now seen corresponding path program 9 times [2021-12-14 11:39:27,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:27,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408931642] [2021-12-14 11:39:27,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:27,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:27,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:27,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408931642] [2021-12-14 11:39:27,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408931642] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:27,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781305571] [2021-12-14 11:39:27,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 11:39:27,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:27,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:27,476 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) [2021-12-14 11:39:27,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 11:39:27,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-14 11:39:27,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:27,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 11:39:27,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:27,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:27,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781305571] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:27,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:27,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-14 11:39:27,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576977634] [2021-12-14 11:39:27,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:27,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 11:39:27,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:27,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 11:39:27,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:39:27,725 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:27,855 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2021-12-14 11:39:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 11:39:27,856 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-14 11:39:27,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:27,856 INFO L225 Difference]: With dead ends: 53 [2021-12-14 11:39:27,857 INFO L226 Difference]: Without dead ends: 35 [2021-12-14 11:39:27,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-14 11:39:27,858 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:27,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 22 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:39:27,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-14 11:39:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2021-12-14 11:39:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 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) [2021-12-14 11:39:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-12-14 11:39:27,867 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2021-12-14 11:39:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:27,867 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-12-14 11:39:27,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-12-14 11:39:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 11:39:27,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:27,870 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:27,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:28,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 11:39:28,083 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 10 times [2021-12-14 11:39:28,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:28,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905449769] [2021-12-14 11:39:28,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:28,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:28,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:28,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905449769] [2021-12-14 11:39:28,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905449769] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:28,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280791270] [2021-12-14 11:39:28,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 11:39:28,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:28,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:28,666 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:39:28,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 11:39:28,720 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 11:39:28,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:28,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-14 11:39:28,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:28,738 INFO L388 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 [2021-12-14 11:39:28,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:28,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:28,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:28,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:28,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:28,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:28,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:28,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:29,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:29,064 INFO L388 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 44 treesize of output 27 [2021-12-14 11:39:29,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:29,173 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:29,173 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-14 11:39:29,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:29,286 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:29,286 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-14 11:39:29,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:29,417 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:29,417 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2021-12-14 11:39:29,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:39:29,560 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:29,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 58 treesize of output 30 [2021-12-14 11:39:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:29,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:48,897 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_154| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_154| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_151| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_149| 4))))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 4))))) (or (not (= 4 .cse0)) (= (* 4 ~N~0) (+ .cse1 .cse2 .cse3 .cse4 .cse0)) (not (= .cse3 4)) (not (= .cse4 4)) (not (= .cse2 4)))))))))) (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))) is different from false [2021-12-14 11:39:49,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_154| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_154| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_151| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_149| 4))))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 4))))) (or (not (= 4 .cse0)) (= (* 4 ~N~0) (+ .cse1 .cse2 .cse3 .cse4 .cse0)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= .cse3 4)) (not (= .cse4 4)) (not (= .cse2 4)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)))))))))) is different from false [2021-12-14 11:39:49,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_154| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_154| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_151| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_149| 4))))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 4))))) (or (not (= 4 .cse0)) (= (* 4 ~N~0) (+ .cse1 .cse2 .cse3 .cse4 .cse0)) (<= ~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (not (= .cse3 4)) (not (= .cse4 4)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= .cse2 4)))))))))) is different from false [2021-12-14 11:39:50,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_154| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_154| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_151| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_149| 4))))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 4))))) (or (not (= 4 .cse0)) (<= ~N~0 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (= (* 4 ~N~0) (+ .cse1 .cse2 .cse3 .cse4 .cse0)) (not (= .cse3 4)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= .cse4 4)) (not (= .cse2 4)))))))))) is different from false [2021-12-14 11:39:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2021-12-14 11:39:51,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280791270] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:51,196 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:51,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2021-12-14 11:39:51,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941378808] [2021-12-14 11:39:51,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:51,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-14 11:39:51,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:51,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-14 11:39:51,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2079, Unknown=13, NotChecked=380, Total=2652 [2021-12-14 11:39:51,199 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:51,670 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-12-14 11:39:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 11:39:51,670 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-14 11:39:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:51,670 INFO L225 Difference]: With dead ends: 52 [2021-12-14 11:39:51,670 INFO L226 Difference]: Without dead ends: 48 [2021-12-14 11:39:51,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=210, Invalid=2243, Unknown=13, NotChecked=396, Total=2862 [2021-12-14 11:39:51,671 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:51,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 149 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 408 Unchecked, 0.1s Time] [2021-12-14 11:39:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-14 11:39:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2021-12-14 11:39:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-12-14 11:39:51,681 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2021-12-14 11:39:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:51,681 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-12-14 11:39:51,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-12-14 11:39:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 11:39:51,683 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:51,684 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:51,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-14 11:39:51,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 11:39:51,898 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:51,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 3 times [2021-12-14 11:39:51,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:51,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745645556] [2021-12-14 11:39:51,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:51,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:51,914 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 11:39:51,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000104535] [2021-12-14 11:39:51,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 11:39:51,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:51,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:51,923 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:39:51,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 11:39:51,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-14 11:39:51,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:51,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 11:39:51,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:52,007 INFO L388 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 [2021-12-14 11:39:52,026 INFO L388 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 [2021-12-14 11:39:52,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 11:39:52,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 11:39:52,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 11:39:52,217 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:39:52,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2021-12-14 11:39:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 11:39:52,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:52,328 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_547 (Array Int Int))) (or (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= c_~N~0 |ULTIMATE.start_main_~i~0#1|) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) is different from false [2021-12-14 11:39:52,546 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:39:52,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-14 11:39:52,552 INFO L354 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2021-12-14 11:39:52,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2021-12-14 11:39:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2021-12-14 11:39:52,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:52,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745645556] [2021-12-14 11:39:52,580 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 11:39:52,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000104535] [2021-12-14 11:39:52,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000104535] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:52,581 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:39:52,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-12-14 11:39:52,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857871991] [2021-12-14 11:39:52,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:52,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 11:39:52,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:52,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 11:39:52,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=129, Unknown=6, NotChecked=24, Total=210 [2021-12-14 11:39:52,582 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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) [2021-12-14 11:39:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:52,655 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2021-12-14 11:39:52,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:39:52,655 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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) Word has length 31 [2021-12-14 11:39:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:52,657 INFO L225 Difference]: With dead ends: 56 [2021-12-14 11:39:52,657 INFO L226 Difference]: Without dead ends: 52 [2021-12-14 11:39:52,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=145, Unknown=6, NotChecked=26, Total=240 [2021-12-14 11:39:52,657 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:52,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 41 Unchecked, 0.0s Time] [2021-12-14 11:39:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-14 11:39:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2021-12-14 11:39:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-12-14 11:39:52,667 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2021-12-14 11:39:52,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:52,668 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-12-14 11:39:52,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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) [2021-12-14 11:39:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-12-14 11:39:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 11:39:52,669 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:52,669 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:52,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:52,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:52,886 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:52,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 11 times [2021-12-14 11:39:52,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:52,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731955442] [2021-12-14 11:39:52,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:52,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:52,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:52,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731955442] [2021-12-14 11:39:52,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731955442] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:52,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479716019] [2021-12-14 11:39:52,987 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 11:39:52,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:52,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:53,004 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:39:53,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-14 11:39:53,100 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-14 11:39:53,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:53,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 11:39:53,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:53,214 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:53,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:53,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479716019] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:53,273 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:53,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-14 11:39:53,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440436487] [2021-12-14 11:39:53,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:53,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 11:39:53,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:53,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 11:39:53,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-14 11:39:53,274 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:53,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:53,536 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2021-12-14 11:39:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 11:39:53,536 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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 33 [2021-12-14 11:39:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:53,537 INFO L225 Difference]: With dead ends: 69 [2021-12-14 11:39:53,537 INFO L226 Difference]: Without dead ends: 65 [2021-12-14 11:39:53,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2021-12-14 11:39:53,537 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:53,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 37 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:39:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-14 11:39:53,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2021-12-14 11:39:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 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) [2021-12-14 11:39:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-12-14 11:39:53,541 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2021-12-14 11:39:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:53,541 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-14 11:39:53,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2021-12-14 11:39:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 11:39:53,541 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:53,541 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:53,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:53,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 11:39:53,751 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:53,752 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 12 times [2021-12-14 11:39:53,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:53,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441365843] [2021-12-14 11:39:53,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:53,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:53,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:53,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441365843] [2021-12-14 11:39:53,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441365843] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:53,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428246420] [2021-12-14 11:39:53,847 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 11:39:53,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:53,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:53,849 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:39:53,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-14 11:39:53,928 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-14 11:39:53,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:53,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 11:39:53,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:54,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:54,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428246420] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:54,130 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:54,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-14 11:39:54,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136309345] [2021-12-14 11:39:54,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:54,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 11:39:54,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:54,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 11:39:54,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-14 11:39:54,131 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 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) [2021-12-14 11:39:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:54,255 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2021-12-14 11:39:54,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 11:39:54,256 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-14 11:39:54,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:54,256 INFO L225 Difference]: With dead ends: 78 [2021-12-14 11:39:54,256 INFO L226 Difference]: Without dead ends: 50 [2021-12-14 11:39:54,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-12-14 11:39:54,257 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 62 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:54,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 27 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:39:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-14 11:39:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2021-12-14 11:39:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2021-12-14 11:39:54,262 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 34 [2021-12-14 11:39:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:54,262 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-12-14 11:39:54,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 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) [2021-12-14 11:39:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2021-12-14 11:39:54,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 11:39:54,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:54,263 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:54,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:54,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 11:39:54,467 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:54,468 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 13 times [2021-12-14 11:39:54,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:54,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833902722] [2021-12-14 11:39:54,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:54,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:55,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:55,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833902722] [2021-12-14 11:39:55,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833902722] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:55,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175771122] [2021-12-14 11:39:55,093 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-14 11:39:55,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:55,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:55,094 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:39:55,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-14 11:39:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:55,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-14 11:39:55,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:55,178 INFO L388 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 [2021-12-14 11:39:55,181 INFO L388 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 [2021-12-14 11:39:55,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:55,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:55,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:55,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:55,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:55,466 INFO L388 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 44 treesize of output 27 [2021-12-14 11:39:55,595 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:55,595 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2021-12-14 11:39:55,731 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:55,731 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2021-12-14 11:39:55,884 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-14 11:39:55,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60 [2021-12-14 11:39:56,077 INFO L354 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2021-12-14 11:39:56,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 76 [2021-12-14 11:39:56,385 INFO L354 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2021-12-14 11:39:56,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 105 treesize of output 41 [2021-12-14 11:39:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:56,431 INFO L328 TraceCheckSpWp]: Computing backward predicates...