./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s22if.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/s22if.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 0a4adccbfdb287a751e5c33c3e59569f71741de562bf1a42797adb485c4a44d2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 10:14:35,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 10:14:35,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 10:14:35,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 10:14:35,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 10:14:35,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 10:14:35,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 10:14:35,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 10:14:35,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 10:14:35,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 10:14:35,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 10:14:35,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 10:14:35,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 10:14:35,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 10:14:35,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 10:14:35,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 10:14:35,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 10:14:35,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 10:14:35,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 10:14:35,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 10:14:35,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 10:14:35,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 10:14:35,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 10:14:35,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 10:14:35,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 10:14:35,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 10:14:35,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 10:14:35,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 10:14:35,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 10:14:35,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 10:14:35,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 10:14:35,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 10:14:35,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 10:14:35,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 10:14:35,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 10:14:35,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 10:14:35,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 10:14:35,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 10:14:35,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 10:14:35,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 10:14:35,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 10:14:35,221 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:14:35,244 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 10:14:35,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 10:14:35,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 10:14:35,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 10:14:35,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 10:14:35,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 10:14:35,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 10:14:35,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 10:14:35,247 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 10:14:35,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 10:14:35,247 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 10:14:35,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 10:14:35,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 10:14:35,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 10:14:35,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 10:14:35,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 10:14:35,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 10:14:35,248 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 10:14:35,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 10:14:35,249 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 10:14:35,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 10:14:35,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 10:14:35,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 10:14:35,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 10:14:35,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:14:35,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 10:14:35,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 10:14:35,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 10:14:35,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 10:14:35,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 10:14:35,251 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 10:14:35,251 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 10:14:35,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 10:14:35,252 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 10:14:35,252 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 -> 0a4adccbfdb287a751e5c33c3e59569f71741de562bf1a42797adb485c4a44d2 [2021-12-21 10:14:35,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 10:14:35,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 10:14:35,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 10:14:35,483 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 10:14:35,484 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 10:14:35,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s22if.c [2021-12-21 10:14:35,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822347f90/fe493bfd9db143b5bd51eaba4d112635/FLAG3f2020794 [2021-12-21 10:14:35,860 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 10:14:35,860 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s22if.c [2021-12-21 10:14:35,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822347f90/fe493bfd9db143b5bd51eaba4d112635/FLAG3f2020794 [2021-12-21 10:14:35,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822347f90/fe493bfd9db143b5bd51eaba4d112635 [2021-12-21 10:14:35,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 10:14:35,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 10:14:35,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 10:14:35,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 10:14:35,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 10:14:35,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:35" (1/1) ... [2021-12-21 10:14:35,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af068d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:35, skipping insertion in model container [2021-12-21 10:14:35,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:35" (1/1) ... [2021-12-21 10:14:35,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 10:14:35,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 10:14:36,011 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/s22if.c[588,601] [2021-12-21 10:14:36,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:14:36,027 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 10:14:36,034 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/s22if.c[588,601] [2021-12-21 10:14:36,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:14:36,049 INFO L208 MainTranslator]: Completed translation [2021-12-21 10:14:36,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:36 WrapperNode [2021-12-21 10:14:36,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 10:14:36,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 10:14:36,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 10:14:36,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 10:14:36,055 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:14:36" (1/1) ... [2021-12-21 10:14:36,060 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:14:36" (1/1) ... [2021-12-21 10:14:36,084 INFO L137 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2021-12-21 10:14:36,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 10:14:36,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 10:14:36,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 10:14:36,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 10:14:36,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:36" (1/1) ... [2021-12-21 10:14:36,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:36" (1/1) ... [2021-12-21 10:14:36,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:36" (1/1) ... [2021-12-21 10:14:36,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:36" (1/1) ... [2021-12-21 10:14:36,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:36" (1/1) ... [2021-12-21 10:14:36,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:36" (1/1) ... [2021-12-21 10:14:36,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:36" (1/1) ... [2021-12-21 10:14:36,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 10:14:36,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 10:14:36,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 10:14:36,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 10:14:36,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:36" (1/1) ... [2021-12-21 10:14:36,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:14:36,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:36,147 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:14:36,153 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:14:36,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 10:14:36,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 10:14:36,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 10:14:36,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 10:14:36,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 10:14:36,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 10:14:36,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 10:14:36,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 10:14:36,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 10:14:36,223 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 10:14:36,224 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 10:14:36,385 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 10:14:36,389 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 10:14:36,390 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-21 10:14:36,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:36 BoogieIcfgContainer [2021-12-21 10:14:36,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 10:14:36,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 10:14:36,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 10:14:36,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 10:14:36,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:14:35" (1/3) ... [2021-12-21 10:14:36,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d98fdaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:36, skipping insertion in model container [2021-12-21 10:14:36,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:36" (2/3) ... [2021-12-21 10:14:36,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d98fdaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:36, skipping insertion in model container [2021-12-21 10:14:36,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:36" (3/3) ... [2021-12-21 10:14:36,407 INFO L111 eAbstractionObserver]: Analyzing ICFG s22if.c [2021-12-21 10:14:36,410 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 10:14:36,411 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 10:14:36,468 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 10:14:36,472 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:14:36,473 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 10:14:36,486 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:14:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 10:14:36,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:36,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:36,498 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:36,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:36,504 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2021-12-21 10:14:36,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:36,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225439846] [2021-12-21 10:14:36,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:36,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:36,630 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:14:36,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:36,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225439846] [2021-12-21 10:14:36,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225439846] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:14:36,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:14:36,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 10:14:36,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489918923] [2021-12-21 10:14:36,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:14:36,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 10:14:36,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:36,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 10:14:36,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 10:14:36,660 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:14:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:36,669 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2021-12-21 10:14:36,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 10:14:36,671 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:14:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:36,675 INFO L225 Difference]: With dead ends: 42 [2021-12-21 10:14:36,675 INFO L226 Difference]: Without dead ends: 19 [2021-12-21 10:14:36,677 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:14:36,679 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:14:36,680 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:14:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-21 10:14:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-21 10:14:36,713 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:14:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-12-21 10:14:36,714 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2021-12-21 10:14:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:36,715 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-21 10:14:36,715 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:14:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-12-21 10:14:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 10:14:36,716 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:36,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:36,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 10:14:36,716 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:36,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:36,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2021-12-21 10:14:36,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:36,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593564501] [2021-12-21 10:14:36,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:36,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:36,766 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:14:36,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:36,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593564501] [2021-12-21 10:14:36,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593564501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:14:36,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:14:36,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:14:36,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595280063] [2021-12-21 10:14:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:14:36,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:14:36,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:36,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:14:36,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:14:36,770 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:14:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:36,842 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2021-12-21 10:14:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:14:36,843 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:14:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:36,844 INFO L225 Difference]: With dead ends: 39 [2021-12-21 10:14:36,844 INFO L226 Difference]: Without dead ends: 27 [2021-12-21 10:14:36,845 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:14:36,846 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:14:36,848 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:14:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-21 10:14:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-12-21 10:14:36,853 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:14:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-12-21 10:14:36,854 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2021-12-21 10:14:36,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:36,855 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-12-21 10:14:36,856 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:14:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-12-21 10:14:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 10:14:36,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:36,858 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:14:36,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 10:14:36,858 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:36,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:36,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2021-12-21 10:14:36,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:36,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741217639] [2021-12-21 10:14:36,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:36,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:37,146 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:14:37,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:37,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741217639] [2021-12-21 10:14:37,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741217639] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:37,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325336729] [2021-12-21 10:14:37,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:37,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:37,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:37,149 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:14:37,154 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:14:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:37,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-21 10:14:37,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:37,288 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:14:37,298 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:14:37,339 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:14:37,405 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:14:37,480 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:14:37,595 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 47 treesize of output 27 [2021-12-21 10:14:37,626 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:14:37,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:37,805 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 3)) (.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 3))))) is different from false [2021-12-21 10:14:37,978 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:14:37,978 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:14:37,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:14:37,982 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:14:37,986 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:14:37,996 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:14:37,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325336729] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:37,997 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:37,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2021-12-21 10:14:37,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776293608] [2021-12-21 10:14:37,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:37,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 10:14:37,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:37,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 10:14:37,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=244, Unknown=1, NotChecked=32, Total=342 [2021-12-21 10:14:37,999 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:14:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:38,212 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2021-12-21 10:14:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 10:14:38,212 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:14:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:38,213 INFO L225 Difference]: With dead ends: 41 [2021-12-21 10:14:38,213 INFO L226 Difference]: Without dead ends: 37 [2021-12-21 10:14:38,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=418, Unknown=1, NotChecked=44, Total=600 [2021-12-21 10:14:38,217 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:38,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 61 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 141 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2021-12-21 10:14:38,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-21 10:14:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2021-12-21 10:14:38,221 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:14:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-12-21 10:14:38,222 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2021-12-21 10:14:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:38,222 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-21 10:14:38,222 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:14:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2021-12-21 10:14:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 10:14:38,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:38,223 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:14:38,241 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:14:38,439 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:14:38,440 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:38,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2021-12-21 10:14:38,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:38,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380267813] [2021-12-21 10:14:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:38,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:38,453 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:14:38,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610349309] [2021-12-21 10:14:38,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:38,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:38,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:38,454 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:14:38,455 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:14:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:38,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 10:14:38,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:38,544 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:14:38,580 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 17 treesize of output 9 [2021-12-21 10:14:38,591 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:14:38,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:38,636 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:14:38,640 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-21 10:14:38,640 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:14:38,656 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:14:38,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380267813] [2021-12-21 10:14:38,656 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:14:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610349309] [2021-12-21 10:14:38,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610349309] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:38,656 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:14:38,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-12-21 10:14:38,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760435693] [2021-12-21 10:14:38,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:38,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 10:14:38,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:38,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 10:14:38,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-21 10:14:38,658 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:14:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:38,787 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2021-12-21 10:14:38,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 10:14:38,788 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:14:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:38,790 INFO L225 Difference]: With dead ends: 58 [2021-12-21 10:14:38,791 INFO L226 Difference]: Without dead ends: 51 [2021-12-21 10:14:38,792 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:14:38,793 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:38,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 63 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:38,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-21 10:14:38,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2021-12-21 10:14:38,804 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:14:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2021-12-21 10:14:38,807 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2021-12-21 10:14:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:38,808 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-12-21 10:14:38,808 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:14:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2021-12-21 10:14:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 10:14:38,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:38,810 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:14:38,829 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:14:39,025 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:14:39,025 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:39,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:39,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1649883961, now seen corresponding path program 1 times [2021-12-21 10:14:39,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:39,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724191631] [2021-12-21 10:14:39,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:39,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:39,197 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:14:39,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:39,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724191631] [2021-12-21 10:14:39,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724191631] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:39,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691625611] [2021-12-21 10:14:39,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:39,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:39,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:39,200 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:14:39,201 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:14:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:39,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 10:14:39,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:39,264 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:14:39,302 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:14:39,320 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:14:39,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:39,360 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:14:39,362 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:14:39,377 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:14:39,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691625611] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:39,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:39,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2021-12-21 10:14:39,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517908139] [2021-12-21 10:14:39,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:39,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:14:39,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:39,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:14:39,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:14:39,380 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:14:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:39,821 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2021-12-21 10:14:39,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-21 10:14:39,821 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:14:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:39,822 INFO L225 Difference]: With dead ends: 86 [2021-12-21 10:14:39,822 INFO L226 Difference]: Without dead ends: 72 [2021-12-21 10:14:39,822 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:14:39,823 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 82 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:39,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 83 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 10:14:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-21 10:14:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2021-12-21 10:14:39,827 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:14:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2021-12-21 10:14:39,827 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2021-12-21 10:14:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:39,827 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2021-12-21 10:14:39,827 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:14:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2021-12-21 10:14:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 10:14:39,828 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:39,828 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:14:39,846 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:14:40,028 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:14:40,029 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:40,029 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2021-12-21 10:14:40,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:40,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556782531] [2021-12-21 10:14:40,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:40,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:40,068 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:14:40,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:40,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556782531] [2021-12-21 10:14:40,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556782531] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:40,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176073459] [2021-12-21 10:14:40,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:14:40,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:40,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:40,071 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:14:40,072 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:14:40,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:14:40,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:40,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 10:14:40,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:40,184 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:14:40,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:40,225 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:14:40,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176073459] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:40,226 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:40,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 10:14:40,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170241872] [2021-12-21 10:14:40,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:40,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 10:14:40,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:40,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 10:14:40,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-21 10:14:40,227 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:14:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:40,342 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2021-12-21 10:14:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 10:14:40,345 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:14:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:40,345 INFO L225 Difference]: With dead ends: 85 [2021-12-21 10:14:40,345 INFO L226 Difference]: Without dead ends: 75 [2021-12-21 10:14:40,346 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:14:40,346 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:40,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 26 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-21 10:14:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2021-12-21 10:14:40,351 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:14:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2021-12-21 10:14:40,351 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2021-12-21 10:14:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:40,352 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2021-12-21 10:14:40,352 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:14:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2021-12-21 10:14:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 10:14:40,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:40,352 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:14:40,371 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:14:40,567 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:14:40,567 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2021-12-21 10:14:40,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:40,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125204519] [2021-12-21 10:14:40,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:40,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:40,618 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:14:40,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:40,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125204519] [2021-12-21 10:14:40,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125204519] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:40,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821994515] [2021-12-21 10:14:40,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:14:40,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:40,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:40,619 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:14:40,620 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:14:40,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-21 10:14:40,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:40,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 10:14:40,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:40,715 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:14:40,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:40,757 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:14:40,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821994515] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:40,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:40,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 10:14:40,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232221438] [2021-12-21 10:14:40,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:40,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 10:14:40,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:40,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 10:14:40,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-21 10:14:40,758 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:14:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:40,837 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2021-12-21 10:14:40,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 10:14:40,838 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:14:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:40,838 INFO L225 Difference]: With dead ends: 78 [2021-12-21 10:14:40,838 INFO L226 Difference]: Without dead ends: 42 [2021-12-21 10:14:40,839 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:14:40,839 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:40,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 26 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-21 10:14:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2021-12-21 10:14:40,842 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:14:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2021-12-21 10:14:40,843 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2021-12-21 10:14:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:40,843 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-12-21 10:14:40,843 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:14:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2021-12-21 10:14:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 10:14:40,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:40,844 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:14:40,862 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:14:41,059 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:14:41,059 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:41,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2021-12-21 10:14:41,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:41,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071701796] [2021-12-21 10:14:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:41,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:41,327 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:14:41,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:41,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071701796] [2021-12-21 10:14:41,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071701796] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:41,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508918298] [2021-12-21 10:14:41,328 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 10:14:41,328 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:41,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:41,329 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:14:41,330 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:14:41,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 10:14:41,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:41,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-21 10:14:41,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:41,393 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:14:41,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:41,428 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:14:41,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:41,460 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:14:41,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:41,545 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:14:41,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:41,578 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:14:41,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:41,644 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:14:41,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:41,734 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:41,734 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 55 treesize of output 41 [2021-12-21 10:14:41,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:41,869 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:41,869 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 68 treesize of output 32 [2021-12-21 10:14:41,895 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:14:41,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:42,446 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 3)) (not (= 3 .cse1)) (let ((.cse3 (+ .cse4 .cse0 .cse1)) (.cse2 (* c_~N~0 3))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))))))))) is different from false [2021-12-21 10:14:43,137 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 ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |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 (= 3 .cse0)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse1 (div (+ .cse2 .cse3 .cse0) 3)) (<= (div (+ (* (- 1) .cse2) (* (- 1) .cse0) (* (- 1) .cse3)) (- 3)) .cse1))) (not (= .cse2 3)))))))) is different from false [2021-12-21 10:14:43,216 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|)) (.cse0 (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 .cse0))) |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 (= 3 .cse0)) (let ((.cse3 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= (div (+ (* (- 1) .cse1) (* (- 1) .cse0) (* (- 1) .cse2)) (- 3)) .cse3) (<= .cse3 (div (+ .cse1 .cse2 .cse0) 3)))) (not (= .cse1 3)))))))) is different from false [2021-12-21 10:14:43,318 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:14:43,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508918298] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:43,319 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:43,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 33 [2021-12-21 10:14:43,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662259284] [2021-12-21 10:14:43,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:43,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-21 10:14:43,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:43,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-21 10:14:43,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=763, Unknown=4, NotChecked=174, Total=1056 [2021-12-21 10:14:43,321 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:14:43,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:43,936 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2021-12-21 10:14:43,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-21 10:14:43,936 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:14:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:43,937 INFO L225 Difference]: With dead ends: 83 [2021-12-21 10:14:43,937 INFO L226 Difference]: Without dead ends: 78 [2021-12-21 10:14:43,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1457, Unknown=4, NotChecked=246, Total=1980 [2021-12-21 10:14:43,938 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 463 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:43,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 122 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 331 Invalid, 0 Unknown, 463 Unchecked, 0.2s Time] [2021-12-21 10:14:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-21 10:14:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2021-12-21 10:14:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 0 states have call successors, (0), 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:14:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2021-12-21 10:14:43,944 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 29 [2021-12-21 10:14:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:43,944 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2021-12-21 10:14:43,944 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:14:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2021-12-21 10:14:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 10:14:43,945 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:43,945 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:14:43,963 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:14:44,147 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:14:44,147 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2021-12-21 10:14:44,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:44,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038796198] [2021-12-21 10:14:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:44,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:44,156 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:14:44,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [811243268] [2021-12-21 10:14:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:44,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:44,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:44,157 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:14:44,158 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:14:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:44,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-21 10:14:44,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:44,262 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:14:44,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:44,308 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:14:44,332 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:14:44,344 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:14:44,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:44,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= (+ (- 2) (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:14:44,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= (+ (- 2) (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:14:44,422 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:14:44,422 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:14:44,427 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:14:44,427 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 42 treesize of output 42 [2021-12-21 10:14:44,430 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:14:44,489 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:14:44,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:44,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038796198] [2021-12-21 10:14:44,489 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:14:44,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811243268] [2021-12-21 10:14:44,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811243268] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:44,489 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:14:44,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-21 10:14:44,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241440242] [2021-12-21 10:14:44,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:44,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 10:14:44,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:44,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 10:14:44,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2021-12-21 10:14:44,490 INFO L87 Difference]: Start difference. First operand 66 states and 84 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:14:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:44,658 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2021-12-21 10:14:44,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 10:14:44,658 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:14:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:44,659 INFO L225 Difference]: With dead ends: 112 [2021-12-21 10:14:44,659 INFO L226 Difference]: Without dead ends: 105 [2021-12-21 10:14:44,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=267, Unknown=2, NotChecked=70, Total=420 [2021-12-21 10:14:44,659 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:44,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 86 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 225 Invalid, 0 Unknown, 122 Unchecked, 0.1s Time] [2021-12-21 10:14:44,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-21 10:14:44,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2021-12-21 10:14:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 0 states have call successors, (0), 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:14:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2021-12-21 10:14:44,666 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 29 [2021-12-21 10:14:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:44,667 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2021-12-21 10:14:44,667 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:14:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2021-12-21 10:14:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 10:14:44,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:44,667 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:14:44,684 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:14:44,883 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:14:44,884 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2021-12-21 10:14:44,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:44,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421027745] [2021-12-21 10:14:44,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:44,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:44,892 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:14:44,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1422312015] [2021-12-21 10:14:44,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:44,893 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:44,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:44,894 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:14:44,898 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:14:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:44,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 10:14:44,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:44,955 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:14:44,994 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-21 10:14:44,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, 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:14:45,011 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:14:45,030 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:14:45,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:45,085 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:14:45,087 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:14:45,098 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:14:45,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:45,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421027745] [2021-12-21 10:14:45,099 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:14:45,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422312015] [2021-12-21 10:14:45,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422312015] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:45,099 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:14:45,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-12-21 10:14:45,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559294789] [2021-12-21 10:14:45,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:45,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 10:14:45,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:45,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 10:14:45,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-21 10:14:45,101 INFO L87 Difference]: Start difference. First operand 82 states and 104 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:14:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:45,200 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions. [2021-12-21 10:14:45,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 10:14:45,200 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:14:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:45,201 INFO L225 Difference]: With dead ends: 123 [2021-12-21 10:14:45,201 INFO L226 Difference]: Without dead ends: 91 [2021-12-21 10:14:45,201 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:14:45,201 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:45,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 57 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-21 10:14:45,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2021-12-21 10:14:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 81 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:14:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2021-12-21 10:14:45,208 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 29 [2021-12-21 10:14:45,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:45,208 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2021-12-21 10:14:45,208 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:14:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2021-12-21 10:14:45,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 10:14:45,209 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:45,209 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:14:45,228 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:14:45,423 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:14:45,424 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2021-12-21 10:14:45,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:45,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54820895] [2021-12-21 10:14:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:45,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:45,468 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:14:45,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:45,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54820895] [2021-12-21 10:14:45,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54820895] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:45,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603680634] [2021-12-21 10:14:45,469 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 10:14:45,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:45,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:45,470 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:14:45,471 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:14:45,524 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-21 10:14:45,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:45,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 10:14:45,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:45,608 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:14:45,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:45,661 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:14:45,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603680634] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:45,661 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:45,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-21 10:14:45,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261100290] [2021-12-21 10:14:45,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:45,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 10:14:45,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:45,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 10:14:45,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-21 10:14:45,662 INFO L87 Difference]: Start difference. First operand 82 states and 102 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:14:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:45,851 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2021-12-21 10:14:45,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 10:14:45,851 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:14:45,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:45,852 INFO L225 Difference]: With dead ends: 110 [2021-12-21 10:14:45,852 INFO L226 Difference]: Without dead ends: 97 [2021-12-21 10:14:45,852 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:14:45,852 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:45,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 34 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-21 10:14:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2021-12-21 10:14:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2021-12-21 10:14:45,858 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 31 [2021-12-21 10:14:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:45,858 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2021-12-21 10:14:45,859 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:14:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2021-12-21 10:14:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 10:14:45,859 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:45,859 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:14:45,880 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:14:46,060 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:14:46,060 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:46,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:46,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2021-12-21 10:14:46,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:46,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145769162] [2021-12-21 10:14:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:46,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:46,104 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:14:46,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:46,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145769162] [2021-12-21 10:14:46,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145769162] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:46,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741708163] [2021-12-21 10:14:46,105 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-21 10:14:46,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:46,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:46,106 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:14:46,107 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:14:46,157 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-21 10:14:46,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:46,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 10:14:46,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:46,239 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:14:46,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:46,294 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:14:46,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741708163] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:46,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:46,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-21 10:14:46,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534368667] [2021-12-21 10:14:46,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:46,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 10:14:46,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:46,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 10:14:46,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-21 10:14:46,296 INFO L87 Difference]: Start difference. First operand 78 states and 97 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:14:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:46,398 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2021-12-21 10:14:46,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 10:14:46,399 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:14:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:46,399 INFO L225 Difference]: With dead ends: 101 [2021-12-21 10:14:46,399 INFO L226 Difference]: Without dead ends: 50 [2021-12-21 10:14:46,399 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:14:46,400 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:46,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 27 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-21 10:14:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2021-12-21 10:14:46,403 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:14:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-12-21 10:14:46,403 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2021-12-21 10:14:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:46,403 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-12-21 10:14:46,403 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:14:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2021-12-21 10:14:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:14:46,404 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:46,404 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:14:46,423 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:14:46,607 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:14:46,607 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2021-12-21 10:14:46,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:46,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814969281] [2021-12-21 10:14:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:46,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:46,938 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:14:46,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:46,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814969281] [2021-12-21 10:14:46,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814969281] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:46,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768476768] [2021-12-21 10:14:46,938 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-21 10:14:46,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:46,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:46,940 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:14:46,941 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:14:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:46,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-21 10:14:47,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:47,009 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:14:47,013 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:14:47,025 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:14:47,042 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:14:47,071 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:14:47,147 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:14:47,171 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:14:47,197 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:14:47,262 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:14:47,353 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:47,353 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:14:47,455 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:47,456 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:14:47,579 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:47,580 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 68 treesize of output 36 [2021-12-21 10:14:47,618 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:14:47,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:51,578 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 ((.cse1 (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| (+ .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 ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .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 3)) (not (= .cse1 3)) (not (= .cse2 3)) (let ((.cse4 (+ .cse1 .cse2 .cse0 .cse5)) (.cse3 (* c_~N~0 3))) (and (<= .cse3 .cse4) (<= .cse4 .cse3)))))))))) is different from false [2021-12-21 10:14:55,179 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (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 ((.cse0 (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 ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .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| (+ .cse1 .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 3)) (not (= .cse1 3)) (let ((.cse3 (* 3 ~N~0)) (.cse2 (+ .cse1 .cse0 .cse4 .cse5))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 3 .cse4))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2021-12-21 10:14:55,929 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 ((.cse0 (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 ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .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| (+ .cse1 .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 3)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse1 3)) (let ((.cse3 (* 3 ~N~0)) (.cse2 (+ .cse1 .cse0 .cse4 .cse5))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 3 .cse4))))))))) is different from false [2021-12-21 10:14:57,651 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 ((.cse0 (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 ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .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| (+ .cse1 .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 3)) (not (= .cse1 3)) (let ((.cse3 (* 3 ~N~0)) (.cse2 (+ .cse1 .cse0 .cse4 .cse5))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= 3 .cse4))))))))) is different from false [2021-12-21 10:14:58,585 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:14:58,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768476768] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:58,585 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:58,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 38 [2021-12-21 10:14:58,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915026961] [2021-12-21 10:14:58,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:58,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-21 10:14:58,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:58,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-21 10:14:58,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1007, Unknown=7, NotChecked=268, Total=1406 [2021-12-21 10:14:58,587 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:14:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:59,328 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2021-12-21 10:14:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-21 10:14:59,328 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:14:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:59,329 INFO L225 Difference]: With dead ends: 94 [2021-12-21 10:14:59,329 INFO L226 Difference]: Without dead ends: 90 [2021-12-21 10:14:59,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=249, Invalid=1830, Unknown=7, NotChecked=364, Total=2450 [2021-12-21 10:14:59,330 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 50 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 626 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:59,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 126 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 356 Invalid, 0 Unknown, 626 Unchecked, 0.2s Time] [2021-12-21 10:14:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-21 10:14:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2021-12-21 10:14:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2021-12-21 10:14:59,336 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 37 [2021-12-21 10:14:59,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:59,337 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2021-12-21 10:14:59,337 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:14:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2021-12-21 10:14:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:14:59,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:59,338 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:14:59,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-21 10:14:59,551 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:14:59,551 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:59,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:59,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2021-12-21 10:14:59,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:59,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876049880] [2021-12-21 10:14:59,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:59,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:59,564 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:14:59,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803998226] [2021-12-21 10:14:59,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:14:59,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:59,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:59,565 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:14:59,567 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:14:59,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:14:59,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:59,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-21 10:14:59,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:59,783 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:14:59,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:59,841 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:14:59,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:59,883 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:14:59,922 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:14:59,922 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 23 treesize of output 23 [2021-12-21 10:14:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:14:59,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:00,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_498 (Array Int Int))) (or (= 3 (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)))) (not (<= |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) c_~N~0))) is different from false [2021-12-21 10:15:00,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_498 (Array Int Int))) (or (= 3 (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_150|) (< (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) c_~N~0))) is different from false [2021-12-21 10:15:00,224 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:00,225 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:00,233 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:00,234 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 42 treesize of output 42 [2021-12-21 10:15:00,237 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 7 [2021-12-21 10:15:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-21 10:15:00,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:00,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876049880] [2021-12-21 10:15:00,544 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:00,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803998226] [2021-12-21 10:15:00,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803998226] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:00,544 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:00,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2021-12-21 10:15:00,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434961512] [2021-12-21 10:15:00,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:00,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-21 10:15:00,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:00,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-21 10:15:00,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=799, Unknown=9, NotChecked=122, Total=1122 [2021-12-21 10:15:00,545 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:00,966 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2021-12-21 10:15:00,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 10:15:00,967 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:15:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:00,967 INFO L225 Difference]: With dead ends: 106 [2021-12-21 10:15:00,967 INFO L226 Difference]: Without dead ends: 99 [2021-12-21 10:15:00,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=374, Invalid=1346, Unknown=10, NotChecked=162, Total=1892 [2021-12-21 10:15:00,968 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 136 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:00,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 47 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 345 Invalid, 0 Unknown, 205 Unchecked, 0.2s Time] [2021-12-21 10:15:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-21 10:15:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2021-12-21 10:15:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 89 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:15:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2021-12-21 10:15:00,978 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 37 [2021-12-21 10:15:00,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:00,979 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2021-12-21 10:15:00,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2021-12-21 10:15:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:15:00,980 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:00,980 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:15:00,997 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:15:01,187 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:15:01,187 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:01,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2063837675, now seen corresponding path program 3 times [2021-12-21 10:15:01,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:01,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891943442] [2021-12-21 10:15:01,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:01,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:01,198 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:01,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1697164681] [2021-12-21 10:15:01,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:15:01,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:01,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:01,199 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:15:01,201 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:15:01,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-21 10:15:01,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:01,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-21 10:15:01,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:01,305 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:15:01,347 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-12-21 10:15:01,348 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:15:01,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:01,418 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:15:01,445 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:01,445 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:15:01,524 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:15:01,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:01,592 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|)) 3) (< .cse0 c_~N~0) (< c_~N~0 .cse0)))) is different from false [2021-12-21 10:15:01,740 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (= 3 (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_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_170|) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_170| 1)))) is different from false [2021-12-21 10:15:01,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_170|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_170| 1) |c_ULTIMATE.start_main_~i~0#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| 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_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3))) is different from false [2021-12-21 10:15:01,821 INFO L353 Elim1Store]: treesize reduction 39, result has 41.8 percent of original size [2021-12-21 10:15:01,822 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:15:01,828 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2021-12-21 10:15:01,828 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 42 treesize of output 30 [2021-12-21 10:15:01,860 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:15:01,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:01,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891943442] [2021-12-21 10:15:01,860 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:01,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697164681] [2021-12-21 10:15:01,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697164681] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:01,861 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:01,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2021-12-21 10:15:01,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017098055] [2021-12-21 10:15:01,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:01,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-21 10:15:01,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:01,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 10:15:01,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=338, Unknown=11, NotChecked=120, Total=552 [2021-12-21 10:15:01,862 INFO L87 Difference]: Start difference. First operand 90 states and 109 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:15:02,443 WARN L838 $PredicateComparison]: unable to prove that (and (= 3 (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_~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_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_170|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_170| 1) |c_ULTIMATE.start_main_~i~0#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| 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_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)))) is different from false [2021-12-21 10:15:04,451 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|) (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (= 3 (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_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_170|) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_170| 1)))) (= 3 (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|)))) is different from false [2021-12-21 10:15:05,032 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 (= 3 (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|) (= 3 (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_170|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_170| 1) |c_ULTIMATE.start_main_~i~0#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| 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_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3))))) is different from false [2021-12-21 10:15:07,041 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~i~0#1_162| Int)) (and (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_162| 1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_162| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |v_ULTIMATE.start_main_~i~0#1_162| 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_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (= 3 (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_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_170|) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_170| 1)))) (= 3 (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|)))) is different from false [2021-12-21 10:15:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:07,153 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2021-12-21 10:15:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-21 10:15:07,154 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:15:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:07,154 INFO L225 Difference]: With dead ends: 121 [2021-12-21 10:15:07,154 INFO L226 Difference]: Without dead ends: 117 [2021-12-21 10:15:07,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=158, Invalid=611, Unknown=15, NotChecked=406, Total=1190 [2021-12-21 10:15:07,155 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:07,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 62 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 144 Invalid, 0 Unknown, 181 Unchecked, 0.1s Time] [2021-12-21 10:15:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-21 10:15:07,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2021-12-21 10:15:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 102 states have internal predecessors, (128), 0 states have call successors, (0), 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:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2021-12-21 10:15:07,165 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 37 [2021-12-21 10:15:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:07,166 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2021-12-21 10:15:07,166 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:15:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2021-12-21 10:15:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:15:07,166 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:07,166 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:15:07,185 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:15:07,367 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:15:07,367 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:07,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:07,368 INFO L85 PathProgramCache]: Analyzing trace with hash -204568597, now seen corresponding path program 1 times [2021-12-21 10:15:07,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:07,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243912942] [2021-12-21 10:15:07,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:07,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:07,709 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:07,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:07,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243912942] [2021-12-21 10:15:07,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243912942] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:07,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675662058] [2021-12-21 10:15:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:07,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:07,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:07,711 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:15:07,711 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:15:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:07,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-21 10:15:07,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:07,848 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:07,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:07,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 25 treesize of output 24 [2021-12-21 10:15:07,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:07,947 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:15:07,977 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:08,009 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:15:08,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:08,215 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:08,217 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:08,283 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:15:08,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675662058] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:08,283 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:08,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 34 [2021-12-21 10:15:08,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607616715] [2021-12-21 10:15:08,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:08,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-21 10:15:08,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:08,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-21 10:15:08,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1024, Unknown=0, NotChecked=0, Total=1122 [2021-12-21 10:15:08,285 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 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:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:09,954 INFO L93 Difference]: Finished difference Result 211 states and 268 transitions. [2021-12-21 10:15:09,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-21 10:15:09,955 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 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:15:09,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:09,956 INFO L225 Difference]: With dead ends: 211 [2021-12-21 10:15:09,956 INFO L226 Difference]: Without dead ends: 178 [2021-12-21 10:15:09,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=534, Invalid=5016, Unknown=0, NotChecked=0, Total=5550 [2021-12-21 10:15:09,957 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 107 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:09,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 228 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 10:15:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-21 10:15:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 137. [2021-12-21 10:15:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 0 states have call successors, (0), 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:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 175 transitions. [2021-12-21 10:15:09,972 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 175 transitions. Word has length 37 [2021-12-21 10:15:09,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:09,972 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 175 transitions. [2021-12-21 10:15:09,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 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:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 175 transitions. [2021-12-21 10:15:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 10:15:09,973 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:09,973 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:15:09,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-21 10:15:10,179 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:15:10,179 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:10,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:10,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2021-12-21 10:15:10,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:10,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412302818] [2021-12-21 10:15:10,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:10,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:10,252 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:15:10,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:10,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412302818] [2021-12-21 10:15:10,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412302818] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:10,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027771750] [2021-12-21 10:15:10,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:15:10,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:10,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:10,254 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:15:10,259 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:15:10,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:15:10,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:10,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 10:15:10,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:10,416 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:15:10,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:10,482 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:15:10,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027771750] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:10,482 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:10,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-21 10:15:10,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824878864] [2021-12-21 10:15:10,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:10,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:15:10,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:10,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:15:10,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:15:10,484 INFO L87 Difference]: Start difference. First operand 137 states and 175 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:15:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:10,764 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2021-12-21 10:15:10,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 10:15:10,766 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:15:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:10,766 INFO L225 Difference]: With dead ends: 182 [2021-12-21 10:15:10,766 INFO L226 Difference]: Without dead ends: 161 [2021-12-21 10:15:10,767 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:15:10,767 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 100 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:10,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 31 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 10:15:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-21 10:15:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 105. [2021-12-21 10:15:10,780 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:15:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2021-12-21 10:15:10,780 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 39 [2021-12-21 10:15:10,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:10,780 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2021-12-21 10:15:10,781 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:15:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2021-12-21 10:15:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 10:15:10,781 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:10,781 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:15:10,801 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:15:11,001 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:15:11,001 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:11,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:11,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2021-12-21 10:15:11,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:11,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293877054] [2021-12-21 10:15:11,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:11,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:11,081 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:15:11,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:11,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293877054] [2021-12-21 10:15:11,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293877054] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:11,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846361677] [2021-12-21 10:15:11,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:15:11,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:11,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:11,083 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:15:11,084 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:15:11,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-21 10:15:11,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:11,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 10:15:11,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:11,266 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:15:11,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:11,332 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:15:11,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846361677] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:11,332 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:11,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-21 10:15:11,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167067654] [2021-12-21 10:15:11,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:11,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:15:11,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:11,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:15:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:15:11,333 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:15:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:11,487 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2021-12-21 10:15:11,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 10:15:11,487 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:15:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:11,488 INFO L225 Difference]: With dead ends: 131 [2021-12-21 10:15:11,489 INFO L226 Difference]: Without dead ends: 58 [2021-12-21 10:15:11,489 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:15:11,489 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 95 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:11,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 33 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-21 10:15:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-12-21 10:15:11,495 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:15:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2021-12-21 10:15:11,495 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 40 [2021-12-21 10:15:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:11,495 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2021-12-21 10:15:11,496 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:15:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2021-12-21 10:15:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:15:11,496 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:11,496 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:15:11,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:11,711 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:15:11,711 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:11,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2021-12-21 10:15:11,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:11,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184579099] [2021-12-21 10:15:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:11,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:12,147 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:15:12,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:12,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184579099] [2021-12-21 10:15:12,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184579099] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:12,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672880175] [2021-12-21 10:15:12,148 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 10:15:12,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:12,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:12,149 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:15:12,149 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:15:12,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 10:15:12,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:12,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-21 10:15:12,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:12,235 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:12,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:12,271 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:12,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:12,316 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:12,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:12,356 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:12,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:12,403 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:12,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:12,527 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:12,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:12,557 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:12,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:12,584 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:12,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:12,613 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:12,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:12,695 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:12,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:12,803 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:15:12,804 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 55 treesize of output 41 [2021-12-21 10:15:12,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:12,950 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:15:12,950 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:15:13,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:13,125 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-21 10:15:13,125 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 88 treesize of output 61 [2021-12-21 10:15:13,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:13,349 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-21 10:15:13,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 99 treesize of output 43 [2021-12-21 10:15:13,396 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:15:13,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:33,686 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_245| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_243| 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 ((.cse2 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |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_245| 4))))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (let ((.cse1 (+ .cse2 .cse3 .cse4 .cse5 .cse6)) (.cse0 (* c_~N~0 3))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= 3 .cse3)) (not (= 3 .cse4)) (not (= 3 .cse5)) (not (= 3 .cse6)))))))))) is different from false