./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/shared_mem1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/heap-data/shared_mem1.i -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 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:38:49,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:38:49,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:38:49,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:38:49,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:38:49,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:38:49,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:38:49,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:38:49,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:38:49,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:38:49,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:38:49,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:38:49,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:38:49,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:38:49,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:38:49,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:38:49,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:38:49,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:38:49,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:38:49,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:38:49,570 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:38:49,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:38:49,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:38:49,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:38:49,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:38:49,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:38:49,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:38:49,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:38:49,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:38:49,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:38:49,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:38:49,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:38:49,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:38:49,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:38:49,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:38:49,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:38:49,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:38:49,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:38:49,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:38:49,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:38:49,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:38:49,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:38:49,591 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:38:49,606 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:38:49,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:38:49,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:38:49,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:38:49,610 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:38:49,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:38:49,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:38:49,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:38:49,611 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:38:49,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:38:49,612 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:38:49,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:38:49,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:38:49,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:38:49,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:38:49,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:38:49,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:38:49,613 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:38:49,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:38:49,614 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:38:49,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:38:49,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:38:49,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:38:49,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:38:49,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:38:49,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:38:49,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:38:49,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:38:49,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:38:49,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:38:49,616 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:38:49,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:38:49,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:38:49,617 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 -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2022-07-12 03:38:49,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:38:49,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:38:49,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:38:49,803 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:38:49,804 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:38:49,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-12 03:38:49,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43398f7c9/ef5bda71865147368cb84469a00dabab/FLAGe7b827d05 [2022-07-12 03:38:50,277 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:38:50,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-12 03:38:50,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43398f7c9/ef5bda71865147368cb84469a00dabab/FLAGe7b827d05 [2022-07-12 03:38:50,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43398f7c9/ef5bda71865147368cb84469a00dabab [2022-07-12 03:38:50,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:38:50,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:38:50,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:38:50,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:38:50,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:38:50,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:38:50" (1/1) ... [2022-07-12 03:38:50,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3b5849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50, skipping insertion in model container [2022-07-12 03:38:50,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:38:50" (1/1) ... [2022-07-12 03:38:50,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:38:50,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:38:50,590 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/heap-data/shared_mem1.i[23879,23892] [2022-07-12 03:38:50,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:38:50,602 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:38:50,643 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/heap-data/shared_mem1.i[23879,23892] [2022-07-12 03:38:50,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:38:50,662 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:38:50,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50 WrapperNode [2022-07-12 03:38:50,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:38:50,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:38:50,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:38:50,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:38:50,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50" (1/1) ... [2022-07-12 03:38:50,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50" (1/1) ... [2022-07-12 03:38:50,706 INFO L137 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-07-12 03:38:50,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:38:50,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:38:50,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:38:50,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:38:50,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50" (1/1) ... [2022-07-12 03:38:50,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50" (1/1) ... [2022-07-12 03:38:50,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50" (1/1) ... [2022-07-12 03:38:50,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50" (1/1) ... [2022-07-12 03:38:50,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50" (1/1) ... [2022-07-12 03:38:50,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50" (1/1) ... [2022-07-12 03:38:50,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50" (1/1) ... [2022-07-12 03:38:50,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:38:50,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:38:50,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:38:50,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:38:50,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50" (1/1) ... [2022-07-12 03:38:50,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:38:50,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:50,759 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-12 03:38:50,767 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-12 03:38:50,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:38:50,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:38:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:38:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:38:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:38:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:38:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:38:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:38:50,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:38:50,848 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:38:50,849 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:38:51,014 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:38:51,018 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:38:51,018 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:38:51,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:38:51 BoogieIcfgContainer [2022-07-12 03:38:51,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:38:51,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:38:51,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:38:51,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:38:51,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:38:50" (1/3) ... [2022-07-12 03:38:51,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36026316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:38:51, skipping insertion in model container [2022-07-12 03:38:51,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:50" (2/3) ... [2022-07-12 03:38:51,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36026316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:38:51, skipping insertion in model container [2022-07-12 03:38:51,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:38:51" (3/3) ... [2022-07-12 03:38:51,025 INFO L111 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2022-07-12 03:38:51,040 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:38:51,040 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:38:51,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:38:51,073 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@2f220c00, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50c27c4d [2022-07-12 03:38:51,073 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:38:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:38:51,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:51,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:51,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:51,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1650103796, now seen corresponding path program 1 times [2022-07-12 03:38:51,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:51,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113123169] [2022-07-12 03:38:51,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:51,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:51,231 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-12 03:38:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:51,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113123169] [2022-07-12 03:38:51,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113123169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:51,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:51,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:38:51,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556888065] [2022-07-12 03:38:51,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:51,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:38:51,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:51,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:38:51,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:38:51,261 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 03:38:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:51,270 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-07-12 03:38:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:38:51,271 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-12 03:38:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:51,275 INFO L225 Difference]: With dead ends: 27 [2022-07-12 03:38:51,276 INFO L226 Difference]: Without dead ends: 13 [2022-07-12 03:38:51,278 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-12 03:38:51,280 INFO L413 NwaCegarLoop]: 20 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, 20 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-12 03:38:51,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:38:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-12 03:38:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-12 03:38:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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-12 03:38:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-07-12 03:38:51,302 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2022-07-12 03:38:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:51,302 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-07-12 03:38:51,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 03:38:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-07-12 03:38:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:38:51,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:51,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:51,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:38:51,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash -812668617, now seen corresponding path program 1 times [2022-07-12 03:38:51,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:51,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439662481] [2022-07-12 03:38:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:51,663 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-12 03:38:51,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:51,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439662481] [2022-07-12 03:38:51,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439662481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:51,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:51,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 03:38:51,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563378729] [2022-07-12 03:38:51,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:51,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 03:38:51,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:51,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 03:38:51,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:38:51,666 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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-12 03:38:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:51,805 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-07-12 03:38:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:38:51,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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-12 03:38:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:51,807 INFO L225 Difference]: With dead ends: 29 [2022-07-12 03:38:51,807 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 03:38:51,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 03:38:51,808 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:51,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:38:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 03:38:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-12 03:38:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-07-12 03:38:51,813 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 11 [2022-07-12 03:38:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:51,813 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-12 03:38:51,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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-12 03:38:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-07-12 03:38:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:38:51,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:51,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:51,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:38:51,823 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:51,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:51,824 INFO L85 PathProgramCache]: Analyzing trace with hash -812666695, now seen corresponding path program 1 times [2022-07-12 03:38:51,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:51,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610286355] [2022-07-12 03:38:51,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:51,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:51,963 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-12 03:38:51,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:51,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610286355] [2022-07-12 03:38:51,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610286355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:51,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:51,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:38:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098601713] [2022-07-12 03:38:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:51,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:38:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:51,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:38:51,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:38:51,966 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-12 03:38:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:52,063 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-07-12 03:38:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:38:52,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-12 03:38:52,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:52,064 INFO L225 Difference]: With dead ends: 31 [2022-07-12 03:38:52,064 INFO L226 Difference]: Without dead ends: 24 [2022-07-12 03:38:52,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:38:52,066 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:52,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 38 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:38:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-12 03:38:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-07-12 03:38:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 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-12 03:38:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-07-12 03:38:52,069 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 11 [2022-07-12 03:38:52,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:52,070 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-12 03:38:52,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-12 03:38:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-07-12 03:38:52,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 03:38:52,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:52,071 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:52,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:38:52,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:52,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:52,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1760681901, now seen corresponding path program 1 times [2022-07-12 03:38:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:52,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383130794] [2022-07-12 03:38:52,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:52,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:52,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383130794] [2022-07-12 03:38:52,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383130794] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:52,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400820834] [2022-07-12 03:38:52,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:52,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:52,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:52,329 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-12 03:38:52,330 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-12 03:38:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:52,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-12 03:38:52,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:52,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,501 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 18 treesize of output 19 [2022-07-12 03:38:52,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,507 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 18 treesize of output 19 [2022-07-12 03:38:52,522 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:38:52,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 03:38:52,559 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-07-12 03:38:52,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 94 [2022-07-12 03:38:52,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-12 03:38:52,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-07-12 03:38:52,679 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 0 case distinctions, treesize of input 72 treesize of output 41 [2022-07-12 03:38:52,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2022-07-12 03:38:52,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,871 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 26 treesize of output 23 [2022-07-12 03:38:52,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,880 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 26 treesize of output 23 [2022-07-12 03:38:52,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,905 INFO L356 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2022-07-12 03:38:52,906 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 2 case distinctions, treesize of input 92 treesize of output 97 [2022-07-12 03:38:52,912 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 03:38:52,956 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-12 03:38:53,135 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-12 03:38:53,136 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 03:38:53,138 INFO L158 Benchmark]: Toolchain (without parser) took 2831.90ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 60.0MB in the beginning and 77.4MB in the end (delta: -17.5MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2022-07-12 03:38:53,139 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 94.4MB. Free memory was 47.9MB in the beginning and 47.9MB in the end (delta: 43.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:38:53,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.17ms. Allocated memory is still 94.4MB. Free memory was 59.6MB in the beginning and 62.0MB in the end (delta: -2.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 03:38:53,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.46ms. Allocated memory is still 94.4MB. Free memory was 62.0MB in the beginning and 60.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:38:53,139 INFO L158 Benchmark]: Boogie Preprocessor took 30.76ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 58.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:38:53,140 INFO L158 Benchmark]: RCFGBuilder took 281.21ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 58.7MB in the beginning and 95.3MB in the end (delta: -36.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-12 03:38:53,140 INFO L158 Benchmark]: TraceAbstraction took 2117.51ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 94.8MB in the beginning and 77.4MB in the end (delta: 17.3MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2022-07-12 03:38:53,141 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58ms. Allocated memory is still 94.4MB. Free memory was 47.9MB in the beginning and 47.9MB in the end (delta: 43.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.17ms. Allocated memory is still 94.4MB. Free memory was 59.6MB in the beginning and 62.0MB in the end (delta: -2.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.46ms. Allocated memory is still 94.4MB. Free memory was 62.0MB in the beginning and 60.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.76ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 58.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 281.21ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 58.7MB in the beginning and 95.3MB in the end (delta: -36.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2117.51ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 94.8MB in the beginning and 77.4MB in the end (delta: 17.3MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 03:38:53,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/heap-data/shared_mem1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:38:55,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:38:55,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:38:55,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:38:55,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:38:55,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:38:55,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:38:55,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:38:55,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:38:55,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:38:55,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:38:55,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:38:55,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:38:55,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:38:55,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:38:55,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:38:55,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:38:55,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:38:55,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:38:55,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:38:55,073 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:38:55,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:38:55,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:38:55,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:38:55,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:38:55,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:38:55,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:38:55,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:38:55,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:38:55,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:38:55,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:38:55,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:38:55,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:38:55,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:38:55,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:38:55,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:38:55,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:38:55,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:38:55,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:38:55,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:38:55,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:38:55,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:38:55,098 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:38:55,123 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:38:55,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:38:55,124 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:38:55,124 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:38:55,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:38:55,125 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:38:55,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:38:55,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:38:55,126 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:38:55,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:38:55,127 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:38:55,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:38:55,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:38:55,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:38:55,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:38:55,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:38:55,134 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:38:55,134 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:38:55,134 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:38:55,134 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:38:55,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:38:55,134 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:38:55,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:38:55,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:38:55,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:38:55,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:38:55,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:38:55,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:38:55,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:38:55,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:38:55,136 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:38:55,136 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:38:55,136 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:38:55,136 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:38:55,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:38:55,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:38:55,137 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2022-07-12 03:38:55,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:38:55,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:38:55,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:38:55,421 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:38:55,421 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:38:55,422 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-12 03:38:55,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94b8c3f2d/f91b09482e30446f813aefac165046c7/FLAG60f772455 [2022-07-12 03:38:55,820 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:38:55,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-12 03:38:55,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94b8c3f2d/f91b09482e30446f813aefac165046c7/FLAG60f772455 [2022-07-12 03:38:56,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94b8c3f2d/f91b09482e30446f813aefac165046c7 [2022-07-12 03:38:56,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:38:56,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:38:56,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:38:56,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:38:56,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:38:56,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:38:56" (1/1) ... [2022-07-12 03:38:56,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c8c2125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56, skipping insertion in model container [2022-07-12 03:38:56,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:38:56" (1/1) ... [2022-07-12 03:38:56,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:38:56,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:38:56,466 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/heap-data/shared_mem1.i[23879,23892] [2022-07-12 03:38:56,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:38:56,487 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:38:56,524 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/heap-data/shared_mem1.i[23879,23892] [2022-07-12 03:38:56,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:38:56,546 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:38:56,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56 WrapperNode [2022-07-12 03:38:56,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:38:56,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:38:56,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:38:56,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:38:56,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56" (1/1) ... [2022-07-12 03:38:56,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56" (1/1) ... [2022-07-12 03:38:56,602 INFO L137 Inliner]: procedures = 124, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2022-07-12 03:38:56,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:38:56,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:38:56,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:38:56,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:38:56,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56" (1/1) ... [2022-07-12 03:38:56,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56" (1/1) ... [2022-07-12 03:38:56,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56" (1/1) ... [2022-07-12 03:38:56,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56" (1/1) ... [2022-07-12 03:38:56,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56" (1/1) ... [2022-07-12 03:38:56,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56" (1/1) ... [2022-07-12 03:38:56,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56" (1/1) ... [2022-07-12 03:38:56,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:38:56,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:38:56,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:38:56,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:38:56,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56" (1/1) ... [2022-07-12 03:38:56,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:38:56,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:56,668 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-12 03:38:56,696 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-12 03:38:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:38:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:38:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:38:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:38:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:38:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 03:38:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:38:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:38:56,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:38:56,814 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:38:56,819 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:38:57,135 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:38:57,139 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:38:57,139 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:38:57,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:38:57 BoogieIcfgContainer [2022-07-12 03:38:57,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:38:57,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:38:57,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:38:57,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:38:57,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:38:56" (1/3) ... [2022-07-12 03:38:57,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5559cffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:38:57, skipping insertion in model container [2022-07-12 03:38:57,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:56" (2/3) ... [2022-07-12 03:38:57,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5559cffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:38:57, skipping insertion in model container [2022-07-12 03:38:57,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:38:57" (3/3) ... [2022-07-12 03:38:57,145 INFO L111 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2022-07-12 03:38:57,154 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:38:57,154 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:38:57,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:38:57,185 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@57934cc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@628b303 [2022-07-12 03:38:57,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:38:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 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-12 03:38:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:38:57,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:57,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:57,196 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:57,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash -15033972, now seen corresponding path program 1 times [2022-07-12 03:38:57,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:38:57,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124511571] [2022-07-12 03:38:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:57,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:38:57,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:38:57,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:38:57,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 03:38:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:57,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:38:57,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:57,338 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-12 03:38:57,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:38:57,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:38:57,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124511571] [2022-07-12 03:38:57,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124511571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:57,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:57,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:38:57,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408222405] [2022-07-12 03:38:57,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:57,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:38:57,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:38:57,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:38:57,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:38:57,366 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 03:38:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:57,374 INFO L93 Difference]: Finished difference Result 26 states and 37 transitions. [2022-07-12 03:38:57,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:38:57,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-12 03:38:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:57,383 INFO L225 Difference]: With dead ends: 26 [2022-07-12 03:38:57,385 INFO L226 Difference]: Without dead ends: 12 [2022-07-12 03:38:57,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-12 03:38:57,389 INFO L413 NwaCegarLoop]: 19 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, 19 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-12 03:38:57,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:38:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-07-12 03:38:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-12 03:38:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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-12 03:38:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-07-12 03:38:57,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2022-07-12 03:38:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:57,407 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-07-12 03:38:57,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 03:38:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-07-12 03:38:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:38:57,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:57,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:57,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:38:57,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:38:57,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:57,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:57,617 INFO L85 PathProgramCache]: Analyzing trace with hash -263268138, now seen corresponding path program 1 times [2022-07-12 03:38:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:38:57,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736458572] [2022-07-12 03:38:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:57,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:38:57,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:38:57,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:38:57,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 03:38:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:57,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 03:38:57,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:57,811 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:38:57,812 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:38:57,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:57,821 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 18 treesize of output 19 [2022-07-12 03:38:57,891 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-07-12 03:38:57,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 94 [2022-07-12 03:38:57,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:57,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:57,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:57,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-12 03:38:57,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:57,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:57,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:57,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-07-12 03:38:58,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:58,106 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 0 case distinctions, treesize of input 61 treesize of output 32 [2022-07-12 03:38:58,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:58,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:58,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:58,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2022-07-12 03:38:58,525 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 80 treesize of output 50 [2022-07-12 03:38:58,531 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 56 treesize of output 32 [2022-07-12 03:38:58,572 INFO L356 Elim1Store]: treesize reduction 19, result has 48.6 percent of original size [2022-07-12 03:38:58,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 96 [2022-07-12 03:38:58,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:58,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:58,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:58,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2022-07-12 03:38:58,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2022-07-12 03:38:58,693 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-07-12 03:38:58,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2022-07-12 03:39:07,157 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:07,158 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 87 treesize of output 83 [2022-07-12 03:39:07,345 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-12 03:39:07,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:39:07,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:39:07,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736458572] [2022-07-12 03:39:07,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736458572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:39:07,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:39:07,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 03:39:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650977502] [2022-07-12 03:39:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:39:07,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 03:39:07,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:39:07,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 03:39:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=38, Unknown=3, NotChecked=0, Total=56 [2022-07-12 03:39:07,349 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 03:39:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:07,529 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-07-12 03:39:07,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:39:07,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-12 03:39:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:07,531 INFO L225 Difference]: With dead ends: 22 [2022-07-12 03:39:07,531 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 03:39:07,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=15, Invalid=38, Unknown=3, NotChecked=0, Total=56 [2022-07-12 03:39:07,536 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:07,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-07-12 03:39:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 03:39:07,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-12 03:39:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:39:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2022-07-12 03:39:07,545 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 10 [2022-07-12 03:39:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:07,546 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-12 03:39:07,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 03:39:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2022-07-12 03:39:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:39:07,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:07,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:07,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:07,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:39:07,755 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:07,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash -263266216, now seen corresponding path program 1 times [2022-07-12 03:39:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:39:07,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079978158] [2022-07-12 03:39:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:07,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:39:07,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:39:07,781 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:39:07,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 03:39:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:07,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 03:39:07,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:07,899 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:39:07,900 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:39:07,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:07,907 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 18 treesize of output 19 [2022-07-12 03:39:07,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:07,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:07,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:07,970 INFO L356 Elim1Store]: treesize reduction 80, result has 29.2 percent of original size [2022-07-12 03:39:07,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 59 [2022-07-12 03:39:07,998 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 11 treesize of output 9 [2022-07-12 03:39:08,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 61 treesize of output 37 [2022-07-12 03:39:08,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 43 treesize of output 25 [2022-07-12 03:39:08,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-12 03:39:08,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-12 03:39:08,192 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-12 03:39:08,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:39:08,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:39:08,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079978158] [2022-07-12 03:39:08,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079978158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:39:08,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:39:08,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:39:08,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762649321] [2022-07-12 03:39:08,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:39:08,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:39:08,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:39:08,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:39:08,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:39:08,196 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 03:39:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:08,812 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-07-12 03:39:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:39:08,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-12 03:39:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:08,813 INFO L225 Difference]: With dead ends: 27 [2022-07-12 03:39:08,814 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 03:39:08,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:39:08,815 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:08,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 13 Unchecked, 0.6s Time] [2022-07-12 03:39:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 03:39:08,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-12 03:39:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 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-12 03:39:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-07-12 03:39:08,818 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 10 [2022-07-12 03:39:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:08,818 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-12 03:39:08,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 03:39:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-07-12 03:39:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:39:08,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:08,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:08,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:09,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:39:09,029 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:09,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:09,029 INFO L85 PathProgramCache]: Analyzing trace with hash -261421096, now seen corresponding path program 1 times [2022-07-12 03:39:09,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:39:09,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304265839] [2022-07-12 03:39:09,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:09,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:39:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:39:09,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:39:09,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 03:39:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:09,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 03:39:09,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:09,147 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:39:09,147 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:39:09,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,156 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 18 treesize of output 19 [2022-07-12 03:39:09,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-07-12 03:39:09,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,167 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 20 treesize of output 22 [2022-07-12 03:39:09,172 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 17 treesize of output 15 [2022-07-12 03:39:09,227 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 43 treesize of output 25 [2022-07-12 03:39:09,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 03:39:09,233 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 15 treesize of output 7 [2022-07-12 03:39:09,242 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-12 03:39:09,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:39:09,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:39:09,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304265839] [2022-07-12 03:39:09,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304265839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:39:09,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:39:09,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:39:09,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771456410] [2022-07-12 03:39:09,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:39:09,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:39:09,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:39:09,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:39:09,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:39:09,243 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 03:39:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:10,065 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-07-12 03:39:10,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:39:10,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-12 03:39:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:10,067 INFO L225 Difference]: With dead ends: 27 [2022-07-12 03:39:10,067 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 03:39:10,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:39:10,068 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:10,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 36 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 03:39:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 03:39:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-12 03:39:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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-12 03:39:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-12 03:39:10,071 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2022-07-12 03:39:10,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:10,071 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-12 03:39:10,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 03:39:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-07-12 03:39:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:39:10,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:10,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:10,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:10,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:39:10,279 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:10,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:10,280 INFO L85 PathProgramCache]: Analyzing trace with hash -434920839, now seen corresponding path program 1 times [2022-07-12 03:39:10,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:39:10,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841665479] [2022-07-12 03:39:10,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:10,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:39:10,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:39:10,283 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:39:10,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 03:39:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:10,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-12 03:39:10,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:10,544 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:39:10,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 22 [2022-07-12 03:39:10,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:39:10,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,590 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-07-12 03:39:10,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-07-12 03:39:10,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-12 03:39:10,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:39:10,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:39:10,847 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 03:39:10,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2022-07-12 03:39:10,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,918 INFO L356 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-07-12 03:39:10,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-07-12 03:39:10,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,934 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 26 treesize of output 23 [2022-07-12 03:39:10,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,945 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 26 treesize of output 23 [2022-07-12 03:39:10,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-12 03:39:10,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-12 03:39:10,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,996 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-12 03:39:10,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2022-07-12 03:39:11,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:11,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-07-12 03:39:11,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 59 [2022-07-12 03:39:11,264 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-07-12 03:39:11,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 27 [2022-07-12 03:39:11,270 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:39:11,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2022-07-12 03:39:11,312 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:39:11,313 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 44 treesize of output 28 [2022-07-12 03:39:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:11,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:11,719 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-12 03:39:11,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 239 treesize of output 216 [2022-07-12 03:39:11,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_267 (_ BitVec 32)) (|v_ULTIMATE.start_main_~n~0#1.offset_3| (_ BitVec 32)) (v_ArrVal_266 (_ BitVec 32)) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_277 (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| v_ArrVal_266) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_6 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~n~0#1.offset_3|)))) (bvslt (select (select (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (let ((.cse7 (store |c_#memory_int| v_ArrVal_266 v_ArrVal_276))) (store .cse7 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 v_ArrVal_267)))) (.cse1 (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_266 v_ArrVal_272) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_266 v_ArrVal_280) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 v_ArrVal_266)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| v_ArrVal_266 v_arrayElimArr_6))) (store .cse4 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 v_ArrVal_277))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (not (= (select v_arrayElimArr_6 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1.offset_3|)) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 03:39:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 03:39:12,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:39:12,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841665479] [2022-07-12 03:39:12,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841665479] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:12,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:39:12,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-07-12 03:39:12,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447474447] [2022-07-12 03:39:12,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:12,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 03:39:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:39:12,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 03:39:12,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2022-07-12 03:39:12,067 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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-12 03:39:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:13,093 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-07-12 03:39:13,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:39:13,094 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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 12 [2022-07-12 03:39:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:13,095 INFO L225 Difference]: With dead ends: 33 [2022-07-12 03:39:13,095 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:39:13,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=172, Unknown=1, NotChecked=28, Total=272 [2022-07-12 03:39:13,096 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:13,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 34 Invalid, 0 Unknown, 76 Unchecked, 0.6s Time] [2022-07-12 03:39:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:39:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-07-12 03:39:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:39:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-07-12 03:39:13,100 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 12 [2022-07-12 03:39:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:13,101 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-07-12 03:39:13,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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-12 03:39:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-07-12 03:39:13,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:39:13,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:13,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:13,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:13,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:39:13,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:13,312 INFO L85 PathProgramCache]: Analyzing trace with hash -434918917, now seen corresponding path program 1 times [2022-07-12 03:39:13,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:39:13,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829632831] [2022-07-12 03:39:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:13,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:39:13,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:39:13,314 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:39:13,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 03:39:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:13,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 03:39:13,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:13,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,473 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 18 treesize of output 19 [2022-07-12 03:39:13,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,500 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 03:39:13,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 03:39:13,525 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:39:13,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 22 [2022-07-12 03:39:13,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,616 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 26 treesize of output 23 [2022-07-12 03:39:13,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,650 INFO L356 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-07-12 03:39:13,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-07-12 03:39:13,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-12 03:39:13,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-07-12 03:39:13,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,678 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:39:13,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 03:39:13,751 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 41 treesize of output 29 [2022-07-12 03:39:13,811 INFO L356 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-07-12 03:39:13,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 58 [2022-07-12 03:39:13,816 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 44 treesize of output 32 [2022-07-12 03:39:13,915 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:13,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 81 [2022-07-12 03:39:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:13,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:14,020 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 55 treesize of output 37 [2022-07-12 03:39:16,028 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_73 (_ BitVec 32))) (bvsgt (select (select (store |c_#memory_int| v_arrayElimCell_73 (let ((.cse0 (select |c_#memory_int| v_arrayElimCell_73)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (store .cse0 .cse1 (bvadd (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32))) is different from false [2022-07-12 03:39:18,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_73 (_ BitVec 32))) (bvsgt (select (select (store |c_#memory_int| v_arrayElimCell_73 (let ((.cse0 (select |c_#memory_int| v_arrayElimCell_73)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (store .cse0 .cse1 (bvadd (select .cse0 .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32))) is different from false [2022-07-12 03:39:18,151 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.base_5| (_ BitVec 32)) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_366 (_ BitVec 32)) (v_ArrVal_365 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_5|))) (bvsgt (select (select (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_361))) (store .cse4 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse3 v_ArrVal_366))))) (store .cse0 v_arrayElimCell_73 (let ((.cse1 (select .cse0 v_arrayElimCell_73)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_364) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_362) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3 v_ArrVal_365)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (store .cse1 .cse2 (bvadd (select .cse1 .cse2) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32)))) is different from false [2022-07-12 03:39:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 03:39:18,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:39:18,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829632831] [2022-07-12 03:39:18,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829632831] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:18,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:39:18,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2022-07-12 03:39:18,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730707548] [2022-07-12 03:39:18,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:18,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 03:39:18,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:39:18,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 03:39:18,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=49, Unknown=3, NotChecked=48, Total=132 [2022-07-12 03:39:18,225 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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-12 03:39:20,721 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_73 (_ BitVec 32))) (bvsgt (select (select (store |c_#memory_int| v_arrayElimCell_73 (let ((.cse0 (select |c_#memory_int| v_arrayElimCell_73)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (store .cse0 .cse1 (bvadd (select .cse0 .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32))) (= (_ bv100 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~m~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~m~0#1.base|)) (_ bv1 1))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv1 32)) (= |c_ULTIMATE.start_main_~m~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|)) is different from false [2022-07-12 03:39:22,735 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_73 (_ BitVec 32))) (bvsgt (select (select (store |c_#memory_int| v_arrayElimCell_73 (let ((.cse0 (select |c_#memory_int| v_arrayElimCell_73)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (store .cse0 .cse1 (bvadd (select .cse0 .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32))) (= (_ bv100 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~m~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv1 32)) (= |c_ULTIMATE.start_main_~m~0#1.offset| (_ bv0 32))) is different from false [2022-07-12 03:39:24,881 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv0 32)) (_ bv1 32)) (= (_ bv100 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (bvsgt (select (select (store |c_#memory_int| v_arrayElimCell_73 (let ((.cse0 (select |c_#memory_int| v_arrayElimCell_73)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (store .cse0 .cse1 (bvadd (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32))) (= |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~m~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~m~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv4 32)))) is different from false [2022-07-12 03:39:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:25,016 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-07-12 03:39:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:39:25,017 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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) Word has length 12 [2022-07-12 03:39:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:25,017 INFO L225 Difference]: With dead ends: 37 [2022-07-12 03:39:25,017 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 03:39:25,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=52, Invalid=76, Unknown=6, NotChecked=138, Total=272 [2022-07-12 03:39:25,018 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:25,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 38 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 35 Invalid, 0 Unknown, 43 Unchecked, 0.6s Time] [2022-07-12 03:39:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 03:39:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-12 03:39:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 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-12 03:39:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-07-12 03:39:25,022 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2022-07-12 03:39:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:25,022 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-07-12 03:39:25,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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-12 03:39:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-07-12 03:39:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:39:25,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:25,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:25,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:25,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:39:25,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:25,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash -433073797, now seen corresponding path program 1 times [2022-07-12 03:39:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:39:25,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210607617] [2022-07-12 03:39:25,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:25,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:39:25,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:39:25,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:39:25,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 03:39:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:25,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 03:39:25,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:25,520 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:39:25,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 22 [2022-07-12 03:39:25,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:25,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:39:25,550 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 03:39:25,557 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 14 treesize of output 16 [2022-07-12 03:39:25,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:25,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:25,623 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 26 treesize of output 23 [2022-07-12 03:39:25,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:25,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:25,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:39:25,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:25,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-12 03:39:25,648 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:39:25,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 03:39:25,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:25,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-07-12 03:39:25,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-12 03:39:25,761 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:39:25,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2022-07-12 03:39:25,764 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 6 treesize of output 4 [2022-07-12 03:39:25,783 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 29 treesize of output 17 [2022-07-12 03:39:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:25,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:25,836 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 36 treesize of output 24 [2022-07-12 03:39:25,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (_ BitVec 32)) (v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_88 (_ BitVec 32)) (v_ArrVal_452 (_ BitVec 32)) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| v_ArrVal_447 v_ArrVal_455) |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_454))) (or (bvsle (select (select .cse0 v_arrayElimCell_88) (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_447 v_ArrVal_451) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_447 v_ArrVal_448) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|) v_ArrVal_452)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv100 32)) (not (= (select |c_#valid| v_ArrVal_447) (_ bv0 1))) (bvslt (select (select (store .cse0 v_arrayElimCell_88 v_ArrVal_456) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32))))) is different from false [2022-07-12 03:39:25,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 03:39:25,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:39:25,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210607617] [2022-07-12 03:39:25,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210607617] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:25,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:39:25,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-12 03:39:25,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245673291] [2022-07-12 03:39:25,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:25,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:39:25,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:39:25,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:39:25,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=92, Unknown=5, NotChecked=20, Total=156 [2022-07-12 03:39:25,999 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 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-12 03:39:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:26,528 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-07-12 03:39:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:39:26,528 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 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 12 [2022-07-12 03:39:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:26,528 INFO L225 Difference]: With dead ends: 29 [2022-07-12 03:39:26,529 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 03:39:26,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=124, Unknown=5, NotChecked=24, Total=210 [2022-07-12 03:39:26,529 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:26,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 47 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 52 Unchecked, 0.4s Time] [2022-07-12 03:39:26,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 03:39:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-12 03:39:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 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-12 03:39:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-07-12 03:39:26,533 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 12 [2022-07-12 03:39:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:26,533 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-12 03:39:26,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 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-12 03:39:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-07-12 03:39:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:39:26,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:26,534 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:26,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-12 03:39:26,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:39:26,738 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:26,738 INFO L85 PathProgramCache]: Analyzing trace with hash -857850716, now seen corresponding path program 1 times [2022-07-12 03:39:26,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:39:26,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821246699] [2022-07-12 03:39:26,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:26,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:39:26,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:39:26,740 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:39:26,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 03:39:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:26,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 03:39:26,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:26,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:26,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:26,932 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-07-12 03:39:26,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:26,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-07-12 03:39:26,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:26,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:26,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:26,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-12 03:39:26,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:26,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:26,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:39:26,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-12 03:39:26,989 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 17 treesize of output 15 [2022-07-12 03:39:27,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:27,014 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 18 treesize of output 19 [2022-07-12 03:39:27,151 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:39:27,151 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 99 [2022-07-12 03:39:27,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 35 [2022-07-12 03:39:27,161 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 77 treesize of output 73 [2022-07-12 03:39:29,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:29,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:29,362 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:39:29,363 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 67 [2022-07-12 03:39:29,379 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-12 03:39:29,379 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2022-07-12 03:39:29,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-12 03:39:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:29,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:33,540 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvsle (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_516)) (.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_515)) (.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8)) (.cse6 (bvadd (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8) (_ bv4 32)))) (select (select (store |c_#memory_int| .cse0 (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (store .cse1 .cse2 (bvadd (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select .cse1 .cse2))))) (select (select .cse4 .cse5) .cse6)) (select (select .cse7 .cse5) .cse6)))))) (_ bv100 32)))) is different from false [2022-07-12 03:39:33,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvsle (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_516)) (.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_515)) (.cse8 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) .cse8)) (.cse6 (bvadd (_ bv4 32) (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse8)))) (select (select (store |c_#memory_int| .cse0 (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (store .cse1 .cse2 (bvadd (select .cse1 .cse2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (select (select .cse4 .cse5) .cse6)) (select (select .cse7 .cse5) .cse6)))))) (_ bv100 32)))) is different from false [2022-07-12 03:39:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:39:33,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:39:33,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821246699] [2022-07-12 03:39:33,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821246699] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:33,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:39:33,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-12 03:39:33,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798462957] [2022-07-12 03:39:33,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:33,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 03:39:33,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:39:33,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 03:39:33,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=5, NotChecked=34, Total=132 [2022-07-12 03:39:33,642 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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-12 03:39:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:47,685 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-07-12 03:39:47,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:39:47,686 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 15 [2022-07-12 03:39:47,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:47,687 INFO L225 Difference]: With dead ends: 38 [2022-07-12 03:39:47,687 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:39:47,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=9, NotChecked=46, Total=210 [2022-07-12 03:39:47,688 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:47,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 82 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 38 Unchecked, 1.7s Time] [2022-07-12 03:39:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:39:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-07-12 03:39:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:39:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-12 03:39:47,693 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 15 [2022-07-12 03:39:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:47,693 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-12 03:39:47,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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-12 03:39:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-12 03:39:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:39:47,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:47,693 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:47,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:47,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:39:47,904 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:47,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:47,905 INFO L85 PathProgramCache]: Analyzing trace with hash -856003674, now seen corresponding path program 1 times [2022-07-12 03:39:47,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:39:47,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099016992] [2022-07-12 03:39:47,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:47,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:39:47,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:39:47,906 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:39:47,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 03:39:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:48,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 03:39:48,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:48,093 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:39:48,094 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:39:48,103 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 11 treesize of output 9 [2022-07-12 03:39:48,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:48,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:39:48,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:48,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:48,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:48,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-07-12 03:39:48,257 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:39:48,258 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 87 [2022-07-12 03:39:48,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 35 [2022-07-12 03:39:48,269 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 58 treesize of output 56 [2022-07-12 03:39:50,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:50,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:50,517 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:39:50,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 86 [2022-07-12 03:39:50,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:50,534 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-12 03:39:50,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 52 [2022-07-12 03:39:50,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 30 [2022-07-12 03:39:50,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 24 [2022-07-12 03:39:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:50,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:40:01,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (select (select (let ((.cse12 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse12))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_576)) (.cse13 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse8 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_577))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse7 (bvadd (_ bv4 32) .cse5))) (let ((.cse0 (store |c_#memory_int| .cse9 (let ((.cse10 (select |c_#memory_int| .cse9)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse12))) (store .cse10 .cse11 (bvadd (select .cse10 .cse11) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse1 (select (select .cse8 .cse4) .cse7))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse6 .cse4) .cse7))) (store .cse2 .cse3 (bvadd (bvneg (select (select .cse0 .cse4) .cse5)) (select .cse2 .cse3))))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32))) is different from false [2022-07-12 03:40:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:40:01,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:40:01,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099016992] [2022-07-12 03:40:01,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099016992] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:40:01,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:40:01,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-12 03:40:01,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153191794] [2022-07-12 03:40:01,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:40:01,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:40:01,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:40:01,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:40:01,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=91, Unknown=10, NotChecked=20, Total=156 [2022-07-12 03:40:01,943 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 03:40:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:40:25,140 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-07-12 03:40:25,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:40:25,140 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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) Word has length 15 [2022-07-12 03:40:25,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:40:25,140 INFO L225 Difference]: With dead ends: 40 [2022-07-12 03:40:25,140 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 03:40:25,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=71, Invalid=188, Unknown=17, NotChecked=30, Total=306 [2022-07-12 03:40:25,141 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:40:25,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 70 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 50 Unchecked, 2.3s Time] [2022-07-12 03:40:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 03:40:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2022-07-12 03:40:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:40:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-12 03:40:25,146 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2022-07-12 03:40:25,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:40:25,146 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-12 03:40:25,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 03:40:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-12 03:40:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:40:25,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:40:25,146 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:40:25,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 03:40:25,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:40:25,347 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:40:25,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:40:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash -856001752, now seen corresponding path program 1 times [2022-07-12 03:40:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:40:25,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583206618] [2022-07-12 03:40:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:25,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:40:25,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:40:25,349 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:40:25,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 03:40:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:25,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 03:40:25,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:40:25,514 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:40:25,514 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:40:25,522 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 11 treesize of output 9 [2022-07-12 03:40:25,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:25,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:25,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:25,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-07-12 03:40:25,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:25,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:40:25,687 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:40:25,688 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 87 [2022-07-12 03:40:25,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 35 [2022-07-12 03:40:25,698 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 56 treesize of output 54 [2022-07-12 03:40:27,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:27,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:27,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:27,938 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:40:27,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 168 treesize of output 84 [2022-07-12 03:40:27,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:27,954 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-12 03:40:27,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 50 [2022-07-12 03:40:27,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2022-07-12 03:40:27,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-12 03:40:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:40:28,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:40:38,188 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsgt (select (select (let ((.cse12 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse12))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_641)) (.cse13 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse8 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_639))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse7 (bvadd .cse5 (_ bv4 32)))) (let ((.cse0 (store |c_#memory_int| .cse9 (let ((.cse10 (select |c_#memory_int| .cse9)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse12))) (store .cse10 .cse11 (bvadd (select .cse10 .cse11) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse1 (select (select .cse8 .cse4) .cse7))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse6 .cse4) .cse7))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) (bvneg (select (select .cse0 .cse4) .cse5)))))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32))) is different from false [2022-07-12 03:40:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:40:38,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:40:38,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583206618] [2022-07-12 03:40:38,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583206618] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:40:38,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:40:38,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-12 03:40:38,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565239432] [2022-07-12 03:40:38,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:40:38,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:40:38,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:40:38,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:40:38,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=92, Unknown=8, NotChecked=20, Total=156 [2022-07-12 03:40:38,274 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 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-12 03:40:51,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:40:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:40:52,622 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-07-12 03:40:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:40:52,623 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 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) Word has length 15 [2022-07-12 03:40:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:40:52,624 INFO L225 Difference]: With dead ends: 50 [2022-07-12 03:40:52,624 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 03:40:52,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=93, Invalid=242, Unknown=11, NotChecked=34, Total=380 [2022-07-12 03:40:52,624 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 03:40:52,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 79 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 69 Invalid, 0 Unknown, 72 Unchecked, 3.7s Time] [2022-07-12 03:40:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 03:40:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-07-12 03:40:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 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-12 03:40:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-07-12 03:40:52,631 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2022-07-12 03:40:52,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:40:52,631 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-12 03:40:52,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 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-12 03:40:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-07-12 03:40:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:40:52,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:40:52,632 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:40:52,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-12 03:40:52,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:40:52,833 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:40:52,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:40:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash -439025439, now seen corresponding path program 1 times [2022-07-12 03:40:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:40:52,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132307829] [2022-07-12 03:40:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:52,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:40:52,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:40:52,843 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:40:52,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 03:40:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:53,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-12 03:40:53,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:40:53,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,158 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 18 treesize of output 19 [2022-07-12 03:40:53,189 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:40:53,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 22 [2022-07-12 03:40:53,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-07-12 03:40:53,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 39 treesize of output 34 [2022-07-12 03:40:53,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,290 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 16 treesize of output 16 [2022-07-12 03:40:53,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,301 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 35 treesize of output 30 [2022-07-12 03:40:53,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-12 03:40:53,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,322 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 33 treesize of output 27 [2022-07-12 03:40:53,353 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-12 03:40:53,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2022-07-12 03:40:53,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-12 03:40:53,609 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 03:40:53,610 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 113 [2022-07-12 03:40:53,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-07-12 03:40:53,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:53,629 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 77 treesize of output 73 [2022-07-12 03:40:54,380 INFO L356 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2022-07-12 03:40:54,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 222 treesize of output 105 [2022-07-12 03:40:54,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 48 [2022-07-12 03:40:54,446 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-07-12 03:40:54,447 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 2 case distinctions, treesize of input 63 treesize of output 53 [2022-07-12 03:40:55,953 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:55,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 148 [2022-07-12 03:40:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:40:56,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:41:07,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~m~0#1.offset| (_ BitVec 32)) (v_ArrVal_738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_739 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_739)) (.cse12 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse10 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_738))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse9 (bvadd (_ bv4 32) .cse6))) (let ((.cse0 (store |c_#memory_int| .cse11 v_ArrVal_740)) (.cse1 (select (select .cse10 .cse5) .cse9))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse8 .cse5) .cse9))) (let ((.cse7 (select (select .cse0 |c_ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|)) (.cse4 (select .cse2 .cse3))) (or (bvslt (select (select (store .cse0 .cse1 (store .cse2 .cse3 (bvadd .cse4 (select (select .cse0 .cse5) .cse6)))) |c_ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (not (bvslt .cse7 (_ bv110 32))) (not (bvsgt .cse7 (_ bv90 32))) (not (bvsle .cse4 (_ bv100 32)))))))))))) is different from false [2022-07-12 03:41:07,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~m~0#1.offset| (_ BitVec 32)) (v_ArrVal_738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_739 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_739)) (.cse12 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse12)) (.cse10 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_738))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) .cse12)) (.cse9 (bvadd (_ bv4 32) .cse6))) (let ((.cse1 (store |c_#memory_int| .cse11 v_ArrVal_740)) (.cse2 (select (select .cse10 .cse5) .cse9))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse8 .cse5) .cse9))) (let ((.cse0 (select .cse3 .cse4)) (.cse7 (select (select .cse1 |c_ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|))) (or (not (bvsle .cse0 (_ bv100 32))) (bvslt (select (select (store .cse1 .cse2 (store .cse3 .cse4 (bvadd .cse0 (select (select .cse1 .cse5) .cse6)))) |c_ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (not (bvslt .cse7 (_ bv110 32))) (not (bvsgt .cse7 (_ bv90 32)))))))))))) is different from false [2022-07-12 03:41:09,525 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-12 03:41:09,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2293 treesize of output 1469 [2022-07-12 03:41:09,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:41:09,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:41:09,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:41:09,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:09,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1453 treesize of output 1355 [2022-07-12 03:41:42,667 WARN L233 SmtUtils]: Spent 32.78s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-12 03:41:42,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:42,669 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 311924 treesize of output 304114 [2022-07-12 03:41:45,661 INFO L244 Elim1Store]: Index analysis took 132 ms