./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s12if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/s12if.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 82bfc5dbe63d3250f02def4ff730c5e861bce4a7ef8a101c197bc29dbc0e3123 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 02:00:25,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 02:00:25,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 02:00:25,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 02:00:25,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 02:00:25,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 02:00:25,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 02:00:25,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 02:00:25,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 02:00:25,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 02:00:25,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 02:00:25,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 02:00:25,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 02:00:25,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 02:00:25,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 02:00:25,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 02:00:25,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 02:00:25,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 02:00:25,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 02:00:25,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 02:00:25,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 02:00:25,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 02:00:25,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 02:00:25,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 02:00:25,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 02:00:25,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 02:00:25,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 02:00:25,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 02:00:25,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 02:00:25,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 02:00:25,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 02:00:25,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 02:00:25,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 02:00:25,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 02:00:25,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 02:00:25,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 02:00:25,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 02:00:25,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 02:00:25,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 02:00:25,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 02:00:25,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 02:00:25,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 02:00:25,654 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 02:00:25,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 02:00:25,659 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 02:00:25,659 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 02:00:25,660 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 02:00:25,660 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 02:00:25,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 02:00:25,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 02:00:25,661 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 02:00:25,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 02:00:25,662 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 02:00:25,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 02:00:25,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 02:00:25,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 02:00:25,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 02:00:25,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 02:00:25,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 02:00:25,663 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 02:00:25,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 02:00:25,663 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 02:00:25,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 02:00:25,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 02:00:25,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 02:00:25,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 02:00:25,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:00:25,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 02:00:25,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 02:00:25,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 02:00:25,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 02:00:25,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 02:00:25,665 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 02:00:25,665 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 02:00:25,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 02:00:25,665 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 02:00:25,665 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 -> 82bfc5dbe63d3250f02def4ff730c5e861bce4a7ef8a101c197bc29dbc0e3123 [2021-12-17 02:00:25,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 02:00:25,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 02:00:25,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 02:00:25,838 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 02:00:25,839 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 02:00:25,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s12if.c [2021-12-17 02:00:25,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2926d24/417d4de5d99f4e27829222fa4d0b800a/FLAG408efabbf [2021-12-17 02:00:26,233 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 02:00:26,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12if.c [2021-12-17 02:00:26,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2926d24/417d4de5d99f4e27829222fa4d0b800a/FLAG408efabbf [2021-12-17 02:00:26,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2926d24/417d4de5d99f4e27829222fa4d0b800a [2021-12-17 02:00:26,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 02:00:26,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 02:00:26,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 02:00:26,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 02:00:26,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 02:00:26,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:00:26" (1/1) ... [2021-12-17 02:00:26,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e1569ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26, skipping insertion in model container [2021-12-17 02:00:26,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:00:26" (1/1) ... [2021-12-17 02:00:26,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 02:00:26,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 02:00:26,416 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/s12if.c[588,601] [2021-12-17 02:00:26,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:00:26,442 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 02:00:26,452 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/s12if.c[588,601] [2021-12-17 02:00:26,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:00:26,479 INFO L208 MainTranslator]: Completed translation [2021-12-17 02:00:26,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26 WrapperNode [2021-12-17 02:00:26,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 02:00:26,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 02:00:26,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 02:00:26,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 02:00:26,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26" (1/1) ... [2021-12-17 02:00:26,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26" (1/1) ... [2021-12-17 02:00:26,514 INFO L137 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2021-12-17 02:00:26,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 02:00:26,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 02:00:26,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 02:00:26,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 02:00:26,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26" (1/1) ... [2021-12-17 02:00:26,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26" (1/1) ... [2021-12-17 02:00:26,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26" (1/1) ... [2021-12-17 02:00:26,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26" (1/1) ... [2021-12-17 02:00:26,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26" (1/1) ... [2021-12-17 02:00:26,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26" (1/1) ... [2021-12-17 02:00:26,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26" (1/1) ... [2021-12-17 02:00:26,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 02:00:26,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 02:00:26,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 02:00:26,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 02:00:26,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26" (1/1) ... [2021-12-17 02:00:26,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:00:26,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:26,568 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-17 02:00:26,576 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-17 02:00:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 02:00:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 02:00:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 02:00:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 02:00:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 02:00:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 02:00:26,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 02:00:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 02:00:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 02:00:26,638 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 02:00:26,639 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 02:00:26,724 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 02:00:26,728 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 02:00:26,728 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-17 02:00:26,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:00:26 BoogieIcfgContainer [2021-12-17 02:00:26,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 02:00:26,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 02:00:26,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 02:00:26,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 02:00:26,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:00:26" (1/3) ... [2021-12-17 02:00:26,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:00:26, skipping insertion in model container [2021-12-17 02:00:26,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:00:26" (2/3) ... [2021-12-17 02:00:26,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:00:26, skipping insertion in model container [2021-12-17 02:00:26,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:00:26" (3/3) ... [2021-12-17 02:00:26,745 INFO L111 eAbstractionObserver]: Analyzing ICFG s12if.c [2021-12-17 02:00:26,748 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 02:00:26,748 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 02:00:26,797 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 02:00:26,811 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-17 02:00:26,811 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 02:00:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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-17 02:00:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 02:00:26,826 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:26,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:26,827 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:26,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:26,834 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2021-12-17 02:00:26,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:26,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633522458] [2021-12-17 02:00:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:26,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:26,975 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-17 02:00:26,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:26,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633522458] [2021-12-17 02:00:26,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633522458] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:00:26,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:00:26,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 02:00:26,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523506782] [2021-12-17 02:00:26,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:00:26,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 02:00:26,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:27,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 02:00:27,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 02:00:27,007 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-17 02:00:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:27,019 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2021-12-17 02:00:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 02:00:27,022 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-12-17 02:00:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:27,027 INFO L225 Difference]: With dead ends: 42 [2021-12-17 02:00:27,027 INFO L226 Difference]: Without dead ends: 19 [2021-12-17 02:00:27,030 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-17 02:00:27,034 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:27,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:00:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-17 02:00:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-17 02:00:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-12-17 02:00:27,058 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2021-12-17 02:00:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:27,059 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-17 02:00:27,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-17 02:00:27,059 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-12-17 02:00:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 02:00:27,060 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:27,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:27,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 02:00:27,061 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2021-12-17 02:00:27,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:27,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257756099] [2021-12-17 02:00:27,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:27,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:27,160 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-17 02:00:27,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:27,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257756099] [2021-12-17 02:00:27,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257756099] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:00:27,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:00:27,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:00:27,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635763394] [2021-12-17 02:00:27,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:00:27,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:00:27,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:27,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:00:27,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:00:27,167 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-17 02:00:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:27,230 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2021-12-17 02:00:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 02:00:27,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-12-17 02:00:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:27,233 INFO L225 Difference]: With dead ends: 39 [2021-12-17 02:00:27,233 INFO L226 Difference]: Without dead ends: 27 [2021-12-17 02:00:27,235 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-17 02:00:27,237 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:27,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 11 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:00:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-17 02:00:27,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-12-17 02:00:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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-17 02:00:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-12-17 02:00:27,245 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2021-12-17 02:00:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:27,247 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-12-17 02:00:27,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-17 02:00:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-12-17 02:00:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 02:00:27,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:27,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:27,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 02:00:27,251 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2021-12-17 02:00:27,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:27,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472018983] [2021-12-17 02:00:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:27,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:27,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:27,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472018983] [2021-12-17 02:00:27,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472018983] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:00:27,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040838833] [2021-12-17 02:00:27,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:27,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:27,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:27,584 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-17 02:00:27,585 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-17 02:00:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:27,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-17 02:00:27,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:27,685 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-17 02:00:27,691 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-17 02:00:27,726 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-17 02:00:27,789 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-17 02:00:27,858 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-17 02:00:27,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2021-12-17 02:00:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:27,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:28,127 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_46 (Array Int Int))) (let ((.cse2 (select v_ArrVal_46 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (let ((.cse1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse2)) (.cse0 (* 2 c_~N~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= 2 .cse2))))) is different from false [2021-12-17 02:00:28,331 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:00:28,332 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 57 treesize of output 50 [2021-12-17 02:00:28,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:00:28,337 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 44 treesize of output 32 [2021-12-17 02:00:28,340 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 34 treesize of output 16 [2021-12-17 02:00:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-17 02:00:28,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040838833] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:00:28,351 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:00:28,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2021-12-17 02:00:28,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392790376] [2021-12-17 02:00:28,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:00:28,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-17 02:00:28,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:28,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-17 02:00:28,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=244, Unknown=1, NotChecked=32, Total=342 [2021-12-17 02:00:28,353 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-17 02:00:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:28,569 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2021-12-17 02:00:28,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 02:00:28,569 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-17 02:00:28,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:28,570 INFO L225 Difference]: With dead ends: 41 [2021-12-17 02:00:28,570 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 02:00:28,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=418, Unknown=1, NotChecked=44, Total=600 [2021-12-17 02:00:28,571 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:28,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 61 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 141 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2021-12-17 02:00:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 02:00:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2021-12-17 02:00:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-12-17 02:00:28,574 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2021-12-17 02:00:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:28,575 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-17 02:00:28,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-17 02:00:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2021-12-17 02:00:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 02:00:28,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:28,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:28,595 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-17 02:00:28,792 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-17 02:00:28,792 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:28,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:28,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2021-12-17 02:00:28,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:28,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753904140] [2021-12-17 02:00:28,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:28,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:28,807 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:00:28,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1498006255] [2021-12-17 02:00:28,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:28,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:28,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:28,811 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-17 02:00:28,813 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-17 02:00:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:28,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-17 02:00:28,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:28,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-17 02:00:28,936 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-17 02:00:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:28,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:28,996 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 37 treesize of output 31 [2021-12-17 02:00:29,000 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 02:00:29,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2021-12-17 02:00:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:29,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:29,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753904140] [2021-12-17 02:00:29,019 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:00:29,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498006255] [2021-12-17 02:00:29,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498006255] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:00:29,019 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:00:29,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-12-17 02:00:29,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598338771] [2021-12-17 02:00:29,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:00:29,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 02:00:29,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 02:00:29,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-17 02:00:29,021 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-17 02:00:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:29,177 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2021-12-17 02:00:29,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 02:00:29,177 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-17 02:00:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:29,178 INFO L225 Difference]: With dead ends: 59 [2021-12-17 02:00:29,178 INFO L226 Difference]: Without dead ends: 52 [2021-12-17 02:00:29,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-12-17 02:00:29,179 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:29,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 63 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:00:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-17 02:00:29,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2021-12-17 02:00:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 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-17 02:00:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2021-12-17 02:00:29,183 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2021-12-17 02:00:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:29,183 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-12-17 02:00:29,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-17 02:00:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2021-12-17 02:00:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 02:00:29,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:29,184 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:29,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 02:00:29,395 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-17 02:00:29,396 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:29,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1649883961, now seen corresponding path program 1 times [2021-12-17 02:00:29,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:29,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854963236] [2021-12-17 02:00:29,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:29,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:29,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:29,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854963236] [2021-12-17 02:00:29,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854963236] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:00:29,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781957919] [2021-12-17 02:00:29,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:29,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:29,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:29,552 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-17 02:00:29,553 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-17 02:00:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:29,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 02:00:29,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:29,615 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-17 02:00:29,646 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-17 02:00:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:29,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:29,711 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-17 02:00:29,715 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-17 02:00:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:29,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781957919] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:00:29,731 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:00:29,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2021-12-17 02:00:29,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112393362] [2021-12-17 02:00:29,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:00:29,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 02:00:29,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:29,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 02:00:29,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-12-17 02:00:29,733 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:30,224 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2021-12-17 02:00:30,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 02:00:30,225 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-17 02:00:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:30,226 INFO L225 Difference]: With dead ends: 86 [2021-12-17 02:00:30,226 INFO L226 Difference]: Without dead ends: 72 [2021-12-17 02:00:30,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2021-12-17 02:00:30,232 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 80 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:30,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 79 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 02:00:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-17 02:00:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2021-12-17 02:00:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 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-17 02:00:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2021-12-17 02:00:30,253 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2021-12-17 02:00:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:30,254 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2021-12-17 02:00:30,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2021-12-17 02:00:30,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 02:00:30,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:30,255 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:30,273 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-17 02:00:30,471 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-17 02:00:30,472 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:30,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2021-12-17 02:00:30,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:30,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023113073] [2021-12-17 02:00:30,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:30,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:30,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:30,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023113073] [2021-12-17 02:00:30,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023113073] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:00:30,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960706733] [2021-12-17 02:00:30,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:00:30,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:30,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:30,539 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-17 02:00:30,581 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-17 02:00:30,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:00:30,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:00:30,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 02:00:30,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:30,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:30,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960706733] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:00:30,701 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:00:30,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-17 02:00:30,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047533217] [2021-12-17 02:00:30,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:00:30,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 02:00:30,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:30,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 02:00:30,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 02:00:30,703 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:30,818 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2021-12-17 02:00:30,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:00:30,818 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-17 02:00:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:30,819 INFO L225 Difference]: With dead ends: 85 [2021-12-17 02:00:30,819 INFO L226 Difference]: Without dead ends: 75 [2021-12-17 02:00:30,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 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-17 02:00:30,820 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:30,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 34 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:00:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-17 02:00:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2021-12-17 02:00:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2021-12-17 02:00:30,824 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2021-12-17 02:00:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:30,824 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2021-12-17 02:00:30,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2021-12-17 02:00:30,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 02:00:30,825 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:30,825 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:30,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 02:00:31,039 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-17 02:00:31,040 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2021-12-17 02:00:31,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:31,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671116837] [2021-12-17 02:00:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:31,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:31,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:31,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671116837] [2021-12-17 02:00:31,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671116837] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:00:31,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427162422] [2021-12-17 02:00:31,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:00:31,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:31,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:31,095 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-17 02:00:31,105 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-17 02:00:31,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 02:00:31,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:00:31,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 02:00:31,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:31,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:00:31,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427162422] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:00:31,274 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:00:31,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-17 02:00:31,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010941432] [2021-12-17 02:00:31,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:00:31,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 02:00:31,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:31,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 02:00:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 02:00:31,275 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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-17 02:00:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:31,367 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2021-12-17 02:00:31,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:00:31,368 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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) Word has length 24 [2021-12-17 02:00:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:31,368 INFO L225 Difference]: With dead ends: 78 [2021-12-17 02:00:31,368 INFO L226 Difference]: Without dead ends: 42 [2021-12-17 02:00:31,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-17 02:00:31,369 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:31,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 35 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:00:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-17 02:00:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2021-12-17 02:00:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2021-12-17 02:00:31,372 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2021-12-17 02:00:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:31,372 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-12-17 02:00:31,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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-17 02:00:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2021-12-17 02:00:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 02:00:31,373 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:31,373 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:31,402 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-17 02:00:31,573 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-17 02:00:31,574 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:31,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2021-12-17 02:00:31,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:31,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907675612] [2021-12-17 02:00:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:31,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:00:31,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:31,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907675612] [2021-12-17 02:00:31,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907675612] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:00:31,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60615107] [2021-12-17 02:00:31,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:00:31,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:31,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:31,845 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-17 02:00:31,846 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-17 02:00:31,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:00:31,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:00:31,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-17 02:00:31,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:31,900 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-17 02:00:31,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:00:31,924 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-17 02:00:31,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:00:31,961 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-17 02:00:32,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:00:32,053 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-17 02:00:32,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:00:32,100 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-17 02:00:32,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:00:32,188 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-17 02:00:32,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:00:32,283 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:00:32,283 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-17 02:00:32,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:00:32,403 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:00:32,403 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-17 02:00:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 02:00:32,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:32,955 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_208 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_63| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (let ((.cse3 (* 2 c_~N~0)) (.cse2 (+ .cse0 .cse1 .cse4))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))))))))) is different from false [2021-12-17 02:00:33,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_208 (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_63| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= (div (+ (* .cse2 (- 1)) (* .cse0 (- 1)) (* .cse1 (- 1))) (- 2)) .cse3) (<= .cse3 (div (+ .cse2 .cse0 .cse1) 2)))))))))) is different from false [2021-12-17 02:00:33,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_208 (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (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 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_63| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 2))) (and (<= (div (+ (* .cse1 (- 1)) (* .cse0 (- 1)) (* .cse2 (- 1))) (- 2)) .cse3) (<= .cse3 (div (+ .cse1 .cse0 .cse2) 2)))) (not (= 2 .cse2)))))))) is different from false [2021-12-17 02:00:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2021-12-17 02:00:33,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60615107] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:00:33,808 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:00:33,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 34 [2021-12-17 02:00:33,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949332110] [2021-12-17 02:00:33,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:00:33,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-17 02:00:33,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:33,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-17 02:00:33,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=818, Unknown=3, NotChecked=180, Total=1122 [2021-12-17 02:00:33,810 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:34,377 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2021-12-17 02:00:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-17 02:00:34,378 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-17 02:00:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:34,379 INFO L225 Difference]: With dead ends: 77 [2021-12-17 02:00:34,379 INFO L226 Difference]: Without dead ends: 73 [2021-12-17 02:00:34,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=1450, Unknown=3, NotChecked=246, Total=1980 [2021-12-17 02:00:34,380 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:34,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 136 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 255 Invalid, 0 Unknown, 402 Unchecked, 0.2s Time] [2021-12-17 02:00:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-17 02:00:34,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2021-12-17 02:00:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2021-12-17 02:00:34,385 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 29 [2021-12-17 02:00:34,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:34,385 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2021-12-17 02:00:34,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2021-12-17 02:00:34,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 02:00:34,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:34,386 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:34,405 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-17 02:00:34,602 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-17 02:00:34,603 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:34,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:34,603 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2021-12-17 02:00:34,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:34,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540860947] [2021-12-17 02:00:34,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:34,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:34,612 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:00:34,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313415991] [2021-12-17 02:00:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:34,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:34,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:34,613 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-17 02:00:34,618 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-17 02:00:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:34,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-17 02:00:34,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:34,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-17 02:00:34,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:00:34,771 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-17 02:00:34,792 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-17 02:00:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 02:00:34,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:34,837 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2021-12-17 02:00:34,843 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2021-12-17 02:00:34,872 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:00:34,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2021-12-17 02:00:34,877 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:00:34,878 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-17 02:00:34,880 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-17 02:00:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2021-12-17 02:00:34,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:34,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540860947] [2021-12-17 02:00:34,942 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:00:34,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313415991] [2021-12-17 02:00:34,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313415991] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:00:34,942 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:00:34,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-17 02:00:34,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074285518] [2021-12-17 02:00:34,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:00:34,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-17 02:00:34,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:34,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-17 02:00:34,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2021-12-17 02:00:34,944 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-17 02:00:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:35,124 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2021-12-17 02:00:35,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 02:00:35,125 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-17 02:00:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:35,125 INFO L225 Difference]: With dead ends: 113 [2021-12-17 02:00:35,126 INFO L226 Difference]: Without dead ends: 106 [2021-12-17 02:00:35,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=267, Unknown=2, NotChecked=70, Total=420 [2021-12-17 02:00:35,126 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 73 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:35,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 95 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 290 Invalid, 0 Unknown, 130 Unchecked, 0.1s Time] [2021-12-17 02:00:35,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-17 02:00:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2021-12-17 02:00:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2021-12-17 02:00:35,132 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 29 [2021-12-17 02:00:35,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:35,132 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2021-12-17 02:00:35,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-17 02:00:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2021-12-17 02:00:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 02:00:35,133 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:35,133 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:35,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 02:00:35,343 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-17 02:00:35,343 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:35,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2021-12-17 02:00:35,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:35,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137619597] [2021-12-17 02:00:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:35,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:35,353 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:00:35,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [869223387] [2021-12-17 02:00:35,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:35,354 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:35,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:35,357 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-17 02:00:35,358 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-17 02:00:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:35,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-17 02:00:35,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:35,419 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-17 02:00:35,446 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 02:00:35,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 02:00:35,461 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-17 02:00:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 02:00:35,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:35,535 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 16 treesize of output 14 [2021-12-17 02:00:35,537 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 28 treesize of output 24 [2021-12-17 02:00:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 02:00:35,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:35,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137619597] [2021-12-17 02:00:35,548 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:00:35,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869223387] [2021-12-17 02:00:35,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869223387] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:00:35,548 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:00:35,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-12-17 02:00:35,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77079067] [2021-12-17 02:00:35,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:00:35,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 02:00:35,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:35,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 02:00:35,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-17 02:00:35,552 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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-17 02:00:35,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:35,647 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2021-12-17 02:00:35,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 02:00:35,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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 29 [2021-12-17 02:00:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:35,648 INFO L225 Difference]: With dead ends: 123 [2021-12-17 02:00:35,648 INFO L226 Difference]: Without dead ends: 92 [2021-12-17 02:00:35,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-17 02:00:35,649 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:35,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 53 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:00:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-17 02:00:35,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2021-12-17 02:00:35,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 0 states have call successors, (0), 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-17 02:00:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2021-12-17 02:00:35,655 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 29 [2021-12-17 02:00:35,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:35,655 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2021-12-17 02:00:35,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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-17 02:00:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2021-12-17 02:00:35,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 02:00:35,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:35,656 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:35,677 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-17 02:00:35,867 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-17 02:00:35,867 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:35,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2021-12-17 02:00:35,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:35,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696338618] [2021-12-17 02:00:35,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:35,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 02:00:35,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:35,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696338618] [2021-12-17 02:00:35,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696338618] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:00:35,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345284062] [2021-12-17 02:00:35,925 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:00:35,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:35,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:35,926 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-17 02:00:35,927 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-17 02:00:35,981 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-17 02:00:35,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:00:35,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 02:00:35,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 02:00:36,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 02:00:36,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345284062] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:00:36,119 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:00:36,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 02:00:36,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097773383] [2021-12-17 02:00:36,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:00:36,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 02:00:36,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:36,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 02:00:36,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 02:00:36,120 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:36,286 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2021-12-17 02:00:36,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 02:00:36,287 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-17 02:00:36,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:36,287 INFO L225 Difference]: With dead ends: 115 [2021-12-17 02:00:36,287 INFO L226 Difference]: Without dead ends: 102 [2021-12-17 02:00:36,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 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-17 02:00:36,288 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 74 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:36,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 31 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:00:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-17 02:00:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2021-12-17 02:00:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 0 states have call successors, (0), 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-17 02:00:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2021-12-17 02:00:36,293 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 31 [2021-12-17 02:00:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:36,293 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2021-12-17 02:00:36,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2021-12-17 02:00:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 02:00:36,294 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:36,294 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:36,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 02:00:36,494 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-17 02:00:36,495 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:36,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2021-12-17 02:00:36,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:36,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946836644] [2021-12-17 02:00:36,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:36,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 02:00:36,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:36,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946836644] [2021-12-17 02:00:36,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946836644] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:00:36,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908684578] [2021-12-17 02:00:36,557 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 02:00:36,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:36,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:36,558 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-17 02:00:36,579 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-17 02:00:36,627 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-17 02:00:36,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:00:36,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 02:00:36,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 02:00:36,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 02:00:36,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908684578] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:00:36,789 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:00:36,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 02:00:36,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179593302] [2021-12-17 02:00:36,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:00:36,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 02:00:36,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:36,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 02:00:36,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 02:00:36,791 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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-17 02:00:36,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:36,891 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2021-12-17 02:00:36,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 02:00:36,891 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-17 02:00:36,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:36,891 INFO L225 Difference]: With dead ends: 103 [2021-12-17 02:00:36,891 INFO L226 Difference]: Without dead ends: 50 [2021-12-17 02:00:36,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 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-17 02:00:36,892 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:36,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 26 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:00:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-17 02:00:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2021-12-17 02:00:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-12-17 02:00:36,895 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2021-12-17 02:00:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:36,895 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-12-17 02:00:36,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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-17 02:00:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2021-12-17 02:00:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 02:00:36,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:36,896 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:36,913 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-17 02:00:37,113 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-17 02:00:37,114 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:37,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2021-12-17 02:00:37,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:37,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427841138] [2021-12-17 02:00:37,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:37,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 02:00:37,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:37,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427841138] [2021-12-17 02:00:37,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427841138] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:00:37,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176224152] [2021-12-17 02:00:37,446 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 02:00:37,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:37,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:37,447 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-17 02:00:37,447 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-17 02:00:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:00:37,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-17 02:00:37,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:37,515 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-17 02:00:37,518 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-17 02:00:37,534 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-17 02:00:37,559 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-17 02:00:37,579 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-17 02:00:37,642 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-17 02:00:37,668 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-17 02:00:37,693 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-17 02:00:37,752 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-17 02:00:37,841 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:00:37,841 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-17 02:00:37,965 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:00:37,965 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-17 02:00:38,074 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:00:38,075 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-17 02:00:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 02:00:38,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:49,189 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_438 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_131| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_129| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (not (= 2 .cse2)) (let ((.cse4 (+ .cse5 .cse1 .cse0 .cse2)) (.cse3 (* 2 c_~N~0))) (and (<= .cse3 .cse4) (<= .cse4 .cse3)))))))))) is different from false [2021-12-17 02:00:49,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_438 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_131| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_129| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (let ((.cse2 (* 2 c_~N~0)) (.cse1 (+ .cse3 .cse0 .cse4 .cse5))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= 2 .cse5)) (not (= 2 .cse3))))))))) is different from false [2021-12-17 02:00:52,687 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((v_ArrVal_438 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_438 (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_131| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_129| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (not (= 2 .cse2)) (let ((.cse4 (+ .cse0 .cse2 .cse5 .cse1)) (.cse3 (* 2 ~N~0))) (and (<= .cse3 .cse4) (<= .cse4 .cse3)))))))))))) is different from false [2021-12-17 02:00:53,408 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_438 (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_131| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_129| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 2 .cse1)) (not (= 2 .cse2)) (let ((.cse4 (+ .cse0 .cse2 .cse5 .cse1)) (.cse3 (* 2 ~N~0))) (and (<= .cse3 .cse4) (<= .cse4 .cse3)))))))))) is different from false [2021-12-17 02:00:54,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_438 (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_131| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_129| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 2 .cse1)) (not (= 2 .cse2)) (let ((.cse4 (+ .cse0 .cse2 .cse5 .cse1)) (.cse3 (* 2 ~N~0))) (and (<= .cse3 .cse4) (<= .cse4 .cse3)))))))))) is different from false [2021-12-17 02:00:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 19 not checked. [2021-12-17 02:00:55,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176224152] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:00:55,806 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:00:55,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 17] total 40 [2021-12-17 02:00:55,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776120666] [2021-12-17 02:00:55,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:00:55,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-17 02:00:55,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:55,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-17 02:00:55,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1066, Unknown=12, NotChecked=350, Total=1560 [2021-12-17 02:00:55,823 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 40 states, 40 states have (on average 1.925) internal successors, (77), 40 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:56,799 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2021-12-17 02:00:56,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-17 02:00:56,799 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.925) internal successors, (77), 40 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-17 02:00:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:56,800 INFO L225 Difference]: With dead ends: 94 [2021-12-17 02:00:56,800 INFO L226 Difference]: Without dead ends: 90 [2021-12-17 02:00:56,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 55 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=266, Invalid=1998, Unknown=12, NotChecked=480, Total=2756 [2021-12-17 02:00:56,801 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 905 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:56,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 159 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 505 Invalid, 0 Unknown, 905 Unchecked, 0.3s Time] [2021-12-17 02:00:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-17 02:00:56,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2021-12-17 02:00:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2021-12-17 02:00:56,805 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 37 [2021-12-17 02:00:56,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:56,805 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2021-12-17 02:00:56,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.925) internal successors, (77), 40 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2021-12-17 02:00:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 02:00:56,806 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:56,806 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:56,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-17 02:00:57,011 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-17 02:00:57,011 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:57,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:57,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2021-12-17 02:00:57,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:57,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649380183] [2021-12-17 02:00:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:57,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:57,027 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:00:57,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899321460] [2021-12-17 02:00:57,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:00:57,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:57,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:57,029 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-17 02:00:57,029 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-17 02:00:57,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:00:57,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:00:57,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-17 02:00:57,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:57,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-17 02:00:57,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:00:57,285 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-17 02:00:57,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:00:57,335 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-17 02:00:57,374 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:00:57,374 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 21 treesize of output 21 [2021-12-17 02:00:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:00:57,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:57,539 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_498 (Array Int Int))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_150|) (< (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) c_~N~0) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)))))) is different from false [2021-12-17 02:00:57,570 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_498 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) c_~N~0) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) |v_ULTIMATE.start_main_~i~0#1_150|))) is different from false [2021-12-17 02:00:57,697 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:00:57,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2021-12-17 02:00:57,714 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:00:57,714 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 42 [2021-12-17 02:00:57,718 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 13 treesize of output 7 [2021-12-17 02:00:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-17 02:00:58,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:00:58,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649380183] [2021-12-17 02:00:58,016 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:00:58,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899321460] [2021-12-17 02:00:58,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899321460] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:00:58,016 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:00:58,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2021-12-17 02:00:58,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967428520] [2021-12-17 02:00:58,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:00:58,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-17 02:00:58,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:00:58,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-17 02:00:58,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=800, Unknown=8, NotChecked=122, Total=1122 [2021-12-17 02:00:58,018 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:00:58,537 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2021-12-17 02:00:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-17 02:00:58,538 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-17 02:00:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:00:58,538 INFO L225 Difference]: With dead ends: 114 [2021-12-17 02:00:58,539 INFO L226 Difference]: Without dead ends: 107 [2021-12-17 02:00:58,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=392, Invalid=1413, Unknown=9, NotChecked=166, Total=1980 [2021-12-17 02:00:58,539 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 173 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:00:58,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 60 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 410 Invalid, 0 Unknown, 215 Unchecked, 0.2s Time] [2021-12-17 02:00:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-17 02:00:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2021-12-17 02:00:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 89 states have internal predecessors, (109), 0 states have call successors, (0), 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-17 02:00:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2021-12-17 02:00:58,545 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 37 [2021-12-17 02:00:58,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:00:58,545 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2021-12-17 02:00:58,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:00:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2021-12-17 02:00:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 02:00:58,547 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:00:58,547 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:00:58,563 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-17 02:00:58,747 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-17 02:00:58,748 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:00:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:00:58,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2063837675, now seen corresponding path program 3 times [2021-12-17 02:00:58,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:00:58,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940418757] [2021-12-17 02:00:58,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:00:58,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:00:58,756 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:00:58,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503976665] [2021-12-17 02:00:58,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:00:58,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:00:58,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:00:58,757 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-17 02:00:58,758 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-17 02:00:58,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 02:00:58,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:00:58,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-17 02:00:58,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:00:58,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2021-12-17 02:00:58,918 INFO L354 Elim1Store]: treesize reduction 59, result has 16.9 percent of original size [2021-12-17 02:00:58,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 32 [2021-12-17 02:00:59,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:00:59,025 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 30 treesize of output 30 [2021-12-17 02:00:59,070 INFO L354 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2021-12-17 02:00:59,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 36 [2021-12-17 02:00:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-17 02:00:59,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:00:59,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_553 (Array Int Int))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= c_~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (< (+ |ULTIMATE.start_main_~i~0#1| 2) c_~N~0))) is different from false [2021-12-17 02:01:00,913 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:01:00,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 104 [2021-12-17 02:01:00,917 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 83 treesize of output 79 [2021-12-17 02:01:00,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:01:00,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:00,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:01:00,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 19 [2021-12-17 02:01:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2021-12-17 02:01:00,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:01:00,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940418757] [2021-12-17 02:01:00,964 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:01:00,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503976665] [2021-12-17 02:01:00,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503976665] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:01:00,964 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:01:00,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2021-12-17 02:01:00,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599551984] [2021-12-17 02:01:00,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:01:00,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-17 02:01:00,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:01:00,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-17 02:01:00,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=586, Unknown=7, NotChecked=50, Total=756 [2021-12-17 02:01:00,965 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:01:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:01:05,254 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2021-12-17 02:01:05,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 02:01:05,254 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-17 02:01:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:01:05,255 INFO L225 Difference]: With dead ends: 105 [2021-12-17 02:01:05,255 INFO L226 Difference]: Without dead ends: 101 [2021-12-17 02:01:05,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=186, Invalid=933, Unknown=7, NotChecked=64, Total=1190 [2021-12-17 02:01:05,256 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:01:05,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 63 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 111 Invalid, 0 Unknown, 133 Unchecked, 0.1s Time] [2021-12-17 02:01:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-17 02:01:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2021-12-17 02:01:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 92 states have internal predecessors, (113), 0 states have call successors, (0), 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-17 02:01:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2021-12-17 02:01:05,262 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 37 [2021-12-17 02:01:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:01:05,262 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2021-12-17 02:01:05,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:01:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2021-12-17 02:01:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 02:01:05,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:01:05,263 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:01:05,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-17 02:01:05,467 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-17 02:01:05,468 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:01:05,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:01:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash -204568597, now seen corresponding path program 1 times [2021-12-17 02:01:05,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:01:05,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885596735] [2021-12-17 02:01:05,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:01:05,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:01:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:01:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 02:01:05,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:01:05,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885596735] [2021-12-17 02:01:05,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885596735] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:01:05,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043425505] [2021-12-17 02:01:05,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:01:05,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:01:05,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:01:05,820 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-17 02:01:05,821 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-17 02:01:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:01:05,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-17 02:01:05,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:01:05,944 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-17 02:01:06,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:06,009 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 25 treesize of output 24 [2021-12-17 02:01:06,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:06,052 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 25 treesize of output 24 [2021-12-17 02:01:06,090 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-17 02:01:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 02:01:06,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:01:06,335 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 16 treesize of output 14 [2021-12-17 02:01:06,336 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 28 treesize of output 24 [2021-12-17 02:01:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 02:01:06,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043425505] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:01:06,401 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:01:06,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 34 [2021-12-17 02:01:06,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319262769] [2021-12-17 02:01:06,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:01:06,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-17 02:01:06,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:01:06,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-17 02:01:06,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2021-12-17 02:01:06,402 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:01:07,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:01:07,869 INFO L93 Difference]: Finished difference Result 175 states and 215 transitions. [2021-12-17 02:01:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-12-17 02:01:07,869 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-17 02:01:07,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:01:07,870 INFO L225 Difference]: With dead ends: 175 [2021-12-17 02:01:07,870 INFO L226 Difference]: Without dead ends: 155 [2021-12-17 02:01:07,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=481, Invalid=4489, Unknown=0, NotChecked=0, Total=4970 [2021-12-17 02:01:07,871 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 107 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 02:01:07,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 207 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 02:01:07,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-17 02:01:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 117. [2021-12-17 02:01:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.25) internal successors, (145), 116 states have internal predecessors, (145), 0 states have call successors, (0), 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-17 02:01:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2021-12-17 02:01:07,880 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 37 [2021-12-17 02:01:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:01:07,880 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2021-12-17 02:01:07,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:01:07,880 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2021-12-17 02:01:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 02:01:07,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:01:07,881 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:01:07,900 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-17 02:01:08,091 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-17 02:01:08,091 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:01:08,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:01:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2021-12-17 02:01:08,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:01:08,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358775899] [2021-12-17 02:01:08,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:01:08,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:01:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:01:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 02:01:08,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:01:08,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358775899] [2021-12-17 02:01:08,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358775899] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:01:08,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059805393] [2021-12-17 02:01:08,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:01:08,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:01:08,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:01:08,165 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-17 02:01:08,166 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-17 02:01:08,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:01:08,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:01:08,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 02:01:08,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:01:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 02:01:08,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:01:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 02:01:08,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059805393] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:01:08,416 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:01:08,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-17 02:01:08,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345377482] [2021-12-17 02:01:08,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:01:08,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 02:01:08,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:01:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 02:01:08,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-17 02:01:08,418 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:01:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:01:08,705 INFO L93 Difference]: Finished difference Result 162 states and 205 transitions. [2021-12-17 02:01:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 02:01:08,706 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-17 02:01:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:01:08,706 INFO L225 Difference]: With dead ends: 162 [2021-12-17 02:01:08,706 INFO L226 Difference]: Without dead ends: 141 [2021-12-17 02:01:08,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 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-17 02:01:08,707 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 115 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:01:08,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 30 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 02:01:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-17 02:01:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2021-12-17 02:01:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 0 states have call successors, (0), 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-17 02:01:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2021-12-17 02:01:08,714 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 39 [2021-12-17 02:01:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:01:08,714 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2021-12-17 02:01:08,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:01:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2021-12-17 02:01:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 02:01:08,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:01:08,714 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:01:08,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-17 02:01:08,923 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-17 02:01:08,923 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:01:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:01:08,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2021-12-17 02:01:08,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:01:08,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775575072] [2021-12-17 02:01:08,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:01:08,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:01:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:01:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 02:01:08,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:01:08,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775575072] [2021-12-17 02:01:08,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775575072] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:01:08,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101250645] [2021-12-17 02:01:08,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:01:08,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:01:08,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:01:08,991 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-17 02:01:08,992 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-17 02:01:09,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-17 02:01:09,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:01:09,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 02:01:09,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:01:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 02:01:09,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:01:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 02:01:09,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101250645] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:01:09,230 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:01:09,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-17 02:01:09,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124323869] [2021-12-17 02:01:09,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:01:09,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 02:01:09,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:01:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 02:01:09,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-17 02:01:09,231 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:01:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:01:09,394 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2021-12-17 02:01:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 02:01:09,395 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-17 02:01:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:01:09,395 INFO L225 Difference]: With dead ends: 131 [2021-12-17 02:01:09,395 INFO L226 Difference]: Without dead ends: 58 [2021-12-17 02:01:09,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 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-17 02:01:09,396 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 74 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:01:09,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 34 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:01:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-17 02:01:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-12-17 02:01:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:01:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2021-12-17 02:01:09,408 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 40 [2021-12-17 02:01:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:01:09,408 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2021-12-17 02:01:09,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:01:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2021-12-17 02:01:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-17 02:01:09,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:01:09,409 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:01:09,425 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-17 02:01:09,611 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-17 02:01:09,611 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:01:09,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:01:09,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2021-12-17 02:01:09,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:01:09,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190132930] [2021-12-17 02:01:09,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:01:09,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:01:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:01:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 02:01:10,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:01:10,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190132930] [2021-12-17 02:01:10,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190132930] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:01:10,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950117822] [2021-12-17 02:01:10,084 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:01:10,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:01:10,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:01:10,085 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-17 02:01:10,086 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-17 02:01:10,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:01:10,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:01:10,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-17 02:01:10,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:01:10,170 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-17 02:01:10,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:10,204 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-17 02:01:10,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:10,245 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-17 02:01:10,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:10,287 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-17 02:01:10,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:10,342 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-17 02:01:10,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:10,475 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-17 02:01:10,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:10,505 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-17 02:01:10,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:10,546 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-17 02:01:10,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:10,573 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-17 02:01:10,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:10,657 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-17 02:01:10,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:10,777 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:01:10,777 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-17 02:01:10,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:10,923 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:01:10,924 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-17 02:01:11,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:11,076 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:01:11,076 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-17 02:01:11,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:01:11,209 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:01:11,209 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-17 02:01:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-17 02:01:11,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:01:35,264 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_242| Int) (|v_ULTIMATE.start_main_~i~0#1_244| Int) (|v_ULTIMATE.start_main_~i~0#1_240| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_789 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_244| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_240| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (not (= 2 .cse2)) (not (= 2 .cse3)) (let ((.cse5 (* 2 c_~N~0)) (.cse4 (+ .cse1 .cse6 .cse2 .cse3 .cse0))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))))))))))) is different from false [2021-12-17 02:01:38,854 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_242| Int) (|v_ULTIMATE.start_main_~i~0#1_244| Int) (|v_ULTIMATE.start_main_~i~0#1_240| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_789 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_244| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_240| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (let ((.cse2 (+ .cse3 .cse4 .cse5 .cse0 .cse6)) (.cse1 (* 2 c_~N~0))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= 2 .cse6)) (not (= 2 .cse5)) (not (= 2 .cse4)))))))))) is different from false [2021-12-17 02:02:04,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_242| Int) (|v_ULTIMATE.start_main_~i~0#1_252| Int) (|v_ULTIMATE.start_main_~i~0#1_244| Int) (|v_ULTIMATE.start_main_~i~0#1_240| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_789 (+ (* |v_ULTIMATE.start_main_~i~0#1_252| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_244| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_240| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (let ((.cse3 (+ .cse0 .cse4 .cse1 .cse5 .cse6)) (.cse2 (* 2 ~N~0))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 2 .cse5)) (not (= 2 .cse6)))))))))) (<= ~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-17 02:02:10,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_242| Int) (|v_ULTIMATE.start_main_~i~0#1_252| Int) (|v_ULTIMATE.start_main_~i~0#1_244| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_240| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_789 (+ (* |v_ULTIMATE.start_main_~i~0#1_252| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_244| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_240| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 2 .cse1)) (let ((.cse3 (+ .cse0 .cse4 .cse1 .cse5 .cse6)) (.cse2 (* 2 ~N~0))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 2 .cse5)) (not (= 2 .cse6)))))))))) is different from false [2021-12-17 02:02:25,526 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_242| Int) (|v_ULTIMATE.start_main_~i~0#1_252| Int) (|v_ULTIMATE.start_main_~i~0#1_244| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_240| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_789 (+ (* |v_ULTIMATE.start_main_~i~0#1_252| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_244| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_240| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= 2 .cse0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 2 .cse1)) (let ((.cse3 (+ .cse0 .cse4 .cse1 .cse5 .cse6)) (.cse2 (* 2 ~N~0))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 2 .cse5)) (not (= 2 .cse6)))))))))) is different from false [2021-12-17 02:02:44,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_242| Int) (|v_ULTIMATE.start_main_~i~0#1_252| Int) (|v_ULTIMATE.start_main_~i~0#1_244| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_240| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_789 (+ (* |v_ULTIMATE.start_main_~i~0#1_252| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_244| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_240| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (not (= 2 .cse0)) (not (= 2 .cse1)) (let ((.cse3 (+ .cse0 .cse4 .cse1 .cse5 .cse6)) (.cse2 (* 2 ~N~0))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 2 .cse5)) (not (= 2 .cse6)))))))))) is different from false [2021-12-17 02:02:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 33 not checked. [2021-12-17 02:02:57,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950117822] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:02:57,294 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:02:57,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 20] total 55 [2021-12-17 02:02:57,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150359240] [2021-12-17 02:02:57,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:02:57,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-17 02:02:57,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:02:57,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-17 02:02:57,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2172, Unknown=14, NotChecked=594, Total=2970 [2021-12-17 02:02:57,296 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 55 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 55 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:03:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:03:00,222 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2021-12-17 02:03:00,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-17 02:03:00,223 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 55 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-17 02:03:00,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:03:00,223 INFO L225 Difference]: With dead ends: 124 [2021-12-17 02:03:00,223 INFO L226 Difference]: Without dead ends: 120 [2021-12-17 02:03:00,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 74 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=540, Invalid=4300, Unknown=14, NotChecked=846, Total=5700 [2021-12-17 02:03:00,225 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 726 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 02:03:00,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 197 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 577 Invalid, 0 Unknown, 726 Unchecked, 0.3s Time] [2021-12-17 02:03:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-17 02:03:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2021-12-17 02:03:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 111 states have internal predecessors, (140), 0 states have call successors, (0), 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-17 02:03:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 140 transitions. [2021-12-17 02:03:00,234 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 140 transitions. Word has length 45 [2021-12-17 02:03:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:03:00,234 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 140 transitions. [2021-12-17 02:03:00,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 55 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:03:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 140 transitions. [2021-12-17 02:03:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-17 02:03:00,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:03:00,235 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:03:00,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-17 02:03:00,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:03:00,439 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:03:00,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:03:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2054602352, now seen corresponding path program 4 times [2021-12-17 02:03:00,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:03:00,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346939390] [2021-12-17 02:03:00,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:03:00,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:03:00,449 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:03:00,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088627624] [2021-12-17 02:03:00,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:03:00,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:03:00,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:03:00,451 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:03:00,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-17 02:03:00,527 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:03:00,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:03:00,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-17 02:03:00,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:03:00,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-17 02:03:00,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:03:00,707 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-17 02:03:00,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:03:00,745 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-17 02:03:00,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:03:00,781 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-17 02:03:00,811 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-17 02:03:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 02:03:00,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:03:00,876 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) is different from false [2021-12-17 02:03:00,882 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 2)) is different from false [2021-12-17 02:03:00,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 12)) 2)) is different from false [2021-12-17 02:03:00,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) 2)) is different from false [2021-12-17 02:03:00,939 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:03:00,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2021-12-17 02:03:00,943 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:03:00,944 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 40 treesize of output 40 [2021-12-17 02:03:00,946 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-17 02:03:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 22 not checked. [2021-12-17 02:03:01,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:03:01,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346939390] [2021-12-17 02:03:01,068 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:03:01,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088627624] [2021-12-17 02:03:01,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088627624] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:03:01,068 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:03:01,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2021-12-17 02:03:01,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041634878] [2021-12-17 02:03:01,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:03:01,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-17 02:03:01,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:03:01,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-17 02:03:01,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2021-12-17 02:03:01,069 INFO L87 Difference]: Start difference. First operand 112 states and 140 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:03:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:03:01,459 INFO L93 Difference]: Finished difference Result 176 states and 223 transitions. [2021-12-17 02:03:01,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 02:03:01,460 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-17 02:03:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:03:01,461 INFO L225 Difference]: With dead ends: 176 [2021-12-17 02:03:01,461 INFO L226 Difference]: Without dead ends: 169 [2021-12-17 02:03:01,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=495, Unknown=4, NotChecked=196, Total=812 [2021-12-17 02:03:01,462 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 88 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 02:03:01,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 83 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 427 Invalid, 0 Unknown, 345 Unchecked, 0.3s Time] [2021-12-17 02:03:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-17 02:03:01,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 142. [2021-12-17 02:03:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 141 states have internal predecessors, (178), 0 states have call successors, (0), 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-17 02:03:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2021-12-17 02:03:01,479 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 45 [2021-12-17 02:03:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:03:01,479 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2021-12-17 02:03:01,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:03:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2021-12-17 02:03:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-17 02:03:01,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:03:01,480 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:03:01,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-17 02:03:01,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:03:01,684 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:03:01,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:03:01,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1431802284, now seen corresponding path program 5 times [2021-12-17 02:03:01,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:03:01,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237703306] [2021-12-17 02:03:01,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:03:01,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:03:01,694 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:03:01,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [417968512] [2021-12-17 02:03:01,695 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:03:01,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:03:01,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:03:01,696 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:03:01,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-17 02:03:01,855 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-17 02:03:01,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:03:01,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-17 02:03:01,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:03:01,864 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-17 02:03:01,930 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 37 treesize of output 17 [2021-12-17 02:03:01,973 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 02:03:01,973 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 02:03:02,012 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-17 02:03:02,041 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-17 02:03:02,065 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-17 02:03:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 02:03:02,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:03:02,126 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) is different from false [2021-12-17 02:03:02,132 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 2)) is different from false [2021-12-17 02:03:02,140 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 2)) is different from false [2021-12-17 02:03:02,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 2)) is different from false [2021-12-17 02:03:02,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_289| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_289| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_289| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 2)))) is different from false [2021-12-17 02:03:02,974 INFO L354 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2021-12-17 02:03:02,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2021-12-17 02:03:02,980 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:03:02,980 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-17 02:03:02,982 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-17 02:03:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 22 not checked. [2021-12-17 02:03:03,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:03:03,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237703306] [2021-12-17 02:03:03,034 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:03:03,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417968512] [2021-12-17 02:03:03,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417968512] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:03:03,034 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:03:03,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2021-12-17 02:03:03,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242505301] [2021-12-17 02:03:03,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:03:03,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 02:03:03,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:03:03,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 02:03:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=253, Unknown=5, NotChecked=180, Total=506 [2021-12-17 02:03:03,035 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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-17 02:03:05,111 WARN L838 $PredicateComparison]: unable to prove that (and (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_289| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_289| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_289| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 2)))) (= |c_ULTIMATE.start_main_~i~0#1| 2)) is different from false [2021-12-17 02:03:07,133 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 2)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_289| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_289| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_289| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 2)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 2)) is different from false [2021-12-17 02:03:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:03:07,310 INFO L93 Difference]: Finished difference Result 235 states and 305 transitions. [2021-12-17 02:03:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 02:03:07,311 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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 45 [2021-12-17 02:03:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:03:07,319 INFO L225 Difference]: With dead ends: 235 [2021-12-17 02:03:07,319 INFO L226 Difference]: Without dead ends: 209 [2021-12-17 02:03:07,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=93, Invalid=348, Unknown=7, NotChecked=308, Total=756 [2021-12-17 02:03:07,320 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:03:07,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 86 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 312 Invalid, 0 Unknown, 273 Unchecked, 0.2s Time] [2021-12-17 02:03:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-17 02:03:07,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 188. [2021-12-17 02:03:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.2566844919786095) internal successors, (235), 187 states have internal predecessors, (235), 0 states have call successors, (0), 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-17 02:03:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 235 transitions. [2021-12-17 02:03:07,334 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 235 transitions. Word has length 45 [2021-12-17 02:03:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:03:07,334 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 235 transitions. [2021-12-17 02:03:07,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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-17 02:03:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 235 transitions. [2021-12-17 02:03:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-17 02:03:07,335 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:03:07,335 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:03:07,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-17 02:03:07,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:03:07,539 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:03:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:03:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1853695216, now seen corresponding path program 6 times [2021-12-17 02:03:07,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:03:07,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826671653] [2021-12-17 02:03:07,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:03:07,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:03:07,547 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:03:07,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1357605890] [2021-12-17 02:03:07,548 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 02:03:07,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:03:07,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:03:07,549 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:03:07,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-17 02:03:07,666 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-17 02:03:07,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:03:07,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-17 02:03:07,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:03:07,675 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-17 02:03:07,729 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 37 treesize of output 17 [2021-12-17 02:03:07,781 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 02:03:07,781 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 02:03:07,818 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 02:03:07,818 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 02:03:07,874 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-17 02:03:07,909 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-17 02:03:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-17 02:03:07,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:03:07,976 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) is different from false [2021-12-17 02:03:07,982 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) is different from false [2021-12-17 02:03:07,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) is different from false [2021-12-17 02:03:08,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_308| Int)) (or (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) (< |v_ULTIMATE.start_main_~i~0#1_308| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:03:08,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_308| Int) (v_ArrVal_999 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_999) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2) (< |v_ULTIMATE.start_main_~i~0#1_308| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:03:08,057 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_309| Int)) (or (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_308| Int) (v_ArrVal_999 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_308| (+ |v_ULTIMATE.start_main_~i~0#1_309| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_309| 4)) v_ArrVal_999) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2))) (< |v_ULTIMATE.start_main_~i~0#1_309| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:03:08,136 INFO L354 Elim1Store]: treesize reduction 122, result has 24.2 percent of original size [2021-12-17 02:03:08,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 55 [2021-12-17 02:03:08,151 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:03:08,151 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-17 02:03:08,153 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-17 02:03:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 22 not checked. [2021-12-17 02:03:08,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:03:08,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826671653] [2021-12-17 02:03:08,194 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:03:08,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357605890] [2021-12-17 02:03:08,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357605890] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:03:08,194 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:03:08,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2021-12-17 02:03:08,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710019072] [2021-12-17 02:03:08,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:03:08,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 02:03:08,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:03:08,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 02:03:08,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=222, Unknown=6, NotChecked=210, Total=506 [2021-12-17 02:03:08,195 INFO L87 Difference]: Start difference. First operand 188 states and 235 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 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-17 02:03:10,248 WARN L838 $PredicateComparison]: unable to prove that (and (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_309| Int)) (or (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_308| Int) (v_ArrVal_999 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_308| (+ |v_ULTIMATE.start_main_~i~0#1_309| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_309| 4)) v_ArrVal_999) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2))) (< |v_ULTIMATE.start_main_~i~0#1_309| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2021-12-17 02:03:12,276 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_308| Int)) (or (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) (< |v_ULTIMATE.start_main_~i~0#1_308| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_309| Int)) (or (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_308| Int) (v_ArrVal_999 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_308| (+ |v_ULTIMATE.start_main_~i~0#1_309| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_309| 4)) v_ArrVal_999) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2))) (< |v_ULTIMATE.start_main_~i~0#1_309| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2021-12-17 02:03:14,309 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_308| Int)) (or (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) (< |v_ULTIMATE.start_main_~i~0#1_308| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (forall ((v_ArrVal_1003 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_309| Int)) (or (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_308| Int) (v_ArrVal_999 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_308| (+ |v_ULTIMATE.start_main_~i~0#1_309| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_309| 4)) v_ArrVal_999) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2))) (< |v_ULTIMATE.start_main_~i~0#1_309| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2021-12-17 02:03:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:03:14,481 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2021-12-17 02:03:14,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 02:03:14,481 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 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 45 [2021-12-17 02:03:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:03:14,482 INFO L225 Difference]: With dead ends: 219 [2021-12-17 02:03:14,482 INFO L226 Difference]: Without dead ends: 176 [2021-12-17 02:03:14,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 65 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=83, Invalid=250, Unknown=9, NotChecked=360, Total=702 [2021-12-17 02:03:14,483 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:03:14,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 58 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 303 Invalid, 0 Unknown, 258 Unchecked, 0.2s Time] [2021-12-17 02:03:14,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-17 02:03:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 159. [2021-12-17 02:03:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 158 states have internal predecessors, (190), 0 states have call successors, (0), 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-17 02:03:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 190 transitions. [2021-12-17 02:03:14,495 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 190 transitions. Word has length 45 [2021-12-17 02:03:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:03:14,495 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 190 transitions. [2021-12-17 02:03:14,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 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-17 02:03:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 190 transitions. [2021-12-17 02:03:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-17 02:03:14,496 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:03:14,496 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:03:14,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-17 02:03:14,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-17 02:03:14,703 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:03:14,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:03:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1422716494, now seen corresponding path program 2 times [2021-12-17 02:03:14,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:03:14,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733992630] [2021-12-17 02:03:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:03:14,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:03:14,712 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:03:14,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568280840] [2021-12-17 02:03:14,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:03:14,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:03:14,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:03:14,713 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:03:14,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-17 02:03:14,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:03:14,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:03:14,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-17 02:03:14,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:03:14,843 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-17 02:03:14,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:03:14,880 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 25 treesize of output 24 [2021-12-17 02:03:14,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:03:14,907 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 25 treesize of output 24 [2021-12-17 02:03:14,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:03:14,938 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 25 treesize of output 24 [2021-12-17 02:03:14,956 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-17 02:03:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-17 02:03:14,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:03:15,157 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 16 treesize of output 14 [2021-12-17 02:03:15,160 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 28 treesize of output 24 [2021-12-17 02:03:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-17 02:03:15,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:03:15,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733992630] [2021-12-17 02:03:15,217 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:03:15,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568280840] [2021-12-17 02:03:15,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568280840] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:03:15,217 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:03:15,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-12-17 02:03:15,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574135302] [2021-12-17 02:03:15,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:03:15,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 02:03:15,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:03:15,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 02:03:15,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2021-12-17 02:03:15,223 INFO L87 Difference]: Start difference. First operand 159 states and 190 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:03:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:03:15,547 INFO L93 Difference]: Finished difference Result 232 states and 278 transitions. [2021-12-17 02:03:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-17 02:03:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-17 02:03:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:03:15,548 INFO L225 Difference]: With dead ends: 232 [2021-12-17 02:03:15,548 INFO L226 Difference]: Without dead ends: 157 [2021-12-17 02:03:15,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2021-12-17 02:03:15,549 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 02:03:15,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 92 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 02:03:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-17 02:03:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2021-12-17 02:03:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.1830985915492958) internal successors, (168), 142 states have internal predecessors, (168), 0 states have call successors, (0), 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-17 02:03:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 168 transitions. [2021-12-17 02:03:15,559 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 168 transitions. Word has length 45 [2021-12-17 02:03:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:03:15,559 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 168 transitions. [2021-12-17 02:03:15,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:03:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 168 transitions. [2021-12-17 02:03:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-17 02:03:15,560 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:03:15,560 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:03:15,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-17 02:03:15,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-17 02:03:15,761 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:03:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:03:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1510143892, now seen corresponding path program 11 times [2021-12-17 02:03:15,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:03:15,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253877402] [2021-12-17 02:03:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:03:15,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:03:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:03:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-17 02:03:15,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:03:15,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253877402] [2021-12-17 02:03:15,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253877402] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:03:15,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715870378] [2021-12-17 02:03:15,852 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:03:15,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:03:15,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:03:15,853 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:03:15,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-17 02:03:15,968 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-17 02:03:15,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:03:15,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 02:03:15,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:03:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-17 02:03:16,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:03:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-17 02:03:16,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715870378] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:03:16,197 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:03:16,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-17 02:03:16,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123930750] [2021-12-17 02:03:16,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:03:16,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-17 02:03:16,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:03:16,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-17 02:03:16,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-17 02:03:16,199 INFO L87 Difference]: Start difference. First operand 143 states and 168 transitions. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 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-17 02:03:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:03:16,656 INFO L93 Difference]: Finished difference Result 171 states and 201 transitions. [2021-12-17 02:03:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 02:03:16,657 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 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 47 [2021-12-17 02:03:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:03:16,658 INFO L225 Difference]: With dead ends: 171 [2021-12-17 02:03:16,658 INFO L226 Difference]: Without dead ends: 152 [2021-12-17 02:03:16,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 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-17 02:03:16,658 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 02:03:16,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 46 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 02:03:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-17 02:03:16,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2021-12-17 02:03:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 121 states have internal predecessors, (145), 0 states have call successors, (0), 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-17 02:03:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2021-12-17 02:03:16,667 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 47 [2021-12-17 02:03:16,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:03:16,668 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2021-12-17 02:03:16,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 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-17 02:03:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2021-12-17 02:03:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 02:03:16,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:03:16,668 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:03:16,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-17 02:03:16,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:03:16,869 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:03:16,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:03:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash -220752601, now seen corresponding path program 12 times [2021-12-17 02:03:16,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:03:16,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095865880] [2021-12-17 02:03:16,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:03:16,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:03:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:03:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-17 02:03:16,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:03:16,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095865880] [2021-12-17 02:03:16,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095865880] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:03:16,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123331852] [2021-12-17 02:03:16,971 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 02:03:16,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:03:16,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:03:16,972 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:03:16,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-17 02:03:17,093 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-17 02:03:17,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:03:17,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 02:03:17,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:03:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 02:03:17,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:03:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 02:03:17,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123331852] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:03:17,306 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:03:17,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-17 02:03:17,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696645822] [2021-12-17 02:03:17,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:03:17,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-17 02:03:17,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:03:17,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-17 02:03:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-17 02:03:17,307 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:03:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:03:17,505 INFO L93 Difference]: Finished difference Result 158 states and 185 transitions. [2021-12-17 02:03:17,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 02:03:17,506 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-17 02:03:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:03:17,506 INFO L225 Difference]: With dead ends: 158 [2021-12-17 02:03:17,506 INFO L226 Difference]: Without dead ends: 76 [2021-12-17 02:03:17,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 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-17 02:03:17,507 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 80 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:03:17,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 40 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 02:03:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-17 02:03:17,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2021-12-17 02:03:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:03:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2021-12-17 02:03:17,512 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 48 [2021-12-17 02:03:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:03:17,512 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2021-12-17 02:03:17,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:03:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2021-12-17 02:03:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-17 02:03:17,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:03:17,513 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:03:17,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-12-17 02:03:17,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:03:17,723 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:03:17,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:03:17,724 INFO L85 PathProgramCache]: Analyzing trace with hash 663114381, now seen corresponding path program 13 times [2021-12-17 02:03:17,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:03:17,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481908747] [2021-12-17 02:03:17,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:03:17,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:03:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:03:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-17 02:03:18,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:03:18,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481908747] [2021-12-17 02:03:18,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481908747] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:03:18,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084712989] [2021-12-17 02:03:18,396 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 02:03:18,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:03:18,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:03:18,397 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:03:18,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-17 02:03:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:03:18,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 78 conjunts are in the unsatisfiable core [2021-12-17 02:03:18,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:03:18,494 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-17 02:03:18,497 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-17 02:03:18,504 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-17 02:03:18,519 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-17 02:03:18,545 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-17 02:03:18,567 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-17 02:03:18,586 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-17 02:03:18,666 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-17 02:03:18,689 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-17 02:03:18,712 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-17 02:03:18,734 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-17 02:03:18,756 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-17 02:03:18,826 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-17 02:03:18,937 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:03:18,938 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-17 02:03:19,082 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:03:19,084 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-17 02:03:19,218 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:03:19,218 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-17 02:03:19,362 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:03:19,362 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-17 02:03:19,507 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:03:19,507 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-17 02:03:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-17 02:03:19,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:06:30,634 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_396| Int) (|v_ULTIMATE.start_main_~i~0#1_398| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1293 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_1293 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_398| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_396| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_394| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0 .cse6 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_392| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (let ((.cse3 (* 2 c_~N~0)) (.cse2 (+ .cse4 .cse5 .cse0 .cse6 .cse1 .cse7))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 2 .cse6)) (not (= 2 .cse5)) (not (= 2 .cse7))))))))))) is different from false [2021-12-17 02:09:47,867 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_396| Int) (|v_ULTIMATE.start_main_~i~0#1_398| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1293 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_1293 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_398| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_396| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_394| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0 .cse6 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_392| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (let ((.cse3 (+ .cse4 .cse5 .cse0 .cse6 .cse1 .cse7)) (.cse2 (* 2 c_~N~0))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 2 .cse6)) (not (= 2 .cse5)) (not (= 2 .cse7))))))))))) is different from false [2021-12-17 02:12:19,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_396| Int) (|v_ULTIMATE.start_main_~i~0#1_398| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1293 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_1293 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_398| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_396| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_394| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0 .cse6 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_392| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (let ((.cse3 (* 2 c_~N~0)) (.cse2 (+ .cse4 .cse5 .cse0 .cse6 .cse1 .cse7))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 2 .cse5)) (not (= 2 .cse6)) (not (= 2 .cse7))))))))))) is different from false Killed by 15