./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 791161d1 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-?-791161d [2022-07-22 15:00:13,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 15:00:13,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 15:00:13,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 15:00:13,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 15:00:13,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 15:00:13,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 15:00:13,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 15:00:13,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 15:00:13,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 15:00:13,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 15:00:13,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 15:00:13,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 15:00:13,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 15:00:13,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 15:00:13,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 15:00:13,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 15:00:13,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 15:00:13,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 15:00:13,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 15:00:13,675 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 15:00:13,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 15:00:13,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 15:00:13,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 15:00:13,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 15:00:13,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 15:00:13,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 15:00:13,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 15:00:13,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 15:00:13,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 15:00:13,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 15:00:13,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 15:00:13,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 15:00:13,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 15:00:13,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 15:00:13,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 15:00:13,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 15:00:13,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 15:00:13,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 15:00:13,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 15:00:13,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 15:00:13,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 15:00:13,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 15:00:13,720 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 15:00:13,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 15:00:13,721 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 15:00:13,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 15:00:13,722 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 15:00:13,722 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 15:00:13,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 15:00:13,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 15:00:13,724 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 15:00:13,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 15:00:13,725 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 15:00:13,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 15:00:13,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 15:00:13,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 15:00:13,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 15:00:13,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 15:00:13,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 15:00:13,726 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 15:00:13,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 15:00:13,726 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 15:00:13,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 15:00:13,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 15:00:13,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 15:00:13,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 15:00:13,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:00:13,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 15:00:13,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 15:00:13,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 15:00:13,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 15:00:13,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 15:00:13,729 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 15:00:13,729 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 15:00:13,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 15:00:13,729 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-22 15:00:13,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 15:00:13,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 15:00:13,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 15:00:13,990 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 15:00:13,991 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 15:00:13,992 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-22 15:00:14,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547bc7c32/8ba27a92adb44ff3bd095371f897aedf/FLAG9ff93c3c4 [2022-07-22 15:00:14,514 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 15:00:14,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-22 15:00:14,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547bc7c32/8ba27a92adb44ff3bd095371f897aedf/FLAG9ff93c3c4 [2022-07-22 15:00:14,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547bc7c32/8ba27a92adb44ff3bd095371f897aedf [2022-07-22 15:00:14,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 15:00:14,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 15:00:14,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 15:00:14,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 15:00:14,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 15:00:14,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:00:14" (1/1) ... [2022-07-22 15:00:14,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468c9410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:14, skipping insertion in model container [2022-07-22 15:00:14,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:00:14" (1/1) ... [2022-07-22 15:00:14,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 15:00:14,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 15:00:15,128 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-22 15:00:15,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:00:15,138 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 15:00:15,181 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-22 15:00:15,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:00:15,215 INFO L208 MainTranslator]: Completed translation [2022-07-22 15:00:15,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:15 WrapperNode [2022-07-22 15:00:15,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 15:00:15,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 15:00:15,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 15:00:15,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 15:00:15,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:15" (1/1) ... [2022-07-22 15:00:15,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:15" (1/1) ... [2022-07-22 15:00:15,274 INFO L137 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-07-22 15:00:15,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 15:00:15,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 15:00:15,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 15:00:15,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 15:00:15,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:15" (1/1) ... [2022-07-22 15:00:15,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:15" (1/1) ... [2022-07-22 15:00:15,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:15" (1/1) ... [2022-07-22 15:00:15,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:15" (1/1) ... [2022-07-22 15:00:15,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:15" (1/1) ... [2022-07-22 15:00:15,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:15" (1/1) ... [2022-07-22 15:00:15,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:15" (1/1) ... [2022-07-22 15:00:15,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 15:00:15,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 15:00:15,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 15:00:15,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 15:00:15,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:15" (1/1) ... [2022-07-22 15:00:15,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:00:15,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:00:15,334 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-22 15:00:15,336 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-22 15:00:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 15:00:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 15:00:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 15:00:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 15:00:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 15:00:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 15:00:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 15:00:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 15:00:15,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 15:00:15,464 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 15:00:15,466 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 15:00:15,732 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 15:00:15,736 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 15:00:15,737 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 15:00:15,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:00:15 BoogieIcfgContainer [2022-07-22 15:00:15,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 15:00:15,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 15:00:15,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 15:00:15,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 15:00:15,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 03:00:14" (1/3) ... [2022-07-22 15:00:15,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f688a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:00:15, skipping insertion in model container [2022-07-22 15:00:15,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:15" (2/3) ... [2022-07-22 15:00:15,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f688a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:00:15, skipping insertion in model container [2022-07-22 15:00:15,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:00:15" (3/3) ... [2022-07-22 15:00:15,760 INFO L111 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2022-07-22 15:00:15,773 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 15:00:15,774 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 15:00:15,833 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 15:00:15,840 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@333de514, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1aa033aa [2022-07-22 15:00:15,841 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 15:00:15,849 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-22 15:00:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 15:00:15,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:15,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:15,863 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1650103796, now seen corresponding path program 1 times [2022-07-22 15:00:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:15,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703717130] [2022-07-22 15:00:15,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:15,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:16,099 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-22 15:00:16,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:16,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703717130] [2022-07-22 15:00:16,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703717130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:00:16,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:00:16,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 15:00:16,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647707808] [2022-07-22 15:00:16,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:00:16,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 15:00:16,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:00:16,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 15:00:16,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 15:00:16,141 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-22 15:00:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:16,154 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-07-22 15:00:16,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 15:00:16,157 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-22 15:00:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:16,163 INFO L225 Difference]: With dead ends: 27 [2022-07-22 15:00:16,164 INFO L226 Difference]: Without dead ends: 13 [2022-07-22 15:00:16,167 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-22 15:00:16,171 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-22 15:00:16,172 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-22 15:00:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-22 15:00:16,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-22 15:00:16,195 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-22 15:00:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-07-22 15:00:16,199 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2022-07-22 15:00:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:16,199 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-07-22 15:00:16,200 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-22 15:00:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-07-22 15:00:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 15:00:16,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:16,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:16,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 15:00:16,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:16,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash -812668617, now seen corresponding path program 1 times [2022-07-22 15:00:16,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:16,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866969382] [2022-07-22 15:00:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:16,479 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-22 15:00:16,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:16,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866969382] [2022-07-22 15:00:16,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866969382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:00:16,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:00:16,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 15:00:16,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912748936] [2022-07-22 15:00:16,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:00:16,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 15:00:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:00:16,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 15:00:16,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-22 15:00:16,484 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-22 15:00:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:16,724 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-07-22 15:00:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 15:00:16,725 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-22 15:00:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:16,728 INFO L225 Difference]: With dead ends: 29 [2022-07-22 15:00:16,728 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 15:00:16,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-22 15:00:16,734 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-22 15:00:16,735 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-22 15:00:16,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 15:00:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-22 15:00:16,742 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-22 15:00:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-07-22 15:00:16,744 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 11 [2022-07-22 15:00:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:16,746 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-22 15:00:16,748 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-22 15:00:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-07-22 15:00:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 15:00:16,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:16,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:16,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 15:00:16,750 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:16,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:16,754 INFO L85 PathProgramCache]: Analyzing trace with hash -812666695, now seen corresponding path program 1 times [2022-07-22 15:00:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:16,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969186639] [2022-07-22 15:00:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:17,074 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-22 15:00:17,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:17,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969186639] [2022-07-22 15:00:17,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969186639] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:00:17,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:00:17,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 15:00:17,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893623929] [2022-07-22 15:00:17,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:00:17,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 15:00:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:00:17,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 15:00:17,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-22 15:00:17,079 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-22 15:00:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:17,222 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-07-22 15:00:17,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 15:00:17,223 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-22 15:00:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:17,223 INFO L225 Difference]: With dead ends: 31 [2022-07-22 15:00:17,223 INFO L226 Difference]: Without dead ends: 24 [2022-07-22 15:00:17,224 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-22 15:00:17,225 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-22 15:00:17,225 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-22 15:00:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-22 15:00:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-07-22 15:00:17,228 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-22 15:00:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-07-22 15:00:17,229 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 11 [2022-07-22 15:00:17,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:17,229 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-22 15:00:17,229 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-22 15:00:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-07-22 15:00:17,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 15:00:17,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:17,230 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:17,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 15:00:17,230 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:17,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:17,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1760681901, now seen corresponding path program 1 times [2022-07-22 15:00:17,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:17,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41204186] [2022-07-22 15:00:17,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:17,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:17,522 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-22 15:00:17,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:17,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41204186] [2022-07-22 15:00:17,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41204186] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:00:17,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477008937] [2022-07-22 15:00:17,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:17,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:17,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:00:17,528 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-22 15:00:17,530 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-22 15:00:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:17,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-22 15:00:17,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:17,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:17,779 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-22 15:00:17,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:17,799 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-22 15:00:17,816 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 15:00:17,816 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-22 15:00:17,878 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-07-22 15:00:17,879 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-22 15:00:17,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:17,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:17,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:17,911 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-22 15:00:17,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:17,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:17,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:17,940 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-22 15:00:18,039 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-22 15:00:18,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,047 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-22 15:00:18,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,341 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-22 15:00:18,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,355 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-22 15:00:18,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,400 INFO L356 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2022-07-22 15:00:18,401 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-22 15:00:18,410 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-22 15:00:18,438 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-22 15:00:18,623 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-22 15:00:18,624 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:187) 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:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:284) 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-22 15:00:18,628 INFO L158 Benchmark]: Toolchain (without parser) took 3776.61ms. Allocated memory was 96.5MB in the beginning and 155.2MB in the end (delta: 58.7MB). Free memory was 63.9MB in the beginning and 100.0MB in the end (delta: -36.1MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2022-07-22 15:00:18,629 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 54.5MB in the beginning and 54.4MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 15:00:18,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.52ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 63.7MB in the beginning and 97.0MB in the end (delta: -33.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 15:00:18,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.91ms. Allocated memory is still 127.9MB. Free memory was 97.0MB in the beginning and 94.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 15:00:18,630 INFO L158 Benchmark]: Boogie Preprocessor took 29.79ms. Allocated memory is still 127.9MB. Free memory was 94.9MB in the beginning and 93.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 15:00:18,630 INFO L158 Benchmark]: RCFGBuilder took 432.12ms. Allocated memory is still 127.9MB. Free memory was 93.7MB in the beginning and 80.0MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 15:00:18,630 INFO L158 Benchmark]: TraceAbstraction took 2886.93ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 79.5MB in the beginning and 100.0MB in the end (delta: -20.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-07-22 15:00:18,632 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.20ms. Allocated memory is still 96.5MB. Free memory was 54.5MB in the beginning and 54.4MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.52ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 63.7MB in the beginning and 97.0MB in the end (delta: -33.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.91ms. Allocated memory is still 127.9MB. Free memory was 97.0MB in the beginning and 94.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.79ms. Allocated memory is still 127.9MB. Free memory was 94.9MB in the beginning and 93.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.12ms. Allocated memory is still 127.9MB. Free memory was 93.7MB in the beginning and 80.0MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2886.93ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 79.5MB in the beginning and 100.0MB in the end (delta: -20.5MB). Peak memory consumption was 9.0MB. 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-22 15:00:18,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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-?-791161d [2022-07-22 15:00:20,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 15:00:20,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 15:00:20,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 15:00:20,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 15:00:20,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 15:00:20,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 15:00:20,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 15:00:20,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 15:00:20,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 15:00:20,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 15:00:20,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 15:00:20,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 15:00:20,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 15:00:20,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 15:00:20,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 15:00:20,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 15:00:20,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 15:00:20,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 15:00:20,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 15:00:20,767 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 15:00:20,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 15:00:20,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 15:00:20,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 15:00:20,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 15:00:20,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 15:00:20,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 15:00:20,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 15:00:20,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 15:00:20,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 15:00:20,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 15:00:20,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 15:00:20,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 15:00:20,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 15:00:20,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 15:00:20,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 15:00:20,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 15:00:20,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 15:00:20,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 15:00:20,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 15:00:20,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 15:00:20,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 15:00:20,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 15:00:20,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 15:00:20,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 15:00:20,828 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 15:00:20,828 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 15:00:20,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 15:00:20,829 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 15:00:20,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 15:00:20,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 15:00:20,830 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 15:00:20,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 15:00:20,831 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 15:00:20,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 15:00:20,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 15:00:20,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 15:00:20,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 15:00:20,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 15:00:20,832 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 15:00:20,833 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 15:00:20,833 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 15:00:20,833 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 15:00:20,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 15:00:20,833 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 15:00:20,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 15:00:20,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 15:00:20,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 15:00:20,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 15:00:20,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:00:20,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 15:00:20,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 15:00:20,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 15:00:20,835 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 15:00:20,835 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 15:00:20,836 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 15:00:20,836 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 15:00:20,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 15:00:20,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 15:00:20,836 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-22 15:00:21,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 15:00:21,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 15:00:21,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 15:00:21,213 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 15:00:21,214 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 15:00:21,216 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-22 15:00:21,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4059617/b9d2a1204b3b433d863dbc52162b82fa/FLAGc86b80c18 [2022-07-22 15:00:21,740 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 15:00:21,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-22 15:00:21,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4059617/b9d2a1204b3b433d863dbc52162b82fa/FLAGc86b80c18 [2022-07-22 15:00:21,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4059617/b9d2a1204b3b433d863dbc52162b82fa [2022-07-22 15:00:21,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 15:00:21,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 15:00:21,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 15:00:21,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 15:00:21,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 15:00:21,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:00:21" (1/1) ... [2022-07-22 15:00:21,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@419aeffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:21, skipping insertion in model container [2022-07-22 15:00:21,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:00:21" (1/1) ... [2022-07-22 15:00:21,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 15:00:21,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 15:00:22,131 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-22 15:00:22,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:00:22,155 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 15:00:22,205 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-22 15:00:22,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:00:22,233 INFO L208 MainTranslator]: Completed translation [2022-07-22 15:00:22,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:22 WrapperNode [2022-07-22 15:00:22,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 15:00:22,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 15:00:22,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 15:00:22,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 15:00:22,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:22" (1/1) ... [2022-07-22 15:00:22,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:22" (1/1) ... [2022-07-22 15:00:22,296 INFO L137 Inliner]: procedures = 124, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2022-07-22 15:00:22,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 15:00:22,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 15:00:22,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 15:00:22,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 15:00:22,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:22" (1/1) ... [2022-07-22 15:00:22,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:22" (1/1) ... [2022-07-22 15:00:22,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:22" (1/1) ... [2022-07-22 15:00:22,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:22" (1/1) ... [2022-07-22 15:00:22,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:22" (1/1) ... [2022-07-22 15:00:22,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:22" (1/1) ... [2022-07-22 15:00:22,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:22" (1/1) ... [2022-07-22 15:00:22,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 15:00:22,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 15:00:22,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 15:00:22,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 15:00:22,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:22" (1/1) ... [2022-07-22 15:00:22,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:00:22,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:00:22,387 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-22 15:00:22,406 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-22 15:00:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 15:00:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 15:00:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 15:00:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 15:00:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 15:00:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 15:00:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 15:00:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 15:00:22,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 15:00:22,507 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 15:00:22,510 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 15:00:23,013 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 15:00:23,017 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 15:00:23,017 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 15:00:23,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:00:23 BoogieIcfgContainer [2022-07-22 15:00:23,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 15:00:23,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 15:00:23,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 15:00:23,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 15:00:23,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 03:00:21" (1/3) ... [2022-07-22 15:00:23,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9053da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:00:23, skipping insertion in model container [2022-07-22 15:00:23,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:00:22" (2/3) ... [2022-07-22 15:00:23,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9053da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:00:23, skipping insertion in model container [2022-07-22 15:00:23,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:00:23" (3/3) ... [2022-07-22 15:00:23,026 INFO L111 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2022-07-22 15:00:23,039 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 15:00:23,040 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 15:00:23,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 15:00:23,091 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@f1fb7dc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@436986ec [2022-07-22 15:00:23,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 15:00:23,095 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-22 15:00:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 15:00:23,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:23,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:23,101 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:23,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:23,106 INFO L85 PathProgramCache]: Analyzing trace with hash -15033972, now seen corresponding path program 1 times [2022-07-22 15:00:23,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:00:23,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530608317] [2022-07-22 15:00:23,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:23,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:00:23,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:00:23,120 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-22 15:00:23,122 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-22 15:00:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:23,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 15:00:23,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:23,246 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-22 15:00:23,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:00:23,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:00:23,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530608317] [2022-07-22 15:00:23,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530608317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:00:23,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:00:23,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 15:00:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924953890] [2022-07-22 15:00:23,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:00:23,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 15:00:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:00:23,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 15:00:23,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 15:00:23,289 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-22 15:00:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:23,301 INFO L93 Difference]: Finished difference Result 26 states and 37 transitions. [2022-07-22 15:00:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 15:00:23,303 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-22 15:00:23,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:23,309 INFO L225 Difference]: With dead ends: 26 [2022-07-22 15:00:23,310 INFO L226 Difference]: Without dead ends: 12 [2022-07-22 15:00:23,313 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-22 15:00:23,316 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-22 15:00:23,318 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-22 15:00:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-07-22 15:00:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-22 15:00:23,345 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-22 15:00:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-07-22 15:00:23,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2022-07-22 15:00:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:23,348 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-07-22 15:00:23,348 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-22 15:00:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-07-22 15:00:23,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 15:00:23,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:23,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:23,363 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-22 15:00:23,561 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-22 15:00:23,561 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:23,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash -263268138, now seen corresponding path program 1 times [2022-07-22 15:00:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:00:23,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272903569] [2022-07-22 15:00:23,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:23,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:00:23,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:00:23,578 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-22 15:00:23,581 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-22 15:00:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:23,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 15:00:23,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:23,808 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 15:00:23,809 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-22 15:00:23,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:23,820 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-22 15:00:23,927 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-07-22 15:00:23,928 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-22 15:00:23,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:23,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:23,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:23,976 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-22 15:00:24,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:24,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:24,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:24,026 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-22 15:00:24,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:24,160 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-22 15:00:24,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:24,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:24,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:24,177 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-22 15:00:24,811 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-22 15:00:24,817 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-22 15:00:24,902 INFO L356 Elim1Store]: treesize reduction 19, result has 48.6 percent of original size [2022-07-22 15:00:24,903 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-22 15:00:24,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:24,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:24,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:24,942 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-22 15:00:24,964 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-22 15:00:25,071 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-07-22 15:00:25,072 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-22 15:00:33,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:33,561 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-22 15:00:33,765 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-22 15:00:33,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:00:33,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:00:33,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272903569] [2022-07-22 15:00:33,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272903569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:00:33,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:00:33,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 15:00:33,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306351246] [2022-07-22 15:00:33,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:00:33,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 15:00:33,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:00:33,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 15:00:33,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=38, Unknown=3, NotChecked=0, Total=56 [2022-07-22 15:00:33,768 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-22 15:00:33,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:33,926 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-07-22 15:00:33,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 15:00:33,928 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-22 15:00:33,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:33,928 INFO L225 Difference]: With dead ends: 22 [2022-07-22 15:00:33,928 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 15:00:33,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=15, Invalid=38, Unknown=3, NotChecked=0, Total=56 [2022-07-22 15:00:33,930 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-22 15:00:33,930 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-22 15:00:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 15:00:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 15:00:33,935 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-22 15:00:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2022-07-22 15:00:33,936 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 10 [2022-07-22 15:00:33,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:33,938 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-22 15:00:33,938 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-22 15:00:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2022-07-22 15:00:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 15:00:33,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:33,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:33,952 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-22 15:00:34,151 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-22 15:00:34,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:34,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:34,153 INFO L85 PathProgramCache]: Analyzing trace with hash -263266216, now seen corresponding path program 1 times [2022-07-22 15:00:34,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:00:34,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142824677] [2022-07-22 15:00:34,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:34,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:00:34,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:00:34,155 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-22 15:00:34,157 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-22 15:00:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:34,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-22 15:00:34,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:34,339 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 15:00:34,340 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-22 15:00:34,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:34,352 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-22 15:00:34,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:34,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:34,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:34,476 INFO L356 Elim1Store]: treesize reduction 80, result has 29.2 percent of original size [2022-07-22 15:00:34,476 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-22 15:00:34,524 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-22 15:00:34,709 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-22 15:00:34,720 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-22 15:00:34,729 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-22 15:00:34,779 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-22 15:00:34,796 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-22 15:00:34,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:00:34,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:00:34,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142824677] [2022-07-22 15:00:34,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142824677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:00:34,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:00:34,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 15:00:34,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568806945] [2022-07-22 15:00:34,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:00:34,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 15:00:34,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:00:34,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 15:00:34,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 15:00:34,804 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-22 15:00:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:35,370 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-07-22 15:00:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 15:00:35,370 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-22 15:00:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:35,371 INFO L225 Difference]: With dead ends: 27 [2022-07-22 15:00:35,371 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 15:00:35,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 15:00:35,372 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.5s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:35,373 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.5s Time] [2022-07-22 15:00:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 15:00:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 15:00:35,376 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-22 15:00:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-07-22 15:00:35,377 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 10 [2022-07-22 15:00:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:35,377 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-22 15:00:35,377 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-22 15:00:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-07-22 15:00:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 15:00:35,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:35,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:35,387 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-22 15:00:35,579 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-22 15:00:35,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:35,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash -261421096, now seen corresponding path program 1 times [2022-07-22 15:00:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:00:35,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473092088] [2022-07-22 15:00:35,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:35,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:00:35,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:00:35,583 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-22 15:00:35,585 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-22 15:00:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:35,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-22 15:00:35,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:35,707 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 15:00:35,707 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-22 15:00:35,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:35,721 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-22 15:00:35,728 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-22 15:00:35,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:35,736 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-22 15:00:35,744 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-22 15:00:35,817 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-22 15:00:35,822 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-22 15:00:35,826 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-22 15:00:35,840 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-22 15:00:35,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:00:35,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:00:35,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473092088] [2022-07-22 15:00:35,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473092088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:00:35,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:00:35,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 15:00:35,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166178084] [2022-07-22 15:00:35,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:00:35,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 15:00:35,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:00:35,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 15:00:35,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:00:35,842 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-22 15:00:36,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:36,722 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-07-22 15:00:36,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:00:36,724 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-22 15:00:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:36,724 INFO L225 Difference]: With dead ends: 27 [2022-07-22 15:00:36,724 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 15:00:36,725 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-22 15:00:36,725 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-22 15:00:36,726 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-22 15:00:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 15:00:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 15:00:36,729 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-22 15:00:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-22 15:00:36,730 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2022-07-22 15:00:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:36,730 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-22 15:00:36,730 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-22 15:00:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-07-22 15:00:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 15:00:36,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:36,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:36,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-22 15:00:36,931 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-22 15:00:36,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash -434920839, now seen corresponding path program 1 times [2022-07-22 15:00:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:00:36,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609387953] [2022-07-22 15:00:36,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:36,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:00:36,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:00:36,934 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-22 15:00:36,935 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-22 15:00:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:37,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-22 15:00:37,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:37,169 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-22 15:00:37,170 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-22 15:00:37,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,189 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-22 15:00:37,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,201 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-22 15:00:37,209 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-22 15:00:37,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,223 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-22 15:00:37,232 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-22 15:00:37,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,251 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-22 15:00:37,499 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-22 15:00:37,500 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-22 15:00:37,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,629 INFO L356 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-07-22 15:00:37,629 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-22 15:00:37,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,653 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-22 15:00:37,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,671 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-22 15:00:37,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,687 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-22 15:00:37,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,701 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-22 15:00:37,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,743 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-22 15:00:37,744 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-22 15:00:37,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:37,758 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-22 15:00:38,119 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-22 15:00:38,146 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-07-22 15:00:38,146 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-22 15:00:38,156 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 15:00:38,157 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-22 15:00:38,211 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 15:00:38,211 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-22 15:00:38,233 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-22 15:00:38,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:00:38,717 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-22 15:00:38,717 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-22 15:00:38,955 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-22 15:00:39,205 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-22 15:00:39,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:00:39,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609387953] [2022-07-22 15:00:39,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609387953] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:00:39,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 15:00:39,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-07-22 15:00:39,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727416454] [2022-07-22 15:00:39,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 15:00:39,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 15:00:39,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:00:39,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 15:00:39,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2022-07-22 15:00:39,211 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-22 15:00:41,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:00:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:41,746 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-07-22 15:00:41,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 15:00:41,748 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-22 15:00:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:41,749 INFO L225 Difference]: With dead ends: 33 [2022-07-22 15:00:41,749 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 15:00:41,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=172, Unknown=1, NotChecked=28, Total=272 [2022-07-22 15:00:41,750 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:41,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 34 Invalid, 0 Unknown, 76 Unchecked, 1.9s Time] [2022-07-22 15:00:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 15:00:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-07-22 15:00:41,755 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-22 15:00:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-07-22 15:00:41,756 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 12 [2022-07-22 15:00:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:41,756 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-07-22 15:00:41,756 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-22 15:00:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-07-22 15:00:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 15:00:41,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:41,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:41,771 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-22 15:00:41,957 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-22 15:00:41,957 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:41,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash -434918917, now seen corresponding path program 1 times [2022-07-22 15:00:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:00:41,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655815598] [2022-07-22 15:00:41,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:41,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:00:41,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:00:41,960 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-22 15:00:41,961 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-22 15:00:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:42,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-22 15:00:42,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:42,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,172 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-22 15:00:42,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,207 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-22 15:00:42,208 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-22 15:00:42,246 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-22 15:00:42,246 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-22 15:00:42,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,372 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-22 15:00:42,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,428 INFO L356 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-07-22 15:00:42,428 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-22 15:00:42,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,439 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-22 15:00:42,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,448 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-22 15:00:42,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,472 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-22 15:00:42,472 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-22 15:00:42,578 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-22 15:00:42,676 INFO L356 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-07-22 15:00:42,676 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-22 15:00:42,691 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-22 15:00:42,899 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:42,899 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-22 15:00:42,981 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-22 15:00:42,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:00:43,069 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-22 15:00:45,079 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-22 15:00:47,109 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-22 15:00:47,181 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-22 15:00:47,293 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-22 15:00:47,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:00:47,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655815598] [2022-07-22 15:00:47,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655815598] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:00:47,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 15:00:47,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2022-07-22 15:00:47,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577227509] [2022-07-22 15:00:47,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 15:00:47,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 15:00:47,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:00:47,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 15:00:47,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=49, Unknown=3, NotChecked=48, Total=132 [2022-07-22 15:00:47,297 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-22 15:00:49,852 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-22 15:00:51,868 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-22 15:00:53,995 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-22 15:00:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:54,127 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-07-22 15:00:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 15:00:54,127 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-22 15:00:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:54,128 INFO L225 Difference]: With dead ends: 37 [2022-07-22 15:00:54,128 INFO L226 Difference]: Without dead ends: 30 [2022-07-22 15:00:54,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=52, Invalid=76, Unknown=6, NotChecked=138, Total=272 [2022-07-22 15:00:54,129 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-22 15:00:54,129 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-22 15:00:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-22 15:00:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-22 15:00:54,134 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-22 15:00:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-07-22 15:00:54,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2022-07-22 15:00:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:54,134 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-07-22 15:00:54,135 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-22 15:00:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-07-22 15:00:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 15:00:54,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:54,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:54,147 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-22 15:00:54,347 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-22 15:00:54,347 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:54,348 INFO L85 PathProgramCache]: Analyzing trace with hash -433073797, now seen corresponding path program 1 times [2022-07-22 15:00:54,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:00:54,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180401455] [2022-07-22 15:00:54,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:54,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:00:54,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:00:54,350 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-22 15:00:54,350 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-22 15:00:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:54,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-22 15:00:54,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:54,567 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-22 15:00:54,567 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-22 15:00:54,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:54,593 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-22 15:00:54,604 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-22 15:00:54,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-22 15:00:54,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:54,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:54,685 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-22 15:00:54,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:54,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:54,697 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-22 15:00:54,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:54,705 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-22 15:00:54,728 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-22 15:00:54,728 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-22 15:00:54,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:54,819 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-22 15:00:54,869 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-22 15:00:54,892 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 15:00:54,893 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-22 15:00:54,897 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-22 15:00:54,925 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-22 15:00:54,939 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-22 15:00:54,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:00:55,011 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-22 15:00:55,186 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-22 15:00:55,246 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-22 15:00:55,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:00:55,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180401455] [2022-07-22 15:00:55,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180401455] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:00:55,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 15:00:55,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-22 15:00:55,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108829969] [2022-07-22 15:00:55,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 15:00:55,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 15:00:55,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:00:55,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 15:00:55,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=92, Unknown=5, NotChecked=20, Total=156 [2022-07-22 15:00:55,249 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-22 15:00:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:55,848 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-07-22 15:00:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 15:00:55,849 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-22 15:00:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:55,849 INFO L225 Difference]: With dead ends: 29 [2022-07-22 15:00:55,849 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 15:00:55,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=124, Unknown=5, NotChecked=24, Total=210 [2022-07-22 15:00:55,850 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:55,850 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.5s Time] [2022-07-22 15:00:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 15:00:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-22 15:00:55,855 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-22 15:00:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-07-22 15:00:55,855 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 12 [2022-07-22 15:00:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:55,856 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-22 15:00:55,856 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-22 15:00:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-07-22 15:00:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 15:00:55,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:55,857 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:55,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-22 15:00:56,069 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-22 15:00:56,069 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:56,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:56,070 INFO L85 PathProgramCache]: Analyzing trace with hash -857850716, now seen corresponding path program 1 times [2022-07-22 15:00:56,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:00:56,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84229417] [2022-07-22 15:00:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:56,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:00:56,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:00:56,072 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-22 15:00:56,072 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-22 15:00:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:56,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-22 15:00:56,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:56,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,274 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-22 15:00:56,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,284 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-22 15:00:56,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,301 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-22 15:00:56,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,310 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-22 15:00:56,319 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-22 15:00:56,326 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-22 15:00:56,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,352 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-22 15:00:56,511 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 15:00:56,512 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-22 15:00:56,520 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-22 15:00:56,527 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-22 15:00:58,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:58,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:58,758 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 15:00:58,758 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-22 15:00:58,774 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-22 15:00:58,774 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-22 15:00:58,779 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-22 15:00:58,801 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-22 15:00:58,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:02,930 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-22 15:01:02,972 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-22 15:01:03,080 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-22 15:01:03,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:01:03,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84229417] [2022-07-22 15:01:03,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84229417] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:03,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 15:01:03,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-22 15:01:03,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6980724] [2022-07-22 15:01:03,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:03,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 15:01:03,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:01:03,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 15:01:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=5, NotChecked=34, Total=132 [2022-07-22 15:01:03,082 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-22 15:01:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:16,944 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-07-22 15:01:16,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 15:01:16,946 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-22 15:01:16,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:16,947 INFO L225 Difference]: With dead ends: 38 [2022-07-22 15:01:16,947 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 15:01:16,947 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-22 15:01:16,948 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:16,948 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.5s Time] [2022-07-22 15:01:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 15:01:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-07-22 15:01:16,953 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-22 15:01:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-22 15:01:16,954 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 15 [2022-07-22 15:01:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:16,954 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-22 15:01:16,955 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-22 15:01:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-22 15:01:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 15:01:16,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:16,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:16,969 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-22 15:01:17,163 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-22 15:01:17,163 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:17,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:17,164 INFO L85 PathProgramCache]: Analyzing trace with hash -856003674, now seen corresponding path program 1 times [2022-07-22 15:01:17,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:01:17,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261807524] [2022-07-22 15:01:17,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:17,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:01:17,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:01:17,166 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-22 15:01:17,166 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-22 15:01:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:17,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-22 15:01:17,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:17,365 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 15:01:17,365 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-22 15:01:17,376 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-22 15:01:17,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:17,387 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-22 15:01:17,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:17,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:17,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:17,403 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-22 15:01:17,564 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 15:01:17,565 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-22 15:01:17,579 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-22 15:01:17,593 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-22 15:01:19,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:19,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:20,000 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 15:01:20,000 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-22 15:01:20,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:20,029 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-22 15:01:20,029 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-22 15:01:20,035 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-22 15:01:20,214 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-22 15:01:20,238 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-22 15:01:20,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:33,944 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-22 15:01:33,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:01:33,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261807524] [2022-07-22 15:01:33,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261807524] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:33,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 15:01:33,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-22 15:01:33,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606066085] [2022-07-22 15:01:33,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:33,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 15:01:33,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:01:33,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 15:01:33,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=107, Unknown=14, NotChecked=0, Total=156 [2022-07-22 15:01:33,946 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-22 15:01:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:53,041 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-07-22 15:01:53,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 15:01:53,041 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-22 15:01:53,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:53,042 INFO L225 Difference]: With dead ends: 36 [2022-07-22 15:01:53,042 INFO L226 Difference]: Without dead ends: 34 [2022-07-22 15:01:53,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=65, Invalid=187, Unknown=20, NotChecked=0, Total=272 [2022-07-22 15:01:53,043 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:53,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 75 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2022-07-22 15:01:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-22 15:01:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-07-22 15:01:53,049 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-22 15:01:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-22 15:01:53,049 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2022-07-22 15:01:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:53,050 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-22 15:01:53,050 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-22 15:01:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-22 15:01:53,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 15:01:53,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:53,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:53,068 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-22 15:01:53,251 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-22 15:01:53,252 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:53,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:53,252 INFO L85 PathProgramCache]: Analyzing trace with hash -856001752, now seen corresponding path program 1 times [2022-07-22 15:01:53,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:01:53,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259455865] [2022-07-22 15:01:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:53,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:01:53,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:01:53,254 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-22 15:01:53,255 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-22 15:01:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:53,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 15:01:53,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:53,433 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 15:01:53,434 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-22 15:01:53,444 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-22 15:01:53,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:53,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:53,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:53,463 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-22 15:01:53,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:53,480 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-22 15:01:53,701 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 15:01:53,702 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-22 15:01:53,711 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-22 15:01:53,718 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-22 15:01:56,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:56,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:56,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:56,052 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 15:01:56,052 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-22 15:01:56,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:56,076 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-22 15:01:56,077 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-22 15:01:56,083 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-22 15:01:56,130 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-22 15:01:56,153 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-22 15:01:56,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:02:00,445 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 (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse12))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_641)) (.cse13 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse13)) (.cse8 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_639))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~list~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_~list~0#1.base|) .cse12))) (store .cse10 .cse11 (bvadd (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select .cse10 .cse11)))))) (.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-22 15:02:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 15:02:03,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:02:03,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259455865] [2022-07-22 15:02:03,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259455865] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:02:03,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 15:02:03,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-22 15:02:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601086874] [2022-07-22 15:02:03,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 15:02:03,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 15:02:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:02:03,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 15:02:03,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=95, Unknown=6, NotChecked=20, Total=156 [2022-07-22 15:02:03,021 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-22 15:02:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:02:34,149 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-07-22 15:02:34,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 15:02:34,150 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-22 15:02:34,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:02:34,150 INFO L225 Difference]: With dead ends: 36 [2022-07-22 15:02:34,150 INFO L226 Difference]: Without dead ends: 29 [2022-07-22 15:02:34,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=77, Invalid=183, Unknown=16, NotChecked=30, Total=306 [2022-07-22 15:02:34,151 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 15:02:34,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 45 Unchecked, 0.6s Time] [2022-07-22 15:02:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-22 15:02:34,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-22 15:02:34,157 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-22 15:02:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-22 15:02:34,158 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 15 [2022-07-22 15:02:34,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:02:34,158 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-22 15:02:34,158 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-22 15:02:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-22 15:02:34,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 15:02:34,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:02:34,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:02:34,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-22 15:02:34,359 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-22 15:02:34,360 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:02:34,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:02:34,360 INFO L85 PathProgramCache]: Analyzing trace with hash -439025439, now seen corresponding path program 1 times [2022-07-22 15:02:34,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:02:34,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589624336] [2022-07-22 15:02:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:02:34,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:02:34,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:02:34,362 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-22 15:02:34,364 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-22 15:02:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:02:34,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-22 15:02:34,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:02:34,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:34,624 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-22 15:02:34,646 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-22 15:02:34,646 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-22 15:02:34,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:34,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:34,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:34,735 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-22 15:02:34,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:34,746 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-22 15:02:34,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:34,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:34,758 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-22 15:02:34,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:34,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:34,770 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-22 15:02:34,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:34,783 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-22 15:02:34,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:34,791 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-22 15:02:34,819 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-22 15:02:34,819 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-22 15:02:34,829 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-22 15:02:35,072 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-22 15:02:35,074 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-22 15:02:35,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:35,083 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-22 15:02:35,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:35,089 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-22 15:02:35,678 INFO L356 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2022-07-22 15:02:35,678 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-22 15:02:35,689 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-22 15:02:35,739 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-07-22 15:02:35,739 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-22 15:02:36,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:02:36,989 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-22 15:02:37,217 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-22 15:02:37,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:02:47,278 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-22 15:02:47,430 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-22 15:02:48,189 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-22 15:02:48,190 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-22 15:02:48,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:02:48,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:02:48,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:02:48,800 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:02:48,801 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-22 15:03:12,037 WARN L233 SmtUtils]: Spent 23.18s 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-22 15:03:12,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:03:12,039 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