./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 b5317dae 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-?-b5317da-m [2023-02-16 01:11:38,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 01:11:38,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 01:11:38,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 01:11:38,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 01:11:38,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 01:11:38,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 01:11:38,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 01:11:38,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 01:11:38,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 01:11:38,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 01:11:38,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 01:11:38,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 01:11:38,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 01:11:38,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 01:11:38,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 01:11:38,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 01:11:38,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 01:11:38,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 01:11:38,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 01:11:38,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 01:11:38,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 01:11:38,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 01:11:38,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 01:11:38,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 01:11:38,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 01:11:38,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 01:11:38,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 01:11:38,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 01:11:38,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 01:11:38,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 01:11:38,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 01:11:38,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 01:11:38,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 01:11:38,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 01:11:38,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 01:11:38,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 01:11:38,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 01:11:38,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 01:11:38,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 01:11:38,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 01:11:38,825 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 01:11:38,842 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 01:11:38,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 01:11:38,845 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 01:11:38,845 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 01:11:38,845 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 01:11:38,846 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 01:11:38,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 01:11:38,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 01:11:38,846 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 01:11:38,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 01:11:38,847 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 01:11:38,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 01:11:38,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 01:11:38,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 01:11:38,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 01:11:38,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 01:11:38,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 01:11:38,848 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 01:11:38,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 01:11:38,848 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 01:11:38,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 01:11:38,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 01:11:38,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 01:11:38,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 01:11:38,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:11:38,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 01:11:38,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 01:11:38,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 01:11:38,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 01:11:38,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 01:11:38,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 01:11:38,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 01:11:38,850 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 01:11:38,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 01:11:38,850 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 01:11:38,851 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-16 01:11:39,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 01:11:39,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 01:11:39,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 01:11:39,102 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 01:11:39,102 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 01:11:39,103 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem1.i [2023-02-16 01:11:40,031 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 01:11:40,188 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 01:11:40,189 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2023-02-16 01:11:40,196 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cad8065b1/b9496ce58ff141f4a90171af42b0c740/FLAGbeb241c94 [2023-02-16 01:11:40,209 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cad8065b1/b9496ce58ff141f4a90171af42b0c740 [2023-02-16 01:11:40,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 01:11:40,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 01:11:40,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 01:11:40,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 01:11:40,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 01:11:40,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15384bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40, skipping insertion in model container [2023-02-16 01:11:40,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 01:11:40,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 01:11:40,418 WARN L237 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] [2023-02-16 01:11:40,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:11:40,438 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 01:11:40,502 WARN L237 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] [2023-02-16 01:11:40,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:11:40,533 INFO L208 MainTranslator]: Completed translation [2023-02-16 01:11:40,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40 WrapperNode [2023-02-16 01:11:40,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 01:11:40,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 01:11:40,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 01:11:40,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 01:11:40,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,558 INFO L138 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2023-02-16 01:11:40,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 01:11:40,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 01:11:40,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 01:11:40,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 01:11:40,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,575 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 01:11:40,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 01:11:40,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 01:11:40,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 01:11:40,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40" (1/1) ... [2023-02-16 01:11:40,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:11:40,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:11:40,601 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) [2023-02-16 01:11:40,606 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 [2023-02-16 01:11:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 01:11:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 01:11:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 01:11:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 01:11:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 01:11:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 01:11:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 01:11:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 01:11:40,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 01:11:40,732 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 01:11:40,733 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 01:11:40,953 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 01:11:40,957 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 01:11:40,958 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 01:11:40,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:11:40 BoogieIcfgContainer [2023-02-16 01:11:40,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 01:11:40,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 01:11:40,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 01:11:40,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 01:11:40,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:11:40" (1/3) ... [2023-02-16 01:11:40,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2d55e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:11:40, skipping insertion in model container [2023-02-16 01:11:40,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:11:40" (2/3) ... [2023-02-16 01:11:40,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2d55e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:11:40, skipping insertion in model container [2023-02-16 01:11:40,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:11:40" (3/3) ... [2023-02-16 01:11:40,964 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2023-02-16 01:11:40,977 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 01:11:40,977 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 01:11:41,011 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 01:11:41,015 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13bd0feb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 01:11:41,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 01:11:41,018 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) [2023-02-16 01:11:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 01:11:41,022 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:11:41,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:11:41,023 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:11:41,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:11:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1650103796, now seen corresponding path program 1 times [2023-02-16 01:11:41,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:11:41,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137351488] [2023-02-16 01:11:41,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:41,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:11:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:41,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:11:41,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137351488] [2023-02-16 01:11:41,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137351488] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:11:41,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:11:41,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 01:11:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794713977] [2023-02-16 01:11:41,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:11:41,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 01:11:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:41,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 01:11:41,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 01:11:41,234 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) [2023-02-16 01:11:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:11:41,244 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2023-02-16 01:11:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 01:11:41,246 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 [2023-02-16 01:11:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:11:41,250 INFO L225 Difference]: With dead ends: 27 [2023-02-16 01:11:41,250 INFO L226 Difference]: Without dead ends: 13 [2023-02-16 01:11:41,251 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 [2023-02-16 01:11:41,254 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 [2023-02-16 01:11:41,254 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] [2023-02-16 01:11:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-02-16 01:11:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-02-16 01:11:41,275 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) [2023-02-16 01:11:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2023-02-16 01:11:41,277 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2023-02-16 01:11:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:11:41,278 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2023-02-16 01:11:41,278 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) [2023-02-16 01:11:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2023-02-16 01:11:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 01:11:41,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:11:41,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:11:41,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 01:11:41,280 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:11:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:11:41,281 INFO L85 PathProgramCache]: Analyzing trace with hash -812668617, now seen corresponding path program 1 times [2023-02-16 01:11:41,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:11:41,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085396619] [2023-02-16 01:11:41,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:41,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:11:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:41,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:11:41,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085396619] [2023-02-16 01:11:41,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085396619] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:11:41,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:11:41,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 01:11:41,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833115323] [2023-02-16 01:11:41,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:11:41,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 01:11:41,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:41,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 01:11:41,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 01:11:41,934 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) [2023-02-16 01:11:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:11:42,103 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-16 01:11:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 01:11:42,103 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 [2023-02-16 01:11:42,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:11:42,105 INFO L225 Difference]: With dead ends: 29 [2023-02-16 01:11:42,105 INFO L226 Difference]: Without dead ends: 27 [2023-02-16 01:11:42,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-02-16 01:11:42,107 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:11:42,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:11:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-16 01:11:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-02-16 01:11:42,114 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) [2023-02-16 01:11:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-16 01:11:42,115 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 11 [2023-02-16 01:11:42,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:11:42,116 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-16 01:11:42,117 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) [2023-02-16 01:11:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-16 01:11:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 01:11:42,117 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:11:42,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:11:42,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 01:11:42,118 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:11:42,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:11:42,119 INFO L85 PathProgramCache]: Analyzing trace with hash -812666695, now seen corresponding path program 1 times [2023-02-16 01:11:42,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:11:42,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853017417] [2023-02-16 01:11:42,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:42,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:11:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:11:42,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853017417] [2023-02-16 01:11:42,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853017417] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:11:42,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:11:42,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 01:11:42,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237709201] [2023-02-16 01:11:42,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:11:42,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 01:11:42,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:42,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 01:11:42,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 01:11:42,530 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) [2023-02-16 01:11:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:11:42,626 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2023-02-16 01:11:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 01:11:42,627 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 [2023-02-16 01:11:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:11:42,628 INFO L225 Difference]: With dead ends: 31 [2023-02-16 01:11:42,628 INFO L226 Difference]: Without dead ends: 24 [2023-02-16 01:11:42,631 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 [2023-02-16 01:11:42,634 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:11:42,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 38 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:11:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-16 01:11:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-02-16 01:11:42,641 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) [2023-02-16 01:11:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2023-02-16 01:11:42,642 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 11 [2023-02-16 01:11:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:11:42,642 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2023-02-16 01:11:42,642 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) [2023-02-16 01:11:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2023-02-16 01:11:42,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 01:11:42,643 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:11:42,643 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:11:42,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 01:11:42,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:11:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:11:42,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1760681901, now seen corresponding path program 1 times [2023-02-16 01:11:42,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:11:42,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372629048] [2023-02-16 01:11:42,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:42,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:11:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:11:43,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372629048] [2023-02-16 01:11:43,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372629048] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:11:43,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646452912] [2023-02-16 01:11:43,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:43,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:43,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:11:43,193 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) [2023-02-16 01:11:43,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 01:11:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:43,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-16 01:11:43,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:11:43,335 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 01:11:43,336 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,373 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2023-02-16 01:11:43,375 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,394 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,414 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,521 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,526 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,547 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,554 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,669 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,676 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,699 INFO L321 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2023-02-16 01:11:43,700 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,710 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:11:43,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-16 01:11:43,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,735 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 20 [2023-02-16 01:11:43,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:43,750 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 28 [2023-02-16 01:11:43,757 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,762 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:43,883 INFO L350 Elim1Store]: Elim1 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 67 treesize of output 47 [2023-02-16 01:11:43,887 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:43,899 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2023-02-16 01:11:43,899 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 42 [2023-02-16 01:11:43,903 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 13 [2023-02-16 01:11:43,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:43,997 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 29 [2023-02-16 01:11:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:44,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:11:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:44,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646452912] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:11:44,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:11:44,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-02-16 01:11:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337405512] [2023-02-16 01:11:44,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:11:44,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 01:11:44,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 01:11:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=246, Unknown=2, NotChecked=0, Total=306 [2023-02-16 01:11:44,294 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:11:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:11:44,865 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2023-02-16 01:11:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 01:11:44,865 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 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 14 [2023-02-16 01:11:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:11:44,866 INFO L225 Difference]: With dead ends: 42 [2023-02-16 01:11:44,866 INFO L226 Difference]: Without dead ends: 32 [2023-02-16 01:11:44,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=405, Unknown=7, NotChecked=0, Total=552 [2023-02-16 01:11:44,867 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 78 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 29 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 01:11:44,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 54 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 85 Invalid, 11 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 01:11:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-16 01:11:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2023-02-16 01:11:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:11:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-02-16 01:11:44,870 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2023-02-16 01:11:44,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:11:44,870 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-02-16 01:11:44,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:11:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-02-16 01:11:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 01:11:44,870 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:11:44,871 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:11:44,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 01:11:45,076 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 [2023-02-16 01:11:45,077 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:11:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:11:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1760679979, now seen corresponding path program 1 times [2023-02-16 01:11:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:11:45,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373432114] [2023-02-16 01:11:45,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:11:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:45,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:11:45,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373432114] [2023-02-16 01:11:45,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373432114] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:11:45,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329307191] [2023-02-16 01:11:45,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:45,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:45,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:11:45,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:11:45,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 01:11:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:45,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-16 01:11:45,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:11:45,595 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:45,619 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-02-16 01:11:45,620 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2023-02-16 01:11:45,668 INFO L321 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2023-02-16 01:11:45,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 91 [2023-02-16 01:11:45,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,684 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:45,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,713 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:45,728 INFO L350 Elim1Store]: Elim1 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 97 treesize of output 75 [2023-02-16 01:11:45,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,734 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 53 [2023-02-16 01:11:45,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 121 [2023-02-16 01:11:45,830 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:45,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-02-16 01:11:45,855 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:11:45,855 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-02-16 01:11:45,864 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:45,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,971 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:45,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,978 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:45,982 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:45,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2023-02-16 01:11:45,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:45,994 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:46,004 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-16 01:11:46,005 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-02-16 01:11:46,008 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:46,092 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 36 [2023-02-16 01:11:46,095 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:46,095 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 30 [2023-02-16 01:11:46,099 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 17 [2023-02-16 01:11:46,121 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:11:46,121 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 16 [2023-02-16 01:11:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:46,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:11:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:46,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329307191] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:11:46,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:11:46,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2023-02-16 01:11:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836223645] [2023-02-16 01:11:46,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:11:46,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-16 01:11:46,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:46,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-16 01:11:46,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-02-16 01:11:46,332 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 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) [2023-02-16 01:11:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:11:46,634 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2023-02-16 01:11:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 01:11:46,635 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-16 01:11:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:11:46,635 INFO L225 Difference]: With dead ends: 35 [2023-02-16 01:11:46,636 INFO L226 Difference]: Without dead ends: 28 [2023-02-16 01:11:46,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2023-02-16 01:11:46,636 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:11:46,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:11:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-16 01:11:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2023-02-16 01:11:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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) [2023-02-16 01:11:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-16 01:11:46,639 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 14 [2023-02-16 01:11:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:11:46,639 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-16 01:11:46,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 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) [2023-02-16 01:11:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-16 01:11:46,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 01:11:46,639 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:11:46,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:11:46,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 01:11:46,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:46,845 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:11:46,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:11:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash 187961508, now seen corresponding path program 1 times [2023-02-16 01:11:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:11:46,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950527505] [2023-02-16 01:11:46,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:46,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:11:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:47,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:11:47,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950527505] [2023-02-16 01:11:47,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950527505] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:11:47,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396633787] [2023-02-16 01:11:47,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:47,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:47,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:11:47,255 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:11:47,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 01:11:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:47,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-16 01:11:47,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:11:47,357 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:47,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:47,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:47,365 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:47,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:47,371 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:47,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:47,375 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:47,381 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 14 [2023-02-16 01:11:47,385 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:47,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:47,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:47,409 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:47,496 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:11:47,496 INFO L350 Elim1Store]: Elim1 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 111 treesize of output 102 [2023-02-16 01:11:47,500 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 38 [2023-02-16 01:11:47,504 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:47,580 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 32 [2023-02-16 01:11:47,586 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:11:47,586 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 16 [2023-02-16 01:11:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:47,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:11:47,645 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_517 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse0 (select |c_#memory_int| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (or (not (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select .cse0 .cse1)) v_ArrVal_517)) (< 100 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_515)) (.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_518)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) 4))) (select (select (store |c_#memory_int| .cse2 (store .cse0 .cse1 v_ArrVal_517)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))))) is different from false [2023-02-16 01:11:47,659 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_517 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (or (< 100 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_515)) (.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_518)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (select (select (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_517)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse1 .cse2)) v_ArrVal_517))))))) is different from false [2023-02-16 01:11:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 01:11:47,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396633787] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:11:47,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:11:47,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 7] total 19 [2023-02-16 01:11:47,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426897923] [2023-02-16 01:11:47,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:11:47,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 01:11:47,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:47,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 01:11:47,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=232, Unknown=2, NotChecked=62, Total=342 [2023-02-16 01:11:47,690 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:11:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:11:52,826 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2023-02-16 01:11:52,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 01:11:52,827 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 01:11:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:11:52,828 INFO L225 Difference]: With dead ends: 66 [2023-02-16 01:11:52,828 INFO L226 Difference]: Without dead ends: 59 [2023-02-16 01:11:52,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=197, Invalid=565, Unknown=2, NotChecked=106, Total=870 [2023-02-16 01:11:52,828 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 141 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 01:11:52,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 130 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 167 Invalid, 0 Unknown, 71 Unchecked, 0.3s Time] [2023-02-16 01:11:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-16 01:11:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2023-02-16 01:11:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:11:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2023-02-16 01:11:52,837 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 16 [2023-02-16 01:11:52,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:11:52,838 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2023-02-16 01:11:52,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:11:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2023-02-16 01:11:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 01:11:52,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:11:52,838 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:11:52,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 01:11:53,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:53,041 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:11:53,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:11:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash 189810472, now seen corresponding path program 1 times [2023-02-16 01:11:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:11:53,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843819444] [2023-02-16 01:11:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:11:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:53,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:11:53,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843819444] [2023-02-16 01:11:53,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843819444] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:11:53,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127419829] [2023-02-16 01:11:53,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:53,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:53,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:11:53,414 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:11:53,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 01:11:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:53,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-16 01:11:53,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:11:53,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 01:11:53,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:53,503 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2023-02-16 01:11:53,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:53,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:53,506 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:53,509 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:53,514 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:53,643 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:11:53,643 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 52 [2023-02-16 01:11:53,647 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:53,656 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 31 [2023-02-16 01:11:53,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2023-02-16 01:11:53,752 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:53,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-02-16 01:11:53,786 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:11:53,786 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 16 [2023-02-16 01:11:53,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 01:11:53,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:11:55,948 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_613)) (.cse11 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_615))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse8 (+ .cse6 4))) (let ((.cse0 (store |c_#memory_int| .cse10 v_ArrVal_614)) (.cse1 (select (select .cse9 .cse5) .cse8))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse7 .cse5) .cse8))) (let ((.cse4 (select .cse2 .cse3))) (or (<= 91 (select (select (store .cse0 .cse1 (store .cse2 .cse3 v_ArrVal_616)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse4 101) (not (<= .cse4 (+ (select (select .cse0 .cse5) .cse6) v_ArrVal_616)))))))))))) is different from false [2023-02-16 01:11:55,976 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_613)) (.cse11 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_615))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse8 (+ .cse6 4))) (let ((.cse1 (store |c_#memory_int| .cse10 v_ArrVal_614)) (.cse2 (select (select .cse9 .cse5) .cse8))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse7 .cse5) .cse8))) (let ((.cse0 (select .cse3 .cse4))) (or (< .cse0 101) (<= 91 (select (select (store .cse1 .cse2 (store .cse3 .cse4 v_ArrVal_616)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= .cse0 (+ (select (select .cse1 .cse5) .cse6) v_ArrVal_616)))))))))))) is different from false [2023-02-16 01:11:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 01:11:56,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127419829] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:11:56,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:11:56,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 9] total 19 [2023-02-16 01:11:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337829012] [2023-02-16 01:11:56,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:11:56,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 01:11:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 01:11:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=229, Unknown=2, NotChecked=62, Total=342 [2023-02-16 01:11:56,035 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:11:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:11:56,673 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2023-02-16 01:11:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 01:11:56,673 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 01:11:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:11:56,674 INFO L225 Difference]: With dead ends: 86 [2023-02-16 01:11:56,674 INFO L226 Difference]: Without dead ends: 58 [2023-02-16 01:11:56,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=124, Invalid=344, Unknown=2, NotChecked=82, Total=552 [2023-02-16 01:11:56,675 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 94 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 01:11:56,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 116 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 109 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2023-02-16 01:11:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-16 01:11:56,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2023-02-16 01:11:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:11:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2023-02-16 01:11:56,682 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 16 [2023-02-16 01:11:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:11:56,682 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2023-02-16 01:11:56,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:11:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2023-02-16 01:11:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 01:11:56,688 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:11:56,688 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:11:56,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-16 01:11:56,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:56,893 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:11:56,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:11:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2098222328, now seen corresponding path program 1 times [2023-02-16 01:11:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:11:56,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039608914] [2023-02-16 01:11:56,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:11:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:57,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:11:57,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039608914] [2023-02-16 01:11:57,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039608914] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:11:57,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965684166] [2023-02-16 01:11:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:57,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:57,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:11:57,613 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:11:57,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 01:11:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:57,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 86 conjunts are in the unsatisfiable core [2023-02-16 01:11:57,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:11:57,735 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:57,764 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-02-16 01:11:57,764 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2023-02-16 01:11:57,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:57,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:57,770 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2023-02-16 01:11:57,796 INFO L321 Elim1Store]: treesize reduction 50, result has 26.5 percent of original size [2023-02-16 01:11:57,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 86 [2023-02-16 01:11:57,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:57,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:57,819 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:57,850 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 01:11:57,858 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:57,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:57,877 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 46 [2023-02-16 01:11:57,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:57,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:57,882 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:57,891 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:57,905 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:11:57,906 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-02-16 01:11:58,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 30 [2023-02-16 01:11:58,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:58,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:58,023 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 30 [2023-02-16 01:11:58,031 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:58,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:58,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:58,040 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:58,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:58,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:58,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:58,058 INFO L321 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2023-02-16 01:11:58,059 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:58,064 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:58,078 INFO L321 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2023-02-16 01:11:58,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 30 [2023-02-16 01:11:58,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:58,090 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:11:58,290 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:11:58,290 INFO L350 Elim1Store]: Elim1 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 137 treesize of output 124 [2023-02-16 01:11:58,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:58,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 111 [2023-02-16 01:11:58,308 INFO L321 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2023-02-16 01:11:58,308 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 85 treesize of output 38 [2023-02-16 01:11:58,477 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 01:11:58,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 51 [2023-02-16 01:11:58,526 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:11:58,527 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 42 [2023-02-16 01:11:58,551 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-02-16 01:11:58,551 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 52 [2023-02-16 01:11:58,555 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 01:11:58,586 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2023-02-16 01:11:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:58,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:11:58,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:58,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 946 treesize of output 904 [2023-02-16 01:11:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:59,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965684166] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:11:59,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:11:59,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 28 [2023-02-16 01:11:59,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781578001] [2023-02-16 01:11:59,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:11:59,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-16 01:11:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:59,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-16 01:11:59,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=646, Unknown=2, NotChecked=0, Total=756 [2023-02-16 01:11:59,276 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:12:04,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:12:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:12:07,865 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2023-02-16 01:12:07,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 01:12:07,865 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-16 01:12:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:12:07,866 INFO L225 Difference]: With dead ends: 71 [2023-02-16 01:12:07,866 INFO L226 Difference]: Without dead ends: 64 [2023-02-16 01:12:07,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=386, Invalid=1680, Unknown=4, NotChecked=0, Total=2070 [2023-02-16 01:12:07,867 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 34 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-02-16 01:12:07,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 138 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 4.3s Time] [2023-02-16 01:12:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-16 01:12:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2023-02-16 01:12:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:12:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-02-16 01:12:07,875 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 19 [2023-02-16 01:12:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:12:07,876 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-02-16 01:12:07,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:12:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-02-16 01:12:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 01:12:07,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:12:07,876 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:12:07,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:08,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:12:08,088 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:12:08,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:12:08,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2096375286, now seen corresponding path program 1 times [2023-02-16 01:12:08,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:12:08,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777897197] [2023-02-16 01:12:08,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:08,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:12:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:12:09,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:12:09,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777897197] [2023-02-16 01:12:09,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777897197] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:12:09,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818863856] [2023-02-16 01:12:09,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:09,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:12:09,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:12:09,071 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:12:09,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 01:12:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:09,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 93 conjunts are in the unsatisfiable core [2023-02-16 01:12:09,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:09,202 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:12:09,203 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-02-16 01:12:09,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,216 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:09,221 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:09,225 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:09,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,231 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:09,235 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:09,239 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:09,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2023-02-16 01:12:09,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 30 [2023-02-16 01:12:09,350 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 30 [2023-02-16 01:12:09,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,356 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:09,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,361 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:09,366 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:09,383 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:12:09,383 INFO L350 Elim1Store]: Elim1 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 30 [2023-02-16 01:12:09,401 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:09,631 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 01:12:09,631 INFO L350 Elim1Store]: Elim1 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 173 treesize of output 154 [2023-02-16 01:12:09,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 54 [2023-02-16 01:12:09,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2023-02-16 01:12:09,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:09,900 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:12:09,906 INFO L321 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2023-02-16 01:12:09,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 202 treesize of output 110 [2023-02-16 01:12:09,917 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2023-02-16 01:12:09,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 58 [2023-02-16 01:12:09,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 52 treesize of output 38 [2023-02-16 01:12:09,981 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2023-02-16 01:12:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:12:09,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:12:15,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:15,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 2139 treesize of output 1731 [2023-02-16 01:12:15,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:15,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 1719 treesize of output 1575 [2023-02-16 01:12:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:12:16,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818863856] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:12:16,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:12:16,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 24 [2023-02-16 01:12:16,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786401781] [2023-02-16 01:12:16,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:12:16,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 01:12:16,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:12:16,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 01:12:16,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=436, Unknown=14, NotChecked=0, Total=552 [2023-02-16 01:12:16,006 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:12:21,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:12:21,704 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse22))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse22))) (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse4 (select .cse1 .cse2)) (.cse5 (= |c_ULTIMATE.start_main_~m~0#1.base| .cse0)) (.cse7 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109))) (and (forall ((v_ArrVal_978 Int)) (or (<= (select (select (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_978)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (not (<= (+ .cse3 v_ArrVal_978) .cse4)))) (or (not .cse5) (let ((.cse6 (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse2))) (and (or (<= .cse4 (+ .cse3 100)) (not .cse6) (<= .cse4 100)) (or .cse7 .cse6)))) |c_ULTIMATE.start_main_#t~short19#1| (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_978 Int) (v_ArrVal_977 Int)) (let ((.cse20 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse20))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| .cse19 v_ArrVal_975)) (.cse21 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse10 (select (select .cse16 |c_ULTIMATE.start_main_~head~0#1.base|) .cse21)) (.cse18 (store |c_#memory_$Pointer$.base| .cse19 v_ArrVal_974))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~head~0#1.base|) .cse21)) (.cse17 (+ .cse10 4)) (.cse13 (select |c_#memory_int| .cse19)) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse20))) (let ((.cse8 (store |c_#memory_int| .cse19 (store .cse13 .cse14 v_ArrVal_977))) (.cse15 (select (select .cse18 .cse9) .cse17))) (let ((.cse11 (select .cse8 .cse15)) (.cse12 (select (select .cse16 .cse9) .cse17))) (or (not (<= (+ (select (select .cse8 .cse9) .cse10) v_ArrVal_978) (select .cse11 .cse12))) (not (<= v_ArrVal_977 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse13 .cse14)))) (<= (select (select (store .cse8 .cse15 (store .cse11 .cse12 v_ArrVal_978)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)))))))))) .cse7 (or .cse5 .cse7)))))) is different from false [2023-02-16 01:12:34,004 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:12:34,062 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse45 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse46 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse35 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse44 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse3 (select .cse46 .cse35)) (.cse0 (select .cse46 .cse45))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse16 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse38 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 100)) (.cse39 (= |c_ULTIMATE.start_main_~m~0#1.base| .cse0)) (.cse40 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse43 (select .cse44 .cse35)) (.cse42 (select |c_#memory_int| .cse3)) (.cse18 (select |c_#memory_$Pointer$.base| .cse3)) (.cse1 (select .cse44 .cse45))) (and (<= (select (select |c_#memory_int| .cse0) .cse1) (+ .cse2 100)) (not (= .cse3 |c_ULTIMATE.start_main_~list~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_main_~list~0#1.base|)) (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_978 Int) (v_ArrVal_977 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| .cse15 v_ArrVal_975))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~head~0#1.base|) .cse17)) (.cse14 (store |c_#memory_$Pointer$.base| .cse15 v_ArrVal_974))) (let ((.cse5 (select (select .cse14 |c_ULTIMATE.start_main_~head~0#1.base|) .cse17)) (.cse13 (+ .cse6 4)) (.cse9 (select |c_#memory_int| .cse15)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (let ((.cse4 (store |c_#memory_int| .cse15 (store .cse9 .cse10 v_ArrVal_977))) (.cse11 (select (select .cse14 .cse5) .cse13))) (let ((.cse7 (select .cse4 .cse11)) (.cse8 (select (select .cse12 .cse5) .cse13))) (or (not (<= (+ (select (select .cse4 .cse5) .cse6) v_ArrVal_978) (select .cse7 .cse8))) (not (<= v_ArrVal_977 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse9 .cse10)))) (<= (select (select (store .cse4 .cse11 (store .cse7 .cse8 v_ArrVal_978)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109))))))))) (= (select .cse18 4) |c_ULTIMATE.start_main_~m~0#1.base|) (= 0 |c_ULTIMATE.start_main_~list~0#1.offset|) (<= .cse2 1) (forall ((v_ArrVal_962 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_950 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_949 Int) (v_arrayElimArr_19 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_978 Int) (v_ArrVal_955 Int) (v_ArrVal_977 Int) (v_ArrVal_963 Int)) (let ((.cse33 (let ((.cse37 (store |c_#memory_$Pointer$.base| v_ArrVal_955 v_arrayElimArr_18))) (store .cse37 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse37 |c_ULTIMATE.start_main_~list~0#1.base|) .cse35 v_ArrVal_955))))) (let ((.cse32 (let ((.cse36 (store |c_#memory_$Pointer$.offset| v_ArrVal_955 v_arrayElimArr_19))) (store .cse36 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse36 |c_ULTIMATE.start_main_~list~0#1.base|) .cse35 0)))) (.cse31 (select (select .cse33 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (let ((.cse28 (store .cse32 .cse31 v_ArrVal_975))) (let ((.cse19 (let ((.cse34 (store |c_#memory_int| v_ArrVal_955 (store (store (store (select |c_#memory_int| v_ArrVal_955) 0 v_ArrVal_950) 4 v_ArrVal_949) 8 v_ArrVal_962)))) (store .cse34 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~list~0#1.base|) .cse35 v_ArrVal_963)))) (.cse24 (select (select .cse28 |c_ULTIMATE.start_main_~head~0#1.base|) .cse17)) (.cse30 (store .cse33 .cse31 v_ArrVal_974))) (let ((.cse23 (select (select .cse30 |c_ULTIMATE.start_main_~head~0#1.base|) .cse17)) (.cse29 (+ .cse24 4)) (.cse20 (select .cse19 .cse31)) (.cse21 (select (select .cse32 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (let ((.cse22 (store .cse19 .cse31 (store .cse20 .cse21 v_ArrVal_977))) (.cse27 (select (select .cse30 .cse23) .cse29))) (let ((.cse25 (select .cse22 .cse27)) (.cse26 (select (select .cse28 .cse23) .cse29))) (or (not (= (select v_arrayElimArr_19 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= v_ArrVal_977 (+ (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse20 .cse21)))) (not (= 0 (select |c_#valid| v_ArrVal_955))) (not (= (select v_arrayElimArr_19 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= (select v_arrayElimArr_18 4) |c_ULTIMATE.start_main_~m~0#1.base|)) (< v_ArrVal_950 1) (not (<= (+ (select (select .cse22 .cse23) .cse24) v_ArrVal_978) (select .cse25 .cse26))) (<= (select (select (store .cse22 .cse27 (store .cse25 .cse26 v_ArrVal_978)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (not (= (select v_arrayElimArr_18 8) |c_ULTIMATE.start_main_~head~0#1.base|))))))))))) (or .cse38 .cse39) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~m~0#1.base|)) (= |c_ULTIMATE.start_main_~m~0#1.offset| 0) (= (select .cse40 4) |c_ULTIMATE.start_main_~m~0#1.offset|) (= .cse2 1) (not (= |c_ULTIMATE.start_main_~m~0#1.base| .cse3)) (= .cse0 |c_ULTIMATE.start_main_~m~0#1.base|) (or (let ((.cse41 (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse1))) (and (or .cse38 .cse41) (or (not .cse41) (and (not (= .cse0 .cse3)) (<= 1 (select .cse42 .cse43)))))) (not .cse39)) (= (select .cse40 8) |c_ULTIMATE.start_main_~list~0#1.offset|) (= .cse43 0) (<= 1 (select .cse42 0)) (= (select .cse18 8) |c_ULTIMATE.start_main_~list~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~m~0#1.offset|))))) is different from false [2023-02-16 01:12:46,224 WARN L233 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:12:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:12:53,875 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2023-02-16 01:12:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 01:12:53,876 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-16 01:12:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:12:53,877 INFO L225 Difference]: With dead ends: 100 [2023-02-16 01:12:53,877 INFO L226 Difference]: Without dead ends: 98 [2023-02-16 01:12:53,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=355, Invalid=1096, Unknown=39, NotChecked=150, Total=1640 [2023-02-16 01:12:53,882 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 136 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 51 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:12:53,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 136 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 257 Invalid, 20 Unknown, 2 Unchecked, 3.0s Time] [2023-02-16 01:12:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-16 01:12:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2023-02-16 01:12:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 74 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:12:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2023-02-16 01:12:53,900 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 19 [2023-02-16 01:12:53,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:12:53,900 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2023-02-16 01:12:53,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:12:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2023-02-16 01:12:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 01:12:53,901 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:12:53,901 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:12:53,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:54,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:12:54,107 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:12:54,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:12:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2096373364, now seen corresponding path program 1 times [2023-02-16 01:12:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:12:54,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447049197] [2023-02-16 01:12:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:12:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:12:55,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:12:55,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447049197] [2023-02-16 01:12:55,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447049197] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:12:55,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130268624] [2023-02-16 01:12:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:55,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:12:55,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:12:55,033 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:12:55,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 01:12:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:55,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 72 conjunts are in the unsatisfiable core [2023-02-16 01:12:55,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:55,170 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:12:55,171 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-02-16 01:12:55,182 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:55,257 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 30 [2023-02-16 01:12:55,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:55,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:55,265 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2023-02-16 01:12:55,273 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 28 [2023-02-16 01:12:55,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:55,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:55,280 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:55,286 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:55,307 INFO L321 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2023-02-16 01:12:55,308 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 55 [2023-02-16 01:12:55,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 46 [2023-02-16 01:12:55,323 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:12:55,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:55,338 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-02-16 01:12:55,347 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 01:12:55,365 INFO L321 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2023-02-16 01:12:55,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 32 [2023-02-16 01:12:55,386 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:12:55,387 INFO L350 Elim1Store]: Elim1 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 30 [2023-02-16 01:12:55,550 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 01:12:55,550 INFO L350 Elim1Store]: Elim1 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 105 treesize of output 100 [2023-02-16 01:12:55,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-02-16 01:12:55,561 INFO L350 Elim1Store]: Elim1 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 28 [2023-02-16 01:12:55,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:55,729 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:12:55,734 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-16 01:12:55,734 INFO L350 Elim1Store]: Elim1 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 194 treesize of output 100 [2023-02-16 01:12:55,742 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 01:12:55,742 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 80 treesize of output 46 [2023-02-16 01:12:55,745 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 26 [2023-02-16 01:12:55,780 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:12:55,781 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 16 [2023-02-16 01:12:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:12:55,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:12:57,960 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1147 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_1143)) (.cse11 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_1144))) (let ((.cse2 (select (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse8 (+ .cse3 4))) (let ((.cse1 (store |c_#memory_int| .cse10 v_ArrVal_1145)) (.cse4 (select (select .cse9 .cse2) .cse8))) (let ((.cse5 (select .cse1 .cse4)) (.cse6 (select (select .cse7 .cse2) .cse8))) (let ((.cse0 (select .cse5 .cse6))) (or (not (<= .cse0 (+ v_ArrVal_1147 (select (select .cse1 .cse2) .cse3)))) (< .cse0 101) (<= 91 (select (select (store .cse1 .cse4 (store .cse5 .cse6 v_ArrVal_1147)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))))))) is different from false [2023-02-16 01:12:57,984 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1147 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_1143)) (.cse11 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_1144))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse8 (+ .cse6 4))) (let ((.cse0 (store |c_#memory_int| .cse10 v_ArrVal_1145)) (.cse1 (select (select .cse9 .cse5) .cse8))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse7 .cse5) .cse8))) (let ((.cse4 (select .cse2 .cse3))) (or (<= 91 (select (select (store .cse0 .cse1 (store .cse2 .cse3 v_ArrVal_1147)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse4 101) (not (<= .cse4 (+ (select (select .cse0 .cse5) .cse6) v_ArrVal_1147)))))))))))) is different from false [2023-02-16 01:12:58,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:58,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 1656 treesize of output 1428 [2023-02-16 01:12:58,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:58,053 INFO L350 Elim1Store]: Elim1 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 1416 treesize of output 1370 [2023-02-16 01:12:58,124 INFO L321 Elim1Store]: treesize reduction 16, result has 66.7 percent of original size [2023-02-16 01:12:58,124 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2631 treesize of output 2398 [2023-02-16 01:12:58,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:58,138 INFO L350 Elim1Store]: Elim1 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 1602 treesize of output 1555 [2023-02-16 01:12:58,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:58,741 INFO L350 Elim1Store]: Elim1 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 97584 treesize of output 93857 [2023-02-16 01:12:59,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:59,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 2470640 treesize of output 2141326 [2023-02-16 01:13:00,256 INFO L217 Elim1Store]: Index analysis took 185 ms [2023-02-16 01:13:04,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:13:04,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 2182041 treesize of output 2143543 [2023-02-16 01:13:06,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:13:06,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1729731 treesize of output 1692069 [2023-02-16 01:13:10,148 INFO L217 Elim1Store]: Index analysis took 3079 ms [2023-02-16 01:13:29,364 WARN L233 SmtUtils]: Spent 19.20s on a formula simplification that was a NOOP. DAG size: 753 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-16 01:13:29,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:13:29,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 2107497 treesize of output 2093155 [2023-02-16 01:13:31,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:13:31,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 2095235 treesize of output 2022613 [2023-02-16 01:13:41,714 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 01:13:41,717 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 01:13:41,719 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 01:13:42,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:13:42,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 17 [2023-02-16 01:13:43,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:13:43,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 10 treesize of output 13 [2023-02-16 01:13:43,434 INFO L321 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2023-02-16 01:13:43,434 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-02-16 01:13:43,514 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 01:13:43,854 INFO L321 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2023-02-16 01:13:43,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 1 [2023-02-16 01:13:44,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:13:44,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 17 [2023-02-16 01:13:44,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:13:44,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 10 treesize of output 13