./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ms5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/ms5.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 5d49931b392f3e5db08af1630b313adf7396c4587f1a053ae0de1991b384d39a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:09:57,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:09:57,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:09:57,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:09:57,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:09:57,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:09:57,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:09:57,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:09:57,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:09:57,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:09:57,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:09:57,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:09:57,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:09:57,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:09:57,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:09:57,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:09:57,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:09:57,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:09:57,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:09:57,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:09:57,678 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:09:57,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:09:57,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:09:57,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:09:57,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:09:57,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:09:57,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:09:57,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:09:57,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:09:57,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:09:57,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:09:57,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:09:57,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:09:57,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:09:57,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:09:57,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:09:57,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:09:57,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:09:57,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:09:57,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:09:57,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:09:57,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:09:57,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:09:57,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:09:57,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:09:57,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:09:57,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:09:57,735 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:09:57,735 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:09:57,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:09:57,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:09:57,736 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:09:57,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:09:57,738 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:09:57,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:09:57,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:09:57,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:09:57,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:09:57,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:09:57,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:09:57,739 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:09:57,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:09:57,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:09:57,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:09:57,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:09:57,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:09:57,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:09:57,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:09:57,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:09:57,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:09:57,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:09:57,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:09:57,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:09:57,742 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:09:57,742 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:09:57,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:09:57,742 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 -> 5d49931b392f3e5db08af1630b313adf7396c4587f1a053ae0de1991b384d39a [2022-07-13 11:09:57,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:09:57,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:09:57,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:09:57,988 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:09:57,989 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:09:57,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ms5.c [2022-07-13 11:09:58,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e30038f8/02b6fff29fbb49f5a04116a8f4b6f3bc/FLAGfc07d3a13 [2022-07-13 11:09:58,426 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:09:58,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms5.c [2022-07-13 11:09:58,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e30038f8/02b6fff29fbb49f5a04116a8f4b6f3bc/FLAGfc07d3a13 [2022-07-13 11:09:58,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e30038f8/02b6fff29fbb49f5a04116a8f4b6f3bc [2022-07-13 11:09:58,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:09:58,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:09:58,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:09:58,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:09:58,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:09:58,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:09:58" (1/1) ... [2022-07-13 11:09:58,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56be1425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58, skipping insertion in model container [2022-07-13 11:09:58,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:09:58" (1/1) ... [2022-07-13 11:09:58,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:09:58,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:09:58,605 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/ms5.c[586,599] [2022-07-13 11:09:58,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:09:58,628 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:09:58,637 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/ms5.c[586,599] [2022-07-13 11:09:58,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:09:58,654 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:09:58,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58 WrapperNode [2022-07-13 11:09:58,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:09:58,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:09:58,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:09:58,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:09:58,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58" (1/1) ... [2022-07-13 11:09:58,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58" (1/1) ... [2022-07-13 11:09:58,687 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-07-13 11:09:58,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:09:58,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:09:58,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:09:58,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:09:58,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58" (1/1) ... [2022-07-13 11:09:58,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58" (1/1) ... [2022-07-13 11:09:58,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58" (1/1) ... [2022-07-13 11:09:58,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58" (1/1) ... [2022-07-13 11:09:58,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58" (1/1) ... [2022-07-13 11:09:58,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58" (1/1) ... [2022-07-13 11:09:58,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58" (1/1) ... [2022-07-13 11:09:58,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:09:58,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:09:58,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:09:58,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:09:58,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58" (1/1) ... [2022-07-13 11:09:58,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:09:58,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:09:58,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:09:58,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:09:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:09:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:09:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:09:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:09:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:09:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:09:58,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:09:58,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:09:58,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:09:58,826 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:09:58,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:09:58,935 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:09:58,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:09:58,941 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 11:09:58,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:09:58 BoogieIcfgContainer [2022-07-13 11:09:58,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:09:58,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:09:58,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:09:58,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:09:58,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:09:58" (1/3) ... [2022-07-13 11:09:58,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f520bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:09:58, skipping insertion in model container [2022-07-13 11:09:58,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:09:58" (2/3) ... [2022-07-13 11:09:58,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f520bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:09:58, skipping insertion in model container [2022-07-13 11:09:58,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:09:58" (3/3) ... [2022-07-13 11:09:58,950 INFO L111 eAbstractionObserver]: Analyzing ICFG ms5.c [2022-07-13 11:09:58,963 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:09:58,963 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:09:59,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:09:59,009 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@78d463a3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4657943b [2022-07-13 11:09:59,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:09:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:09:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 11:09:59,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:09:59,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:09:59,020 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:09:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:09:59,025 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-07-13 11:09:59,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:09:59,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702651609] [2022-07-13 11:09:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:09:59,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:09:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:09:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:09:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:09:59,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702651609] [2022-07-13 11:09:59,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702651609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:09:59,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:09:59,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:09:59,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988632826] [2022-07-13 11:09:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:09:59,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:09:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:09:59,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:09:59,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:09:59,283 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:09:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:09:59,298 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-07-13 11:09:59,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:09:59,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 11:09:59,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:09:59,307 INFO L225 Difference]: With dead ends: 34 [2022-07-13 11:09:59,307 INFO L226 Difference]: Without dead ends: 15 [2022-07-13 11:09:59,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:09:59,320 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:09:59,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:09:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-13 11:09:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 11:09:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:09:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-13 11:09:59,351 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-07-13 11:09:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:09:59,352 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-13 11:09:59,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:09:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-13 11:09:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 11:09:59,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:09:59,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:09:59,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:09:59,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:09:59,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:09:59,358 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-07-13 11:09:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:09:59,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393914124] [2022-07-13 11:09:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:09:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:09:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:09:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:09:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:09:59,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393914124] [2022-07-13 11:09:59,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393914124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:09:59,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:09:59,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:09:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082582000] [2022-07-13 11:09:59,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:09:59,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:09:59,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:09:59,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:09:59,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:09:59,508 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:09:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:09:59,562 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-07-13 11:09:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:09:59,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 11:09:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:09:59,564 INFO L225 Difference]: With dead ends: 28 [2022-07-13 11:09:59,565 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 11:09:59,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:09:59,567 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:09:59,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:09:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 11:09:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-13 11:09:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:09:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-07-13 11:09:59,581 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2022-07-13 11:09:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:09:59,582 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-13 11:09:59,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:09:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-07-13 11:09:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:09:59,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:09:59,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:09:59,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:09:59,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:09:59,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:09:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-07-13 11:09:59,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:09:59,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013590060] [2022-07-13 11:09:59,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:09:59,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:09:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:09:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:09:59,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:09:59,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013590060] [2022-07-13 11:09:59,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013590060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:09:59,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:09:59,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:09:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628947065] [2022-07-13 11:09:59,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:09:59,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:09:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:09:59,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:09:59,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:09:59,709 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:09:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:09:59,763 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-13 11:09:59,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:09:59,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 11:09:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:09:59,766 INFO L225 Difference]: With dead ends: 25 [2022-07-13 11:09:59,767 INFO L226 Difference]: Without dead ends: 21 [2022-07-13 11:09:59,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:09:59,774 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:09:59,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 25 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:09:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-13 11:09:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-13 11:09:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:09:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-07-13 11:09:59,781 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2022-07-13 11:09:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:09:59,781 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-13 11:09:59,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:09:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-07-13 11:09:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 11:09:59,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:09:59,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:09:59,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:09:59,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:09:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:09:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash -422196611, now seen corresponding path program 1 times [2022-07-13 11:09:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:09:59,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937265447] [2022-07-13 11:09:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:09:59,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:09:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:09:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:09:59,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:09:59,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937265447] [2022-07-13 11:09:59,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937265447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:09:59,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222209641] [2022-07-13 11:09:59,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:09:59,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:09:59,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:09:59,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:09:59,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:09:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:09:59,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:09:59,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:10:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:00,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:10:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:00,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222209641] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:10:00,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:10:00,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:10:00,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873860759] [2022-07-13 11:10:00,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:10:00,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:10:00,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:10:00,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:10:00,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:10:00,059 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:00,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:10:00,175 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-13 11:10:00,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:10:00,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 11:10:00,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:10:00,178 INFO L225 Difference]: With dead ends: 39 [2022-07-13 11:10:00,178 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 11:10:00,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:10:00,187 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:10:00,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:10:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 11:10:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-07-13 11:10:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-13 11:10:00,197 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-07-13 11:10:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:10:00,198 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-13 11:10:00,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-13 11:10:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:10:00,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:10:00,200 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:10:00,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:10:00,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:10:00,412 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:10:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:10:00,412 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 2 times [2022-07-13 11:10:00,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:10:00,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748534612] [2022-07-13 11:10:00,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:10:00,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:10:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:10:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:00,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:10:00,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748534612] [2022-07-13 11:10:00,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748534612] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:10:00,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313596592] [2022-07-13 11:10:00,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:10:00,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:10:00,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:10:00,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:10:00,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:10:00,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:10:00,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:10:00,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 11:10:00,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:10:01,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:10:01,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:01,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 11:10:01,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:01,351 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-13 11:10:01,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 39 [2022-07-13 11:10:01,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:01,630 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-07-13 11:10:01,630 INFO L390 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 32 treesize of output 13 [2022-07-13 11:10:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:01,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:10:05,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 106 [2022-07-13 11:10:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:05,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313596592] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:10:05,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:10:05,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-07-13 11:10:05,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118721006] [2022-07-13 11:10:05,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:10:05,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 11:10:05,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:10:05,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 11:10:05,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=889, Unknown=2, NotChecked=0, Total=1056 [2022-07-13 11:10:05,994 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:10:06,614 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-07-13 11:10:06,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 11:10:06,615 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 11:10:06,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:10:06,615 INFO L225 Difference]: With dead ends: 40 [2022-07-13 11:10:06,615 INFO L226 Difference]: Without dead ends: 29 [2022-07-13 11:10:06,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=318, Invalid=1572, Unknown=2, NotChecked=0, Total=1892 [2022-07-13 11:10:06,617 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:10:06,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 200 Invalid, 0 Unknown, 77 Unchecked, 0.2s Time] [2022-07-13 11:10:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-13 11:10:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-13 11:10:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-13 11:10:06,621 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-07-13 11:10:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:10:06,621 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-13 11:10:06,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-07-13 11:10:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:10:06,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:10:06,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:10:06,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:10:06,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:10:06,823 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:10:06,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:10:06,823 INFO L85 PathProgramCache]: Analyzing trace with hash -301520475, now seen corresponding path program 3 times [2022-07-13 11:10:06,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:10:06,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392539429] [2022-07-13 11:10:06,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:10:06,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:10:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:10:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:06,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:10:06,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392539429] [2022-07-13 11:10:06,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392539429] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:10:06,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571098513] [2022-07-13 11:10:06,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:10:06,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:10:06,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:10:06,906 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:10:06,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:10:06,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 11:10:06,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:10:06,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:10:06,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:10:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:07,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:10:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:07,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571098513] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:10:07,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:10:07,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:10:07,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077978961] [2022-07-13 11:10:07,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:10:07,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:10:07,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:10:07,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:10:07,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:10:07,077 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:10:07,171 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-07-13 11:10:07,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:10:07,172 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 11:10:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:10:07,174 INFO L225 Difference]: With dead ends: 56 [2022-07-13 11:10:07,174 INFO L226 Difference]: Without dead ends: 39 [2022-07-13 11:10:07,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:10:07,175 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:10:07,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 35 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:10:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-13 11:10:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-07-13 11:10:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-13 11:10:07,185 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-07-13 11:10:07,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:10:07,186 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-13 11:10:07,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-07-13 11:10:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 11:10:07,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:10:07,187 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:10:07,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:10:07,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:10:07,396 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:10:07,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:10:07,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1384678109, now seen corresponding path program 4 times [2022-07-13 11:10:07,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:10:07,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164544137] [2022-07-13 11:10:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:10:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:10:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:10:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:07,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:10:07,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164544137] [2022-07-13 11:10:07,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164544137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:10:07,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018878564] [2022-07-13 11:10:07,852 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:10:07,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:10:07,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:10:07,853 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:10:07,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:10:07,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:10:07,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:10:07,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-13 11:10:07,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:10:07,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:10:08,026 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:10:08,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:10:08,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:08,125 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:10:08,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-13 11:10:08,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:08,235 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-07-13 11:10:08,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 51 [2022-07-13 11:10:08,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:08,354 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:10:08,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 40 [2022-07-13 11:10:08,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:08,521 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:10:08,522 INFO L390 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 47 treesize of output 15 [2022-07-13 11:10:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:08,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:10:16,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_144 Int) (v_ArrVal_142 Int) (v_ArrVal_140 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (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_140)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_144 (+ v_ArrVal_142 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_142)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (let ((.cse2 (mod |c_ULTIMATE.start_main_~i~0#1| 5))) (and (or (not (<= v_ArrVal_140 .cse2)) (and (not (= .cse2 0)) (< |c_ULTIMATE.start_main_~i~0#1| 0))) (< .cse2 (+ v_ArrVal_140 5)))) (<= (+ v_ArrVal_144 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_144)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* ~N~0 4)) (not (<= v_ArrVal_142 0)))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-13 11:10:21,315 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:10:21,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 914 treesize of output 890 [2022-07-13 11:10:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-13 11:10:22,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018878564] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:10:22,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:10:22,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 39 [2022-07-13 11:10:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941356603] [2022-07-13 11:10:22,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:10:22,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-13 11:10:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:10:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-13 11:10:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1225, Unknown=6, NotChecked=72, Total=1482 [2022-07-13 11:10:22,623 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:10:26,896 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2022-07-13 11:10:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-13 11:10:26,896 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-13 11:10:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:10:26,898 INFO L225 Difference]: With dead ends: 71 [2022-07-13 11:10:26,898 INFO L226 Difference]: Without dead ends: 59 [2022-07-13 11:10:26,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=404, Invalid=2673, Unknown=7, NotChecked=108, Total=3192 [2022-07-13 11:10:26,900 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:10:26,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 95 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 293 Invalid, 0 Unknown, 224 Unchecked, 0.2s Time] [2022-07-13 11:10:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-13 11:10:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2022-07-13 11:10:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-07-13 11:10:26,908 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 26 [2022-07-13 11:10:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:10:26,909 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-07-13 11:10:26,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-07-13 11:10:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:10:26,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:10:26,910 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:10:26,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:10:27,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:10:27,110 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:10:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:10:27,111 INFO L85 PathProgramCache]: Analyzing trace with hash -483356095, now seen corresponding path program 5 times [2022-07-13 11:10:27,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:10:27,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183695627] [2022-07-13 11:10:27,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:10:27,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:10:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:10:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:27,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:10:27,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183695627] [2022-07-13 11:10:27,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183695627] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:10:27,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805910342] [2022-07-13 11:10:27,193 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:10:27,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:10:27,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:10:27,194 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:10:27,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:10:27,267 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-13 11:10:27,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:10:27,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:10:27,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:10:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:27,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:10:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:27,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805910342] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:10:27,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:10:27,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:10:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997246763] [2022-07-13 11:10:27,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:10:27,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:10:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:10:27,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:10:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:10:27,388 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:27,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:10:27,524 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-07-13 11:10:27,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:10:27,525 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 29 [2022-07-13 11:10:27,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:10:27,525 INFO L225 Difference]: With dead ends: 83 [2022-07-13 11:10:27,525 INFO L226 Difference]: Without dead ends: 63 [2022-07-13 11:10:27,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2022-07-13 11:10:27,527 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 54 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:10:27,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 48 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:10:27,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-13 11:10:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2022-07-13 11:10:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-07-13 11:10:27,534 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 29 [2022-07-13 11:10:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:10:27,534 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-07-13 11:10:27,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:27,535 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-07-13 11:10:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 11:10:27,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:10:27,536 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:10:27,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:10:27,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:10:27,740 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:10:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:10:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1914654111, now seen corresponding path program 6 times [2022-07-13 11:10:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:10:27,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806797571] [2022-07-13 11:10:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:10:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:10:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:10:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:27,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:10:27,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806797571] [2022-07-13 11:10:27,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806797571] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:10:27,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504632232] [2022-07-13 11:10:27,869 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:10:27,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:10:27,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:10:27,870 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:10:27,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 11:10:27,946 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-13 11:10:27,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:10:27,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:10:27,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:10:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:10:28,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:10:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:10:28,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504632232] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:10:28,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:10:28,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2022-07-13 11:10:28,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560512976] [2022-07-13 11:10:28,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:10:28,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:10:28,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:10:28,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:10:28,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:10:28,106 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:10:28,418 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-07-13 11:10:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 11:10:28,419 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-13 11:10:28,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:10:28,419 INFO L225 Difference]: With dead ends: 67 [2022-07-13 11:10:28,419 INFO L226 Difference]: Without dead ends: 55 [2022-07-13 11:10:28,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 11:10:28,420 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 74 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:10:28,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 33 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:10:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-13 11:10:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-07-13 11:10:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-07-13 11:10:28,427 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 30 [2022-07-13 11:10:28,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:10:28,427 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-07-13 11:10:28,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:10:28,427 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-07-13 11:10:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 11:10:28,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:10:28,428 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:10:28,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 11:10:28,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:10:28,629 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:10:28,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:10:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1023492733, now seen corresponding path program 7 times [2022-07-13 11:10:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:10:28,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439525511] [2022-07-13 11:10:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:10:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:10:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:10:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:10:29,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439525511] [2022-07-13 11:10:29,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439525511] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:10:29,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372678004] [2022-07-13 11:10:29,415 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:10:29,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:10:29,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:10:29,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:10:29,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 11:10:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:10:29,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-13 11:10:29,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:10:29,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:10:29,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:10:29,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:29,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2022-07-13 11:10:29,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:29,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:29,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:29,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-07-13 11:10:30,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:30,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:30,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:30,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 95 [2022-07-13 11:10:30,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:30,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:30,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:10:30,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:30,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 103 [2022-07-13 11:10:30,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:10:30,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:30,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:30,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:30,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 103 [2022-07-13 11:10:31,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:31,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:31,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:31,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:10:31,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:31,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 102 [2022-07-13 11:10:31,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:31,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:31,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:10:31,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 34 [2022-07-13 11:10:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:10:31,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:11:08,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (~N~0 Int) (v_ArrVal_273 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_273) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_276))))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_277 0)) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (< .cse2 ~N~0)) (let ((.cse3 (mod .cse2 5))) (and (or (and (not (= .cse3 0)) (< .cse2 0)) (not (<= v_ArrVal_276 .cse3))) (< .cse3 (+ v_ArrVal_276 5)))) (let ((.cse4 (mod |c_ULTIMATE.start_main_~i~0#1| 5))) (and (< .cse4 (+ v_ArrVal_273 5)) (or (not (<= v_ArrVal_273 .cse4)) (and (not (= .cse4 0)) (< |c_ULTIMATE.start_main_~i~0#1| 0))))) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_281 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* ~N~0 4)))))) is different from false [2022-07-13 11:11:22,566 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-13 11:11:22,567 INFO L390 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 16588 treesize of output 16372 [2022-07-13 11:11:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 33 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-13 11:11:34,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372678004] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:11:34,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:11:34,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 50 [2022-07-13 11:11:34,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019070853] [2022-07-13 11:11:34,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:11:34,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 11:11:34,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:34,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 11:11:34,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2086, Unknown=21, NotChecked=94, Total=2450 [2022-07-13 11:11:34,539 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 50 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:12:01,388 WARN L233 SmtUtils]: Spent 7.16s on a formula simplification. DAG size of input: 167 DAG size of output: 115 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 11:12:03,492 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_277 0)) (<= (+ v_ArrVal_281 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* c_~N~0 4)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))))) (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse3 (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| 4) v_ArrVal_276)))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_277 0)) (not (< .cse1 ~N~0)) (let ((.cse2 (mod .cse1 5))) (and (or (and (not (= .cse2 0)) (< .cse1 0)) (not (<= v_ArrVal_276 .cse2))) (< .cse2 (+ v_ArrVal_276 5)))) (<= (+ v_ArrVal_281 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* ~N~0 4)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))))))) is different from false [2022-07-13 11:12:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:12:48,441 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-07-13 11:12:48,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 11:12:48,442 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-13 11:12:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:12:48,442 INFO L225 Difference]: With dead ends: 77 [2022-07-13 11:12:48,442 INFO L226 Difference]: Without dead ends: 55 [2022-07-13 11:12:48,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 123.0s TimeCoverageRelationStatistics Valid=524, Invalid=3857, Unknown=49, NotChecked=262, Total=4692 [2022-07-13 11:12:48,444 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:12:48,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 133 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 188 Unchecked, 0.1s Time] [2022-07-13 11:12:48,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-13 11:12:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2022-07-13 11:12:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:12:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-07-13 11:12:48,450 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2022-07-13 11:12:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:12:48,451 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-07-13 11:12:48,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:12:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-07-13 11:12:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 11:12:48,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:12:48,452 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:12:48,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:12:48,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:12:48,656 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:12:48,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:12:48,656 INFO L85 PathProgramCache]: Analyzing trace with hash -880704545, now seen corresponding path program 8 times [2022-07-13 11:12:48,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:12:48,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45303366] [2022-07-13 11:12:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:12:48,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:12:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:12:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:12:49,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:12:49,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45303366] [2022-07-13 11:12:49,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45303366] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:12:49,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155590412] [2022-07-13 11:12:49,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:12:49,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:12:49,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:12:49,680 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:12:49,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 11:12:49,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:12:49,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:12:49,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-13 11:12:49,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:12:49,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:12:49,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:49,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2022-07-13 11:12:49,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:49,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:49,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:49,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2022-07-13 11:12:50,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-07-13 11:12:50,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-07-13 11:12:50,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:50,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2022-07-13 11:12:50,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:50,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2022-07-13 11:12:50,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:50,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 71 [2022-07-13 11:12:50,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:50,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2022-07-13 11:12:51,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:51,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-07-13 11:12:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:12:51,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:32,227 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_341 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_339 Int) (v_ArrVal_349 Int) (v_ArrVal_337 Int) (v_ArrVal_347 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_337) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_339) (+ .cse7 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_341))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (or (let ((.cse0 (mod |c_ULTIMATE.start_main_~i~0#1| 5))) (and (< .cse0 (+ v_ArrVal_337 5)) (or (and (not (= .cse0 0)) (< |c_ULTIMATE.start_main_~i~0#1| 0)) (not (<= v_ArrVal_337 .cse0))))) (not (<= v_ArrVal_347 (+ v_ArrVal_346 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_346)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_344 0)) (not (< .cse3 ~N~0)) (not (<= v_ArrVal_349 (+ v_ArrVal_347 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_349 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_349)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* ~N~0 4)) (let ((.cse5 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse4 (mod .cse5 5))) (and (< .cse4 (+ v_ArrVal_341 5)) (or (not (<= v_ArrVal_341 .cse4)) (and (not (= .cse4 0)) (< .cse5 0)))))) (not (<= v_ArrVal_346 (+ v_ArrVal_344 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_344)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (let ((.cse6 (mod .cse3 5))) (and (or (not (<= v_ArrVal_339 .cse6)) (and (not (= .cse6 0)) (< .cse3 0))) (< .cse6 (+ v_ArrVal_339 5)))))))) is different from false