./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s52if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s52if.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adec1fb94d6967416fde705f346e339b2564f221f40b7d50198f8ed5e502aa54 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 10:15:39,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 10:15:39,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 10:15:39,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 10:15:39,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 10:15:39,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 10:15:39,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 10:15:39,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 10:15:39,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 10:15:39,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 10:15:39,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 10:15:39,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 10:15:39,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 10:15:39,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 10:15:39,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 10:15:39,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 10:15:39,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 10:15:39,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 10:15:39,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 10:15:39,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 10:15:39,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 10:15:39,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 10:15:39,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 10:15:39,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 10:15:39,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 10:15:39,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 10:15:39,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 10:15:39,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 10:15:39,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 10:15:39,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 10:15:39,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 10:15:39,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 10:15:39,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 10:15:39,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 10:15:39,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 10:15:39,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 10:15:39,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 10:15:39,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 10:15:39,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 10:15:39,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 10:15:39,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 10:15:39,805 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 10:15:39,831 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 10:15:39,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 10:15:39,831 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 10:15:39,832 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 10:15:39,832 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 10:15:39,832 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 10:15:39,833 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 10:15:39,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 10:15:39,833 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 10:15:39,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 10:15:39,834 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 10:15:39,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 10:15:39,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 10:15:39,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 10:15:39,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 10:15:39,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 10:15:39,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 10:15:39,835 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 10:15:39,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 10:15:39,836 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 10:15:39,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 10:15:39,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 10:15:39,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 10:15:39,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 10:15:39,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:15:39,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 10:15:39,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 10:15:39,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 10:15:39,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 10:15:39,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 10:15:39,838 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 10:15:39,838 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 10:15:39,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 10:15:39,838 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 10:15:39,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adec1fb94d6967416fde705f346e339b2564f221f40b7d50198f8ed5e502aa54 [2021-12-21 10:15:40,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 10:15:40,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 10:15:40,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 10:15:40,077 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 10:15:40,078 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 10:15:40,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s52if.c [2021-12-21 10:15:40,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b257241/10000d1d5e9c472a8e433a2b85cee7b6/FLAG8f38c303a [2021-12-21 10:15:40,541 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 10:15:40,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s52if.c [2021-12-21 10:15:40,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b257241/10000d1d5e9c472a8e433a2b85cee7b6/FLAG8f38c303a [2021-12-21 10:15:40,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b257241/10000d1d5e9c472a8e433a2b85cee7b6 [2021-12-21 10:15:40,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 10:15:40,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 10:15:40,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 10:15:40,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 10:15:40,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 10:15:40,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:15:40" (1/1) ... [2021-12-21 10:15:40,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e09e242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:40, skipping insertion in model container [2021-12-21 10:15:40,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:15:40" (1/1) ... [2021-12-21 10:15:40,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 10:15:40,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 10:15:41,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s52if.c[588,601] [2021-12-21 10:15:41,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:15:41,111 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 10:15:41,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s52if.c[588,601] [2021-12-21 10:15:41,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:15:41,135 INFO L208 MainTranslator]: Completed translation [2021-12-21 10:15:41,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:41 WrapperNode [2021-12-21 10:15:41,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 10:15:41,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 10:15:41,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 10:15:41,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 10:15:41,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:41" (1/1) ... [2021-12-21 10:15:41,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:41" (1/1) ... [2021-12-21 10:15:41,166 INFO L137 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2021-12-21 10:15:41,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 10:15:41,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 10:15:41,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 10:15:41,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 10:15:41,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:41" (1/1) ... [2021-12-21 10:15:41,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:41" (1/1) ... [2021-12-21 10:15:41,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:41" (1/1) ... [2021-12-21 10:15:41,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:41" (1/1) ... [2021-12-21 10:15:41,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:41" (1/1) ... [2021-12-21 10:15:41,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:41" (1/1) ... [2021-12-21 10:15:41,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:41" (1/1) ... [2021-12-21 10:15:41,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 10:15:41,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 10:15:41,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 10:15:41,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 10:15:41,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:41" (1/1) ... [2021-12-21 10:15:41,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:15:41,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:41,232 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 10:15:41,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 10:15:41,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 10:15:41,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 10:15:41,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 10:15:41,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 10:15:41,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 10:15:41,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 10:15:41,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 10:15:41,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 10:15:41,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 10:15:41,309 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 10:15:41,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 10:15:41,420 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 10:15:41,424 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 10:15:41,425 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-21 10:15:41,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:15:41 BoogieIcfgContainer [2021-12-21 10:15:41,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 10:15:41,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 10:15:41,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 10:15:41,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 10:15:41,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:15:40" (1/3) ... [2021-12-21 10:15:41,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c754338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:15:41, skipping insertion in model container [2021-12-21 10:15:41,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:41" (2/3) ... [2021-12-21 10:15:41,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c754338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:15:41, skipping insertion in model container [2021-12-21 10:15:41,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:15:41" (3/3) ... [2021-12-21 10:15:41,432 INFO L111 eAbstractionObserver]: Analyzing ICFG s52if.c [2021-12-21 10:15:41,435 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 10:15:41,435 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 10:15:41,469 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 10:15:41,474 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 10:15:41,474 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 10:15:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 10:15:41,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:41,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:41,493 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2021-12-21 10:15:41,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:41,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392786217] [2021-12-21 10:15:41,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:41,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:15:41,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:41,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392786217] [2021-12-21 10:15:41,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392786217] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:15:41,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:15:41,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 10:15:41,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880674105] [2021-12-21 10:15:41,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:15:41,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 10:15:41,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:41,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 10:15:41,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 10:15:41,630 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:41,642 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2021-12-21 10:15:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 10:15:41,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-21 10:15:41,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:41,651 INFO L225 Difference]: With dead ends: 42 [2021-12-21 10:15:41,651 INFO L226 Difference]: Without dead ends: 19 [2021-12-21 10:15:41,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 10:15:41,658 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:41,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:15:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-21 10:15:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-21 10:15:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-12-21 10:15:41,684 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2021-12-21 10:15:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:41,684 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-21 10:15:41,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-12-21 10:15:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 10:15:41,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:41,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:41,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 10:15:41,686 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:41,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2021-12-21 10:15:41,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:41,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981244566] [2021-12-21 10:15:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:41,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:15:41,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:41,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981244566] [2021-12-21 10:15:41,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981244566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:15:41,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:15:41,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:15:41,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630641388] [2021-12-21 10:15:41,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:15:41,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:15:41,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:41,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:15:41,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:15:41,819 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:41,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:41,879 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2021-12-21 10:15:41,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:15:41,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-21 10:15:41,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:41,880 INFO L225 Difference]: With dead ends: 39 [2021-12-21 10:15:41,881 INFO L226 Difference]: Without dead ends: 27 [2021-12-21 10:15:41,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:15:41,882 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:41,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 11 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-21 10:15:41,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-12-21 10:15:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-12-21 10:15:41,890 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2021-12-21 10:15:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:41,891 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-12-21 10:15:41,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-12-21 10:15:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 10:15:41,894 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:41,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:41,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 10:15:41,895 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:41,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2021-12-21 10:15:41,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:41,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551521818] [2021-12-21 10:15:41,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:41,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:42,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:42,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551521818] [2021-12-21 10:15:42,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551521818] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:42,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577379997] [2021-12-21 10:15:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:42,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:42,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:42,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:42,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 10:15:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:42,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-21 10:15:42,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:42,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-21 10:15:42,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:15:42,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:42,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:42,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-21 10:15:42,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2021-12-21 10:15:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:42,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:42,746 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_46 (Array Int Int))) (let ((.cse2 (select v_ArrVal_46 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (let ((.cse1 (* c_~N~0 6)) (.cse0 (+ .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse2 6))))) is different from false [2021-12-21 10:15:42,936 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:42,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2021-12-21 10:15:42,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:15:42,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-12-21 10:15:42,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2021-12-21 10:15:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-21 10:15:42,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577379997] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:42,960 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:42,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2021-12-21 10:15:42,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165007452] [2021-12-21 10:15:42,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:42,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 10:15:42,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:42,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 10:15:42,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=244, Unknown=2, NotChecked=32, Total=342 [2021-12-21 10:15:42,964 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:43,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:43,185 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2021-12-21 10:15:43,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 10:15:43,186 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-21 10:15:43,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:43,187 INFO L225 Difference]: With dead ends: 42 [2021-12-21 10:15:43,187 INFO L226 Difference]: Without dead ends: 38 [2021-12-21 10:15:43,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=418, Unknown=2, NotChecked=44, Total=600 [2021-12-21 10:15:43,188 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:43,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 69 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 123 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2021-12-21 10:15:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-21 10:15:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2021-12-21 10:15:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-12-21 10:15:43,193 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2021-12-21 10:15:43,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:43,193 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-21 10:15:43,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2021-12-21 10:15:43,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 10:15:43,194 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:43,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:43,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:43,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:43,407 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:43,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:43,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2021-12-21 10:15:43,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:43,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569949575] [2021-12-21 10:15:43,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:43,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:43,422 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:43,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [671362724] [2021-12-21 10:15:43,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:43,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:43,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:43,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:43,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 10:15:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:43,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 10:15:43,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:43,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 10:15:43,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 10:15:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:43,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:43,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2021-12-21 10:15:43,605 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-21 10:15:43,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2021-12-21 10:15:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:43,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:43,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569949575] [2021-12-21 10:15:43,619 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:43,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671362724] [2021-12-21 10:15:43,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671362724] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:43,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:43,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-12-21 10:15:43,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001957003] [2021-12-21 10:15:43,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:43,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 10:15:43,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:43,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 10:15:43,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-21 10:15:43,621 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:43,731 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2021-12-21 10:15:43,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 10:15:43,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-21 10:15:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:43,732 INFO L225 Difference]: With dead ends: 58 [2021-12-21 10:15:43,732 INFO L226 Difference]: Without dead ends: 51 [2021-12-21 10:15:43,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-12-21 10:15:43,733 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:43,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 64 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-21 10:15:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2021-12-21 10:15:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2021-12-21 10:15:43,738 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2021-12-21 10:15:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:43,738 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-12-21 10:15:43,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2021-12-21 10:15:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 10:15:43,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:43,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:43,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:43,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-21 10:15:43,956 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:43,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1649883961, now seen corresponding path program 1 times [2021-12-21 10:15:43,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:43,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030316000] [2021-12-21 10:15:43,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:43,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:44,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:44,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030316000] [2021-12-21 10:15:44,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030316000] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:44,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718657926] [2021-12-21 10:15:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:44,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:44,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:44,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:44,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 10:15:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:44,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 10:15:44,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:44,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:15:44,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 10:15:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:44,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:44,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-21 10:15:44,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-21 10:15:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:44,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718657926] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:44,301 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:44,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2021-12-21 10:15:44,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120833561] [2021-12-21 10:15:44,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:44,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:15:44,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:44,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:15:44,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:15:44,319 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:44,794 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2021-12-21 10:15:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-21 10:15:44,794 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-21 10:15:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:44,797 INFO L225 Difference]: With dead ends: 86 [2021-12-21 10:15:44,797 INFO L226 Difference]: Without dead ends: 72 [2021-12-21 10:15:44,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2021-12-21 10:15:44,801 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 74 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:44,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 69 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-21 10:15:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2021-12-21 10:15:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2021-12-21 10:15:44,813 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2021-12-21 10:15:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:44,813 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2021-12-21 10:15:44,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2021-12-21 10:15:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 10:15:44,814 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:44,814 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:44,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:45,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:45,030 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:45,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2021-12-21 10:15:45,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:45,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061027172] [2021-12-21 10:15:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:45,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:45,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:45,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061027172] [2021-12-21 10:15:45,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061027172] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:45,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498416320] [2021-12-21 10:15:45,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:15:45,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:45,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:45,078 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:45,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 10:15:45,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:15:45,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:45,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 10:15:45,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:45,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:45,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498416320] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:45,221 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:45,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 10:15:45,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607280731] [2021-12-21 10:15:45,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:45,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 10:15:45,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:45,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 10:15:45,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-21 10:15:45,223 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:45,338 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2021-12-21 10:15:45,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 10:15:45,342 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-21 10:15:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:45,342 INFO L225 Difference]: With dead ends: 85 [2021-12-21 10:15:45,342 INFO L226 Difference]: Without dead ends: 75 [2021-12-21 10:15:45,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-21 10:15:45,343 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:45,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 22 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-21 10:15:45,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2021-12-21 10:15:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2021-12-21 10:15:45,349 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2021-12-21 10:15:45,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:45,349 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2021-12-21 10:15:45,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2021-12-21 10:15:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 10:15:45,350 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:45,350 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:45,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:45,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:45,569 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:45,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2021-12-21 10:15:45,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:45,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629813717] [2021-12-21 10:15:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:45,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:45,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:45,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629813717] [2021-12-21 10:15:45,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629813717] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:45,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734435051] [2021-12-21 10:15:45,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:15:45,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:45,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:45,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) [2021-12-21 10:15:45,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 10:15:45,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-21 10:15:45,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:45,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 10:15:45,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:45,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:15:45,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734435051] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:45,769 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:45,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 10:15:45,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228789787] [2021-12-21 10:15:45,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:45,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 10:15:45,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:45,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 10:15:45,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-21 10:15:45,771 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:45,858 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2021-12-21 10:15:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 10:15:45,859 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-21 10:15:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:45,859 INFO L225 Difference]: With dead ends: 78 [2021-12-21 10:15:45,860 INFO L226 Difference]: Without dead ends: 42 [2021-12-21 10:15:45,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-21 10:15:45,860 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:45,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 30 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-21 10:15:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2021-12-21 10:15:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2021-12-21 10:15:45,866 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2021-12-21 10:15:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:45,866 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-12-21 10:15:45,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2021-12-21 10:15:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 10:15:45,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:45,867 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:45,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:46,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:46,077 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:46,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:46,078 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2021-12-21 10:15:46,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:46,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358185514] [2021-12-21 10:15:46,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:46,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 10:15:46,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:46,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358185514] [2021-12-21 10:15:46,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358185514] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:46,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066659247] [2021-12-21 10:15:46,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 10:15:46,382 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:46,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:46,396 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:46,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 10:15:46,440 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 10:15:46,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:46,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-21 10:15:46,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:46,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:15:46,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:46,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:46,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:46,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:46,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:46,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:46,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:46,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:46,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:46,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-21 10:15:46,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:46,844 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:15:46,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-21 10:15:47,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:47,007 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:15:47,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2021-12-21 10:15:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:47,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:47,841 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (not (= .cse0 6)) (not (= 6 .cse1)) (let ((.cse3 (* c_~N~0 6)) (.cse2 (+ .cse4 .cse0 .cse1))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))))))))) is different from false [2021-12-21 10:15:48,581 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 (div (+ .cse1 .cse2 .cse3) 6)) (<= (div (+ (* (- 1) .cse1) (* (- 1) .cse3) (* (- 1) .cse2)) (- 6)) .cse0))) (not (= 6 .cse3)) (not (= .cse1 6)))))))) is different from false [2021-12-21 10:15:48,647 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= .cse0 (div (+ .cse1 .cse2 .cse3) 6)) (<= (div (+ (* (- 1) .cse1) (* (- 1) .cse3) (* (- 1) .cse2)) (- 6)) .cse0))) (not (= 6 .cse3)) (not (= .cse1 6)))))))) is different from false [2021-12-21 10:15:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2021-12-21 10:15:48,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066659247] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:48,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:48,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 33 [2021-12-21 10:15:48,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398973195] [2021-12-21 10:15:48,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:48,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-21 10:15:48,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:48,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-21 10:15:48,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=763, Unknown=4, NotChecked=174, Total=1056 [2021-12-21 10:15:48,758 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:49,368 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2021-12-21 10:15:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 10:15:49,368 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-21 10:15:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:49,369 INFO L225 Difference]: With dead ends: 73 [2021-12-21 10:15:49,369 INFO L226 Difference]: Without dead ends: 69 [2021-12-21 10:15:49,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=225, Invalid=1265, Unknown=4, NotChecked=228, Total=1722 [2021-12-21 10:15:49,370 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 350 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:49,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 104 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 193 Invalid, 0 Unknown, 350 Unchecked, 0.1s Time] [2021-12-21 10:15:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-21 10:15:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2021-12-21 10:15:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2021-12-21 10:15:49,377 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 29 [2021-12-21 10:15:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:49,377 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2021-12-21 10:15:49,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2021-12-21 10:15:49,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 10:15:49,378 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:49,378 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:49,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:49,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:49,596 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:49,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:49,597 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2021-12-21 10:15:49,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:49,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450352016] [2021-12-21 10:15:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:49,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:49,606 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:49,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242958592] [2021-12-21 10:15:49,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:49,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:49,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:49,621 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:49,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 10:15:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:49,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-21 10:15:49,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:49,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-21 10:15:49,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:49,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 10:15:49,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-21 10:15:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 10:15:49,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:49,843 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= (+ (- 5) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2021-12-21 10:15:49,849 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= (+ (- 5) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2021-12-21 10:15:49,880 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:49,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2021-12-21 10:15:49,885 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:49,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2021-12-21 10:15:49,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 10:15:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2021-12-21 10:15:49,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:49,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450352016] [2021-12-21 10:15:49,947 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:49,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242958592] [2021-12-21 10:15:49,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242958592] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:49,947 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:49,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-21 10:15:49,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270041781] [2021-12-21 10:15:49,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:49,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 10:15:49,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:49,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 10:15:49,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2021-12-21 10:15:49,949 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:50,187 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2021-12-21 10:15:50,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 10:15:50,188 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-21 10:15:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:50,188 INFO L225 Difference]: With dead ends: 113 [2021-12-21 10:15:50,188 INFO L226 Difference]: Without dead ends: 106 [2021-12-21 10:15:50,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=267, Unknown=2, NotChecked=70, Total=420 [2021-12-21 10:15:50,189 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:50,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 92 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 268 Invalid, 0 Unknown, 153 Unchecked, 0.2s Time] [2021-12-21 10:15:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-21 10:15:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2021-12-21 10:15:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2021-12-21 10:15:50,199 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 29 [2021-12-21 10:15:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:50,199 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2021-12-21 10:15:50,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2021-12-21 10:15:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 10:15:50,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:50,200 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:50,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:50,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:50,418 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2021-12-21 10:15:50,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:50,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158396551] [2021-12-21 10:15:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:50,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:50,434 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:50,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127592337] [2021-12-21 10:15:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:50,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:50,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:50,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:50,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 10:15:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:50,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 10:15:50,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:50,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 10:15:50,562 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-21 10:15:50,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-21 10:15:50,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-21 10:15:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:50,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:50,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-21 10:15:50,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-12-21 10:15:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:50,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:50,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158396551] [2021-12-21 10:15:50,682 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:50,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127592337] [2021-12-21 10:15:50,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127592337] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:50,683 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:50,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-12-21 10:15:50,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116969087] [2021-12-21 10:15:50,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:50,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 10:15:50,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:50,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 10:15:50,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-21 10:15:50,684 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:50,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:50,782 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2021-12-21 10:15:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 10:15:50,782 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-21 10:15:50,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:50,783 INFO L225 Difference]: With dead ends: 123 [2021-12-21 10:15:50,783 INFO L226 Difference]: Without dead ends: 92 [2021-12-21 10:15:50,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-21 10:15:50,783 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:50,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 53 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-21 10:15:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2021-12-21 10:15:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2021-12-21 10:15:50,790 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 29 [2021-12-21 10:15:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:50,791 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2021-12-21 10:15:50,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2021-12-21 10:15:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 10:15:50,791 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:50,792 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:50,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:51,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-21 10:15:51,004 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:51,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2021-12-21 10:15:51,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:51,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801327254] [2021-12-21 10:15:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:51,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:51,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:51,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801327254] [2021-12-21 10:15:51,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801327254] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:51,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573220540] [2021-12-21 10:15:51,056 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 10:15:51,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:51,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:51,058 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:51,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 10:15:51,118 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-21 10:15:51,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:51,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 10:15:51,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:51,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:51,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573220540] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:51,254 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:51,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-21 10:15:51,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365251674] [2021-12-21 10:15:51,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:51,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 10:15:51,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:51,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 10:15:51,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-21 10:15:51,256 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:51,440 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2021-12-21 10:15:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 10:15:51,440 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-21 10:15:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:51,441 INFO L225 Difference]: With dead ends: 115 [2021-12-21 10:15:51,441 INFO L226 Difference]: Without dead ends: 102 [2021-12-21 10:15:51,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-21 10:15:51,442 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:51,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 28 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-21 10:15:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2021-12-21 10:15:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2021-12-21 10:15:51,448 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 31 [2021-12-21 10:15:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:51,448 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2021-12-21 10:15:51,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2021-12-21 10:15:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 10:15:51,449 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:51,449 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:51,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:51,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:51,659 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:51,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:51,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2021-12-21 10:15:51,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:51,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448514854] [2021-12-21 10:15:51,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:51,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:51,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:51,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448514854] [2021-12-21 10:15:51,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448514854] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:51,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111005488] [2021-12-21 10:15:51,723 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-21 10:15:51,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:51,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:51,724 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:51,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 10:15:51,795 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-21 10:15:51,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:51,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 10:15:51,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:51,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:51,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111005488] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:51,954 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:51,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-21 10:15:51,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261891705] [2021-12-21 10:15:51,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:51,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 10:15:51,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:51,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 10:15:51,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-21 10:15:51,955 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:52,085 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2021-12-21 10:15:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 10:15:52,086 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-21 10:15:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:52,086 INFO L225 Difference]: With dead ends: 103 [2021-12-21 10:15:52,086 INFO L226 Difference]: Without dead ends: 50 [2021-12-21 10:15:52,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:15:52,087 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 67 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:52,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 33 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:52,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-21 10:15:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2021-12-21 10:15:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-12-21 10:15:52,091 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2021-12-21 10:15:52,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:52,091 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-12-21 10:15:52,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2021-12-21 10:15:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:15:52,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:52,092 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:52,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:52,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-21 10:15:52,299 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:52,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:52,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2021-12-21 10:15:52,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:52,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274518371] [2021-12-21 10:15:52,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:52,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 10:15:52,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:52,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274518371] [2021-12-21 10:15:52,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274518371] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:52,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078239131] [2021-12-21 10:15:52,750 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-21 10:15:52,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:52,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:52,751 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:52,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-21 10:15:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:52,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-21 10:15:52,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:52,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-21 10:15:52,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:15:52,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:52,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:52,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:52,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:52,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:53,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:53,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-21 10:15:53,191 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:15:53,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2021-12-21 10:15:53,301 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:15:53,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2021-12-21 10:15:53,451 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:15:53,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 42 [2021-12-21 10:15:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:15:53,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:59,653 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (not (= .cse0 6)) (let ((.cse2 (* c_~N~0 6)) (.cse1 (+ .cse3 .cse4 .cse0 .cse5))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= .cse3 6)) (not (= .cse4 6))))))))) is different from false [2021-12-21 10:16:03,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_138| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (not (= .cse0 6)) (not (= .cse1 6)) (let ((.cse3 (* 6 ~N~0)) (.cse2 (+ .cse0 .cse1 .cse4 .cse5))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 6 .cse4))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2021-12-21 10:16:04,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_138| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (not (= .cse0 6)) (not (= .cse1 6)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (let ((.cse3 (* 6 ~N~0)) (.cse2 (+ .cse0 .cse1 .cse4 .cse5))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 6 .cse4))))))))) is different from false [2021-12-21 10:16:05,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_138| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (not (= .cse0 6)) (not (= .cse1 6)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (let ((.cse3 (* 6 ~N~0)) (.cse2 (+ .cse0 .cse1 .cse4 .cse5))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= 6 .cse4))))))))) is different from false [2021-12-21 10:16:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 14 not checked. [2021-12-21 10:16:06,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078239131] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:16:06,872 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:16:06,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 38 [2021-12-21 10:16:06,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874507851] [2021-12-21 10:16:06,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:16:06,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-21 10:16:06,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:16:06,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-21 10:16:06,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1006, Unknown=8, NotChecked=268, Total=1406 [2021-12-21 10:16:06,874 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:16:08,089 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2021-12-21 10:16:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-21 10:16:08,089 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:16:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:16:08,089 INFO L225 Difference]: With dead ends: 101 [2021-12-21 10:16:08,089 INFO L226 Difference]: Without dead ends: 97 [2021-12-21 10:16:08,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 57 SyntacticMatches, 13 SemanticMatches, 55 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=379, Invalid=2385, Unknown=8, NotChecked=420, Total=3192 [2021-12-21 10:16:08,090 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 710 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 10:16:08,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 146 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 511 Invalid, 0 Unknown, 710 Unchecked, 0.3s Time] [2021-12-21 10:16:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-21 10:16:08,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2021-12-21 10:16:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 86 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2021-12-21 10:16:08,097 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 37 [2021-12-21 10:16:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:16:08,097 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2021-12-21 10:16:08,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2021-12-21 10:16:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:16:08,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:16:08,098 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:16:08,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-21 10:16:08,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-21 10:16:08,298 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:16:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:16:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2021-12-21 10:16:08,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:16:08,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737434228] [2021-12-21 10:16:08,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:16:08,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:16:08,315 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:16:08,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392152526] [2021-12-21 10:16:08,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:16:08,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:16:08,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:16:08,317 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:16:08,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-21 10:16:08,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:16:08,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:16:08,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-21 10:16:08,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:16:08,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-21 10:16:08,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:08,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 10:16:08,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:08,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 10:16:08,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-21 10:16:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 10:16:08,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:16:08,614 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (- 5)) 1)) is different from false [2021-12-21 10:16:08,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (- 5)) 1)) is different from false [2021-12-21 10:16:08,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (- 5)) 1)) is different from false [2021-12-21 10:16:08,664 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:16:08,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2021-12-21 10:16:08,671 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:16:08,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2021-12-21 10:16:08,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 10:16:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2021-12-21 10:16:08,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:16:08,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737434228] [2021-12-21 10:16:08,791 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:16:08,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392152526] [2021-12-21 10:16:08,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392152526] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:16:08,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:16:08,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-12-21 10:16:08,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214737823] [2021-12-21 10:16:08,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:16:08,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-21 10:16:08,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:16:08,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-21 10:16:08,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=310, Unknown=3, NotChecked=114, Total=506 [2021-12-21 10:16:08,792 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:16:09,111 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2021-12-21 10:16:09,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 10:16:09,111 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:16:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:16:09,112 INFO L225 Difference]: With dead ends: 188 [2021-12-21 10:16:09,112 INFO L226 Difference]: Without dead ends: 181 [2021-12-21 10:16:09,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=404, Unknown=3, NotChecked=132, Total=650 [2021-12-21 10:16:09,113 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:16:09,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 118 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 450 Invalid, 0 Unknown, 284 Unchecked, 0.2s Time] [2021-12-21 10:16:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-21 10:16:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 111. [2021-12-21 10:16:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 110 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2021-12-21 10:16:09,124 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 37 [2021-12-21 10:16:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:16:09,124 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2021-12-21 10:16:09,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2021-12-21 10:16:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:16:09,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:16:09,140 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:16:09,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-21 10:16:09,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-21 10:16:09,340 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:16:09,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:16:09,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2063837675, now seen corresponding path program 3 times [2021-12-21 10:16:09,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:16:09,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052943001] [2021-12-21 10:16:09,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:16:09,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:16:09,349 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:16:09,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1383616142] [2021-12-21 10:16:09,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:16:09,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:16:09,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:16:09,363 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:16:09,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-21 10:16:09,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-21 10:16:09,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:16:09,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-21 10:16:09,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:16:09,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2021-12-21 10:16:09,541 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-12-21 10:16:09,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-12-21 10:16:09,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:09,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-12-21 10:16:09,645 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:16:09,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2021-12-21 10:16:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-21 10:16:09,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:16:09,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_553 (Array Int Int))) (let ((.cse0 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 6) (< .cse0 c_~N~0) (< c_~N~0 .cse0)))) is different from false [2021-12-21 10:16:09,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_167| Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_167|) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_167| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_167| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 6))) is different from false [2021-12-21 10:16:09,941 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_167| Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_167| 1) |c_ULTIMATE.start_main_~i~0#1|) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_167| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_167|))) is different from false [2021-12-21 10:16:09,996 INFO L353 Elim1Store]: treesize reduction 39, result has 41.8 percent of original size [2021-12-21 10:16:09,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 46 [2021-12-21 10:16:10,003 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2021-12-21 10:16:10,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2021-12-21 10:16:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 10 not checked. [2021-12-21 10:16:10,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:16:10,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052943001] [2021-12-21 10:16:10,035 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:16:10,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383616142] [2021-12-21 10:16:10,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383616142] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:16:10,035 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:16:10,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2021-12-21 10:16:10,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49667523] [2021-12-21 10:16:10,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:16:10,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-21 10:16:10,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:16:10,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 10:16:10,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=338, Unknown=11, NotChecked=120, Total=552 [2021-12-21 10:16:10,036 INFO L87 Difference]: Start difference. First operand 111 states and 139 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:10,621 WARN L838 $PredicateComparison]: unable to prove that (and (= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_167| Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_167| 1) |c_ULTIMATE.start_main_~i~0#1|) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_167| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_167|)))) is different from false [2021-12-21 10:16:12,632 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_167| Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_167|) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_167| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_167| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)))) is different from false [2021-12-21 10:16:13,319 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (= 6 (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_167| Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_167| 1) |c_ULTIMATE.start_main_~i~0#1|) (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_167| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_167|))) (= 6 (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2021-12-21 10:16:15,328 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_159| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (- 4) (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 6) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_159| 1)) (< |v_ULTIMATE.start_main_~i~0#1_159| c_~N~0))) (= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_167| Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_167|) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_167| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_167| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 6)))) is different from false [2021-12-21 10:16:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:16:15,431 INFO L93 Difference]: Finished difference Result 163 states and 204 transitions. [2021-12-21 10:16:15,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 10:16:15,431 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:16:15,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:16:15,433 INFO L225 Difference]: With dead ends: 163 [2021-12-21 10:16:15,433 INFO L226 Difference]: Without dead ends: 159 [2021-12-21 10:16:15,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=133, Invalid=480, Unknown=15, NotChecked=364, Total=992 [2021-12-21 10:16:15,437 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:16:15,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 62 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 182 Unchecked, 0.1s Time] [2021-12-21 10:16:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-21 10:16:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2021-12-21 10:16:15,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 132 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 171 transitions. [2021-12-21 10:16:15,450 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 171 transitions. Word has length 37 [2021-12-21 10:16:15,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:16:15,451 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 171 transitions. [2021-12-21 10:16:15,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 171 transitions. [2021-12-21 10:16:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:16:15,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:16:15,452 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:16:15,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-21 10:16:15,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-21 10:16:15,663 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:16:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:16:15,664 INFO L85 PathProgramCache]: Analyzing trace with hash -147310295, now seen corresponding path program 2 times [2021-12-21 10:16:15,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:16:15,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927089463] [2021-12-21 10:16:15,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:16:15,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:16:15,673 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:16:15,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424290848] [2021-12-21 10:16:15,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:16:15,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:16:15,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:16:15,680 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:16:15,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-21 10:16:15,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:16:15,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:16:15,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-21 10:16:15,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:16:15,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 10:16:15,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:15,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-21 10:16:15,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:15,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-21 10:16:15,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 10:16:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:16:15,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:16:16,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-21 10:16:16,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-12-21 10:16:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:16:16,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:16:16,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927089463] [2021-12-21 10:16:16,045 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:16:16,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424290848] [2021-12-21 10:16:16,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424290848] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:16:16,046 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:16:16,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-12-21 10:16:16,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082715699] [2021-12-21 10:16:16,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:16:16,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:16:16,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:16:16,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:16:16,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:16:16,046 INFO L87 Difference]: Start difference. First operand 133 states and 171 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:16:16,262 INFO L93 Difference]: Finished difference Result 214 states and 283 transitions. [2021-12-21 10:16:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 10:16:16,262 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:16:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:16:16,263 INFO L225 Difference]: With dead ends: 214 [2021-12-21 10:16:16,263 INFO L226 Difference]: Without dead ends: 147 [2021-12-21 10:16:16,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-12-21 10:16:16,267 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:16:16,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 73 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 10:16:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-21 10:16:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2021-12-21 10:16:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions. [2021-12-21 10:16:16,289 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 37 [2021-12-21 10:16:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:16:16,289 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions. [2021-12-21 10:16:16,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2021-12-21 10:16:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 10:16:16,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:16:16,290 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:16:16,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-21 10:16:16,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:16:16,516 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:16:16,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:16:16,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2021-12-21 10:16:16,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:16:16,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548664256] [2021-12-21 10:16:16,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:16:16,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:16:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:16:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:16:16,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:16:16,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548664256] [2021-12-21 10:16:16,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548664256] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:16:16,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719974873] [2021-12-21 10:16:16,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:16:16,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:16:16,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:16:16,599 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:16:16,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-21 10:16:16,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:16:16,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:16:16,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 10:16:16,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:16:16,788 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:16:16,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:16:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:16:16,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719974873] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:16:16,857 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:16:16,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-21 10:16:16,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69912414] [2021-12-21 10:16:16,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:16:16,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:16:16,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:16:16,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:16:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:16:16,860 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:17,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:16:17,122 INFO L93 Difference]: Finished difference Result 178 states and 229 transitions. [2021-12-21 10:16:17,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 10:16:17,122 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-21 10:16:17,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:16:17,123 INFO L225 Difference]: With dead ends: 178 [2021-12-21 10:16:17,123 INFO L226 Difference]: Without dead ends: 157 [2021-12-21 10:16:17,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-21 10:16:17,124 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 90 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:16:17,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 31 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 10:16:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-21 10:16:17,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 105. [2021-12-21 10:16:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2021-12-21 10:16:17,145 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 39 [2021-12-21 10:16:17,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:16:17,146 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2021-12-21 10:16:17,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2021-12-21 10:16:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 10:16:17,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:16:17,147 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:16:17,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-21 10:16:17,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-21 10:16:17,376 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:16:17,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:16:17,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2021-12-21 10:16:17,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:16:17,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936242067] [2021-12-21 10:16:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:16:17,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:16:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:16:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:16:17,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:16:17,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936242067] [2021-12-21 10:16:17,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936242067] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:16:17,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157801811] [2021-12-21 10:16:17,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:16:17,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:16:17,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:16:17,469 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:16:17,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-21 10:16:17,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-21 10:16:17,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:16:17,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 10:16:17,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:16:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:16:17,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:16:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:16:17,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157801811] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:16:17,732 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:16:17,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-21 10:16:17,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936345508] [2021-12-21 10:16:17,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:16:17,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:16:17,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:16:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:16:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:16:17,733 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:16:17,878 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2021-12-21 10:16:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 10:16:17,879 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-21 10:16:17,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:16:17,879 INFO L225 Difference]: With dead ends: 131 [2021-12-21 10:16:17,879 INFO L226 Difference]: Without dead ends: 58 [2021-12-21 10:16:17,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-21 10:16:17,880 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 104 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:16:17,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 23 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:16:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-21 10:16:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-12-21 10:16:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2021-12-21 10:16:17,889 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 40 [2021-12-21 10:16:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:16:17,889 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2021-12-21 10:16:17,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2021-12-21 10:16:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:16:17,890 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:16:17,890 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:16:17,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-21 10:16:18,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-21 10:16:18,103 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:16:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:16:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2021-12-21 10:16:18,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:16:18,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935558606] [2021-12-21 10:16:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:16:18,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:16:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:16:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 10:16:18,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:16:18,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935558606] [2021-12-21 10:16:18,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935558606] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:16:18,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036761107] [2021-12-21 10:16:18,637 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 10:16:18,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:16:18,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:16:18,638 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:16:18,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-21 10:16:18,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 10:16:18,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:16:18,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-21 10:16:18,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:16:18,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:16:18,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:18,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:16:18,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:18,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:16:18,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:18,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:16:18,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:18,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:16:19,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:19,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:16:19,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:19,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:16:19,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:19,092 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:16:19,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:19,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:16:19,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:19,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-21 10:16:19,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:19,313 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:16:19,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-21 10:16:19,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:19,470 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-21 10:16:19,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 63 [2021-12-21 10:16:19,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:19,629 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:16:19,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2021-12-21 10:16:19,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:19,731 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:16:19,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 30 [2021-12-21 10:16:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 10:16:19,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:16:55,198 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_237| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_239| 4))))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2 .cse6 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_237| 4))))) (or (not (= 6 .cse0)) (not (= 6 .cse1)) (not (= .cse2 6)) (not (= .cse3 6)) (let ((.cse5 (+ .cse3 .cse2 .cse0 .cse6 .cse1)) (.cse4 (* c_~N~0 6))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))))))))))) is different from false