./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s1if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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/s1if.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 1a3387bc5e2da462b89ff029159e07dcc81e24b9a3389e54a743d70d22e0e9eb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 21:49:35,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 21:49:35,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 21:49:35,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 21:49:35,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 21:49:35,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 21:49:35,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 21:49:35,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 21:49:35,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 21:49:35,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 21:49:35,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 21:49:35,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 21:49:35,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 21:49:35,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 21:49:35,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 21:49:35,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 21:49:35,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 21:49:35,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 21:49:35,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 21:49:35,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 21:49:35,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 21:49:35,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 21:49:35,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 21:49:35,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 21:49:35,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 21:49:35,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 21:49:35,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 21:49:35,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 21:49:35,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 21:49:35,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 21:49:35,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 21:49:35,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 21:49:35,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 21:49:35,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 21:49:35,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 21:49:35,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 21:49:35,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 21:49:35,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 21:49:35,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 21:49:35,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 21:49:35,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 21:49:35,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 21:49:35,175 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 21:49:35,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 21:49:35,176 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 21:49:35,176 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 21:49:35,177 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 21:49:35,177 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 21:49:35,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 21:49:35,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 21:49:35,178 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 21:49:35,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 21:49:35,179 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 21:49:35,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 21:49:35,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 21:49:35,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 21:49:35,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 21:49:35,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 21:49:35,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 21:49:35,180 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 21:49:35,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 21:49:35,180 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 21:49:35,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 21:49:35,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 21:49:35,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 21:49:35,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 21:49:35,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:49:35,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 21:49:35,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 21:49:35,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 21:49:35,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 21:49:35,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 21:49:35,191 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 21:49:35,191 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 21:49:35,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 21:49:35,192 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 -> 1a3387bc5e2da462b89ff029159e07dcc81e24b9a3389e54a743d70d22e0e9eb [2021-12-27 21:49:35,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:49:35,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:49:35,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:49:35,449 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:49:35,450 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:49:35,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s1if.c [2021-12-27 21:49:35,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d93bccd4/675073856dc8461999292b28cbdb8729/FLAGabd08476a [2021-12-27 21:49:35,801 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:49:35,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1if.c [2021-12-27 21:49:35,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d93bccd4/675073856dc8461999292b28cbdb8729/FLAGabd08476a [2021-12-27 21:49:36,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d93bccd4/675073856dc8461999292b28cbdb8729 [2021-12-27 21:49:36,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:49:36,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:49:36,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:49:36,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:49:36,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:49:36,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:49:36" (1/1) ... [2021-12-27 21:49:36,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fef07ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36, skipping insertion in model container [2021-12-27 21:49:36,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:49:36" (1/1) ... [2021-12-27 21:49:36,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:49:36,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:49:36,415 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/s1if.c[587,600] [2021-12-27 21:49:36,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:49:36,436 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:49:36,448 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/s1if.c[587,600] [2021-12-27 21:49:36,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:49:36,475 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:49:36,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36 WrapperNode [2021-12-27 21:49:36,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:49:36,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:49:36,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:49:36,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:49:36,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36" (1/1) ... [2021-12-27 21:49:36,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36" (1/1) ... [2021-12-27 21:49:36,544 INFO L137 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2021-12-27 21:49:36,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:49:36,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:49:36,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:49:36,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:49:36,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36" (1/1) ... [2021-12-27 21:49:36,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36" (1/1) ... [2021-12-27 21:49:36,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36" (1/1) ... [2021-12-27 21:49:36,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36" (1/1) ... [2021-12-27 21:49:36,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36" (1/1) ... [2021-12-27 21:49:36,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36" (1/1) ... [2021-12-27 21:49:36,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36" (1/1) ... [2021-12-27 21:49:36,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:49:36,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:49:36,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:49:36,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:49:36,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36" (1/1) ... [2021-12-27 21:49:36,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:49:36,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:49:36,632 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-27 21:49:36,664 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-27 21:49:36,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:49:36,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 21:49:36,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-27 21:49:36,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-27 21:49:36,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-27 21:49:36,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:49:36,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:49:36,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-27 21:49:36,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 21:49:36,754 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:49:36,755 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:49:36,871 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:49:36,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:49:36,875 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-27 21:49:36,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:49:36 BoogieIcfgContainer [2021-12-27 21:49:36,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:49:36,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:49:36,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:49:36,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:49:36,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:49:36" (1/3) ... [2021-12-27 21:49:36,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4372f81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:49:36, skipping insertion in model container [2021-12-27 21:49:36,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:36" (2/3) ... [2021-12-27 21:49:36,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4372f81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:49:36, skipping insertion in model container [2021-12-27 21:49:36,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:49:36" (3/3) ... [2021-12-27 21:49:36,881 INFO L111 eAbstractionObserver]: Analyzing ICFG s1if.c [2021-12-27 21:49:36,884 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:49:36,885 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:49:36,936 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:49:36,940 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-27 21:49:36,941 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:49:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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-27 21:49:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-27 21:49:36,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:36,955 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:36,955 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:36,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:36,972 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2021-12-27 21:49:36,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:36,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36116498] [2021-12-27 21:49:36,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:36,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:37,157 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-27 21:49:37,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:37,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36116498] [2021-12-27 21:49:37,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36116498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:49:37,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:49:37,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 21:49:37,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919861941] [2021-12-27 21:49:37,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:49:37,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 21:49:37,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:37,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 21:49:37,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 21:49:37,179 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:49:37,188 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-12-27 21:49:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 21:49:37,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-27 21:49:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:49:37,196 INFO L225 Difference]: With dead ends: 34 [2021-12-27 21:49:37,196 INFO L226 Difference]: Without dead ends: 15 [2021-12-27 21:49:37,198 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-27 21:49:37,200 INFO L933 BasicCegarLoop]: 22 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, 22 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-27 21:49:37,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:49:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-27 21:49:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-27 21:49:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-27 21:49:37,219 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-12-27 21:49:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:49:37,220 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-27 21:49:37,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-27 21:49:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-27 21:49:37,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:37,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:37,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 21:49:37,221 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2021-12-27 21:49:37,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:37,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751081711] [2021-12-27 21:49:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:37,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:37,319 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-27 21:49:37,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:37,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751081711] [2021-12-27 21:49:37,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751081711] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:49:37,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:49:37,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:49:37,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430905593] [2021-12-27 21:49:37,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:49:37,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:49:37,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:37,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:49:37,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:49:37,325 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:49:37,367 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-27 21:49:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:49:37,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-27 21:49:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:49:37,368 INFO L225 Difference]: With dead ends: 28 [2021-12-27 21:49:37,368 INFO L226 Difference]: Without dead ends: 20 [2021-12-27 21:49:37,371 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-27 21:49:37,373 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:49:37,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:49:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-27 21:49:37,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2021-12-27 21:49:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 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-27 21:49:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-27 21:49:37,382 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2021-12-27 21:49:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:49:37,383 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-27 21:49:37,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-12-27 21:49:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 21:49:37,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:37,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:37,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 21:49:37,388 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:37,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2021-12-27 21:49:37,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:37,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134654844] [2021-12-27 21:49:37,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:37,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:37,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:37,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134654844] [2021-12-27 21:49:37,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134654844] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:49:37,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819217285] [2021-12-27 21:49:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:37,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:49:37,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:49:37,687 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-27 21:49:37,687 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-27 21:49:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:37,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-27 21:49:37,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:49:37,805 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-27 21:49:37,818 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-27 21:49:37,852 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-27 21:49:37,954 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-27 21:49:38,037 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 43 treesize of output 23 [2021-12-27 21:49:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:38,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:49:38,343 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:49:38,344 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 53 treesize of output 46 [2021-12-27 21:49:38,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 21:49:38,348 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 40 treesize of output 28 [2021-12-27 21:49:38,356 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 30 treesize of output 12 [2021-12-27 21:49:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:38,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819217285] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:49:38,366 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:49:38,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2021-12-27 21:49:38,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657453152] [2021-12-27 21:49:38,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:49:38,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-27 21:49:38,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:38,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-27 21:49:38,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=269, Unknown=1, NotChecked=0, Total=342 [2021-12-27 21:49:38,371 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:38,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:49:38,492 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-12-27 21:49:38,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-27 21:49:38,493 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-27 21:49:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:49:38,494 INFO L225 Difference]: With dead ends: 36 [2021-12-27 21:49:38,494 INFO L226 Difference]: Without dead ends: 32 [2021-12-27 21:49:38,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=346, Unknown=1, NotChecked=0, Total=462 [2021-12-27 21:49:38,497 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:49:38,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 49 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2021-12-27 21:49:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-27 21:49:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2021-12-27 21:49:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2021-12-27 21:49:38,508 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2021-12-27 21:49:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:49:38,508 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-27 21:49:38,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2021-12-27 21:49:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 21:49:38,510 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:38,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:38,527 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-27 21:49:38,715 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-27 21:49:38,716 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:38,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2021-12-27 21:49:38,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:38,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336204498] [2021-12-27 21:49:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:38,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:38,729 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-27 21:49:38,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2063038465] [2021-12-27 21:49:38,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:38,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:49:38,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:49:38,730 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-27 21:49:38,732 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-27 21:49:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:38,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-27 21:49:38,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:49:38,797 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-27 21:49:38,828 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-27 21:49:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:38,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:49:38,874 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-27 21:49:38,876 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-27 21:49:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:38,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:38,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336204498] [2021-12-27 21:49:38,889 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-27 21:49:38,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063038465] [2021-12-27 21:49:38,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063038465] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:49:38,890 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:49:38,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-27 21:49:38,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295904778] [2021-12-27 21:49:38,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:49:38,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:49:38,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:38,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:49:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:49:38,892 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:49:38,938 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2021-12-27 21:49:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:49:38,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-27 21:49:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:49:38,939 INFO L225 Difference]: With dead ends: 38 [2021-12-27 21:49:38,939 INFO L226 Difference]: Without dead ends: 26 [2021-12-27 21:49:38,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:49:38,941 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:49:38,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:49:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-27 21:49:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-27 21:49:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-27 21:49:38,947 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2021-12-27 21:49:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:49:38,950 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-27 21:49:38,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-27 21:49:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-27 21:49:38,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:38,951 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:38,970 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-27 21:49:39,170 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-27 21:49:39,171 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:39,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:39,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2021-12-27 21:49:39,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:39,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574621998] [2021-12-27 21:49:39,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:39,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:39,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:39,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574621998] [2021-12-27 21:49:39,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574621998] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:49:39,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408089350] [2021-12-27 21:49:39,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 21:49:39,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:49:39,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:49:39,214 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-27 21:49:39,215 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-27 21:49:39,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 21:49:39,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:49:39,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:49:39,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:49:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:39,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:49:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:39,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408089350] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:49:39,394 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:49:39,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-27 21:49:39,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363355096] [2021-12-27 21:49:39,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:49:39,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 21:49:39,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:39,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 21:49:39,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:49:39,395 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:49:39,480 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-12-27 21:49:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:49:39,481 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-27 21:49:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:49:39,482 INFO L225 Difference]: With dead ends: 33 [2021-12-27 21:49:39,482 INFO L226 Difference]: Without dead ends: 29 [2021-12-27 21:49:39,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 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-27 21:49:39,482 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:49:39,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 25 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:49:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-27 21:49:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2021-12-27 21:49:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-27 21:49:39,486 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2021-12-27 21:49:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:49:39,486 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-27 21:49:39,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-12-27 21:49:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-27 21:49:39,486 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:39,487 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:39,505 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-27 21:49:39,695 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-27 21:49:39,695 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2021-12-27 21:49:39,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:39,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970836001] [2021-12-27 21:49:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:39,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:39,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:39,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970836001] [2021-12-27 21:49:39,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970836001] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:49:39,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030518187] [2021-12-27 21:49:39,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-27 21:49:39,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:49:39,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:49:39,734 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-27 21:49:39,735 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-27 21:49:39,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-27 21:49:39,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:49:39,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:49:39,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:49:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:39,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:49:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:39,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030518187] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:49:39,886 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:49:39,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-27 21:49:39,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269564225] [2021-12-27 21:49:39,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:49:39,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 21:49:39,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:39,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 21:49:39,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:49:39,888 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:49:39,935 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-12-27 21:49:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:49:39,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-27 21:49:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:49:39,936 INFO L225 Difference]: With dead ends: 37 [2021-12-27 21:49:39,936 INFO L226 Difference]: Without dead ends: 25 [2021-12-27 21:49:39,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 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-27 21:49:39,937 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:49:39,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 26 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:49:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-27 21:49:39,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-27 21:49:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 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-27 21:49:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-27 21:49:39,940 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2021-12-27 21:49:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:49:39,940 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-27 21:49:39,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-27 21:49:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-27 21:49:39,941 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:39,941 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:39,959 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-27 21:49:40,147 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-27 21:49:40,147 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:40,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2021-12-27 21:49:40,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:40,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695457970] [2021-12-27 21:49:40,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:40,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:40,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:40,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695457970] [2021-12-27 21:49:40,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695457970] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:49:40,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548568627] [2021-12-27 21:49:40,364 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-27 21:49:40,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:49:40,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:49:40,367 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-27 21:49:40,368 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-27 21:49:40,404 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-27 21:49:40,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:49:40,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-27 21:49:40,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:49:40,425 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-27 21:49:40,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:49:40,449 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-27 21:49:40,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:49:40,484 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-27 21:49:40,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:49:40,607 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-27 21:49:40,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:49:40,700 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:49:40,700 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 57 treesize of output 43 [2021-12-27 21:49:40,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:49:40,826 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:49:40,826 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 62 treesize of output 30 [2021-12-27 21:49:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:40,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:49:45,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_152 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4))))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |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_44| 4))))) (or (not (= .cse0 1)) (let ((.cse2 (+ .cse3 .cse0 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= .cse4 1)))))))) is different from false [2021-12-27 21:49:45,633 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_152 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4))))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |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_44| 4))))) (or (let ((.cse1 (+ .cse2 .cse3 .cse4)) (.cse0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse3 1)) (not (= .cse4 1)))))))) is different from false [2021-12-27 21:49:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-27 21:49:45,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548568627] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:49:45,711 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:49:45,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2021-12-27 21:49:45,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150416280] [2021-12-27 21:49:45,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:49:45,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-27 21:49:45,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:45,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-27 21:49:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=762, Unknown=4, NotChecked=114, Total=992 [2021-12-27 21:49:45,713 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 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-27 21:49:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:49:45,911 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-12-27 21:49:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-27 21:49:45,912 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 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-27 21:49:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:49:45,912 INFO L225 Difference]: With dead ends: 36 [2021-12-27 21:49:45,912 INFO L226 Difference]: Without dead ends: 32 [2021-12-27 21:49:45,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=163, Invalid=963, Unknown=4, NotChecked=130, Total=1260 [2021-12-27 21:49:45,913 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:49:45,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 156 Unchecked, 0.1s Time] [2021-12-27 21:49:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-27 21:49:45,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-12-27 21:49:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-12-27 21:49:45,917 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2021-12-27 21:49:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:49:45,917 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-12-27 21:49:45,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 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-27 21:49:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-12-27 21:49:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-27 21:49:45,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:45,918 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:45,936 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-27 21:49:46,123 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-27 21:49:46,124 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:46,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:46,124 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2021-12-27 21:49:46,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:46,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642600920] [2021-12-27 21:49:46,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:46,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:46,132 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-27 21:49:46,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [861885136] [2021-12-27 21:49:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:46,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:49:46,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:49:46,142 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-27 21:49:46,151 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-27 21:49:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:46,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-27 21:49:46,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:49:46,236 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-27 21:49:46,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:49:46,289 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 16 treesize of output 18 [2021-12-27 21:49:46,315 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-27 21:49:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:46,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:49:46,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_189) |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-27 21:49:46,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1)) is different from false [2021-12-27 21:49:46,379 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:49:46,379 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 24 treesize of output 25 [2021-12-27 21:49:46,383 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:49:46,384 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 38 treesize of output 38 [2021-12-27 21:49:46,386 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 11 treesize of output 7 [2021-12-27 21:49:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-27 21:49:46,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:46,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642600920] [2021-12-27 21:49:46,427 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-27 21:49:46,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861885136] [2021-12-27 21:49:46,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861885136] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:49:46,427 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:49:46,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-27 21:49:46,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445868172] [2021-12-27 21:49:46,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:49:46,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-27 21:49:46,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:46,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-27 21:49:46,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2021-12-27 21:49:46,428 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-27 21:49:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:49:46,588 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-12-27 21:49:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-27 21:49:46,589 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-27 21:49:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:49:46,590 INFO L225 Difference]: With dead ends: 41 [2021-12-27 21:49:46,590 INFO L226 Difference]: Without dead ends: 34 [2021-12-27 21:49:46,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=238, Unknown=2, NotChecked=66, Total=380 [2021-12-27 21:49:46,590 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:49:46,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 52 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 109 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2021-12-27 21:49:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-27 21:49:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-27 21:49:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 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-27 21:49:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-12-27 21:49:46,603 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2021-12-27 21:49:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:49:46,603 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-12-27 21:49:46,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-27 21:49:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-12-27 21:49:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-27 21:49:46,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:46,604 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:46,622 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-27 21:49:46,804 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-27 21:49:46,804 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:46,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:46,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2021-12-27 21:49:46,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:46,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777912760] [2021-12-27 21:49:46,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:46,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:46,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:46,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777912760] [2021-12-27 21:49:46,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777912760] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:49:46,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200904550] [2021-12-27 21:49:46,859 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-27 21:49:46,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:49:46,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:49:46,863 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-27 21:49:46,865 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-27 21:49:46,908 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-27 21:49:46,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:49:46,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-27 21:49:46,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:49:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:46,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:49:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:47,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200904550] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:49:47,027 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:49:47,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-27 21:49:47,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835531517] [2021-12-27 21:49:47,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:49:47,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-27 21:49:47,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:47,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-27 21:49:47,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-27 21:49:47,028 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 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-27 21:49:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:49:47,148 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-12-27 21:49:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 21:49:47,149 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 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-27 21:49:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:49:47,149 INFO L225 Difference]: With dead ends: 41 [2021-12-27 21:49:47,149 INFO L226 Difference]: Without dead ends: 37 [2021-12-27 21:49:47,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 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-27 21:49:47,150 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 42 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:49:47,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 22 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:49:47,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-27 21:49:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2021-12-27 21:49:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-27 21:49:47,153 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2021-12-27 21:49:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:49:47,153 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-27 21:49:47,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 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-27 21:49:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-12-27 21:49:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-27 21:49:47,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:47,153 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:47,171 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-27 21:49:47,355 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-27 21:49:47,355 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:47,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:47,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 6 times [2021-12-27 21:49:47,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:47,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65217664] [2021-12-27 21:49:47,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:47,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:47,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:47,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65217664] [2021-12-27 21:49:47,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65217664] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:49:47,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373404035] [2021-12-27 21:49:47,406 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-27 21:49:47,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:49:47,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:49:47,407 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-27 21:49:47,408 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-27 21:49:47,457 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-27 21:49:47,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:49:47,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-27 21:49:47,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:49:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:47,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:49:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:47,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373404035] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:49:47,576 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:49:47,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-27 21:49:47,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743239223] [2021-12-27 21:49:47,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:49:47,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-27 21:49:47,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:47,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-27 21:49:47,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-27 21:49:47,581 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:49:47,662 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2021-12-27 21:49:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-27 21:49:47,662 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-27 21:49:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:49:47,662 INFO L225 Difference]: With dead ends: 45 [2021-12-27 21:49:47,663 INFO L226 Difference]: Without dead ends: 30 [2021-12-27 21:49:47,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 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-27 21:49:47,663 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:49:47,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 28 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:49:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-27 21:49:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-12-27 21:49:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-12-27 21:49:47,667 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2021-12-27 21:49:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:49:47,667 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-12-27 21:49:47,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-12-27 21:49:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-27 21:49:47,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:47,668 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:47,689 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-27 21:49:47,883 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-27 21:49:47,884 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:47,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 7 times [2021-12-27 21:49:47,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:47,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297775287] [2021-12-27 21:49:47,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:47,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:48,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:48,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297775287] [2021-12-27 21:49:48,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297775287] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:49:48,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656434697] [2021-12-27 21:49:48,209 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-27 21:49:48,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:49:48,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:49:48,210 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-27 21:49:48,211 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-27 21:49:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:48,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-27 21:49:48,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:49:48,275 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-27 21:49:48,278 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-27 21:49:48,287 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-27 21:49:48,302 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-27 21:49:48,319 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-27 21:49:48,458 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-27 21:49:48,559 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:49:48,559 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 57 treesize of output 43 [2021-12-27 21:49:48,664 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:49:48,664 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-27 21:49:48,815 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:49:48,816 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 66 treesize of output 30 [2021-12-27 21:49:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:48,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:49:57,576 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 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| (+ .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |ULTIMATE.start_main_~a~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| (+ .cse4 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (+ .cse1 .cse4 .cse5 .cse0))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= .cse4 1))))))))) is different from false [2021-12-27 21:49:57,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 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| (+ .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |ULTIMATE.start_main_~a~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| (+ .cse4 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (let ((.cse3 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (+ .cse1 .cse4 .cse5 .cse0))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= .cse4 1))))))))) is different from false [2021-12-27 21:49:58,293 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 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| (+ .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |ULTIMATE.start_main_~a~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| (+ .cse2 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (not (= .cse2 1)) (let ((.cse4 (+ .cse1 .cse2 .cse5 .cse0)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= .cse3 .cse4) (<= .cse4 .cse3)))))))))) is different from false [2021-12-27 21:49:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-27 21:49:58,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656434697] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:49:58,542 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:49:58,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 39 [2021-12-27 21:49:58,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373276435] [2021-12-27 21:49:58,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:49:58,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-27 21:49:58,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:58,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-27 21:49:58,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1128, Unknown=8, NotChecked=210, Total=1482 [2021-12-27 21:49:58,544 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 39 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 39 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:49:58,740 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-12-27 21:49:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-27 21:49:58,740 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 39 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-27 21:49:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:49:58,741 INFO L225 Difference]: With dead ends: 44 [2021-12-27 21:49:58,741 INFO L226 Difference]: Without dead ends: 40 [2021-12-27 21:49:58,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=185, Invalid=1379, Unknown=8, NotChecked=234, Total=1806 [2021-12-27 21:49:58,742 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:49:58,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 163 Unchecked, 0.1s Time] [2021-12-27 21:49:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-27 21:49:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2021-12-27 21:49:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-12-27 21:49:58,753 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2021-12-27 21:49:58,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:49:58,754 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-27 21:49:58,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 39 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-12-27 21:49:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-27 21:49:58,758 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:58,758 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:58,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-27 21:49:58,974 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-27 21:49:58,974 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:58,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:58,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2021-12-27 21:49:58,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:58,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508767513] [2021-12-27 21:49:58,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:58,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:58,989 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-27 21:49:58,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053550241] [2021-12-27 21:49:58,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 21:49:58,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:49:58,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:49:58,996 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-27 21:49:59,012 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-27 21:49:59,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 21:49:59,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:49:59,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-27 21:49:59,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:49:59,057 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-27 21:49:59,090 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 13 treesize of output 9 [2021-12-27 21:49:59,136 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 16 treesize of output 18 [2021-12-27 21:49:59,162 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 16 treesize of output 18 [2021-12-27 21:49:59,185 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-27 21:49:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:59,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:49:59,229 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |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-27 21:49:59,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) is different from false [2021-12-27 21:49:59,245 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) is different from false [2021-12-27 21:49:59,254 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:49:59,254 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 24 treesize of output 25 [2021-12-27 21:49:59,259 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:49:59,259 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 38 treesize of output 38 [2021-12-27 21:49:59,262 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 11 treesize of output 7 [2021-12-27 21:49:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-27 21:49:59,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:59,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508767513] [2021-12-27 21:49:59,301 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-27 21:49:59,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053550241] [2021-12-27 21:49:59,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053550241] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:49:59,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:49:59,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-12-27 21:49:59,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359774965] [2021-12-27 21:49:59,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:49:59,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-27 21:49:59,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:59,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-27 21:49:59,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=128, Unknown=3, NotChecked=72, Total=240 [2021-12-27 21:49:59,303 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:49:59,466 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-12-27 21:49:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-27 21:49:59,467 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-27 21:49:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:49:59,467 INFO L225 Difference]: With dead ends: 49 [2021-12-27 21:49:59,467 INFO L226 Difference]: Without dead ends: 42 [2021-12-27 21:49:59,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=276, Unknown=3, NotChecked=108, Total=462 [2021-12-27 21:49:59,468 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:49:59,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 167 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2021-12-27 21:49:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-27 21:49:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-27 21:49:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 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-27 21:49:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-12-27 21:49:59,472 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2021-12-27 21:49:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:49:59,472 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-12-27 21:49:59,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:49:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-12-27 21:49:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-27 21:49:59,473 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:49:59,473 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:49:59,491 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-27 21:49:59,683 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-27 21:49:59,683 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:49:59,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:49:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 8 times [2021-12-27 21:49:59,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:49:59,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100448808] [2021-12-27 21:49:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:49:59,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:49:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:49:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:59,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:49:59,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100448808] [2021-12-27 21:49:59,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100448808] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:49:59,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549765518] [2021-12-27 21:49:59,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 21:49:59,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:49:59,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:49:59,755 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-27 21:49:59,756 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-27 21:49:59,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 21:49:59,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:49:59,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-27 21:49:59,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:49:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:59,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:49:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:49:59,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549765518] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:49:59,952 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:49:59,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-27 21:49:59,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277415404] [2021-12-27 21:49:59,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:49:59,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-27 21:49:59,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:49:59,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-27 21:49:59,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:49:59,953 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 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-27 21:50:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:50:00,197 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-12-27 21:50:00,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-27 21:50:00,198 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 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 28 [2021-12-27 21:50:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:50:00,198 INFO L225 Difference]: With dead ends: 49 [2021-12-27 21:50:00,198 INFO L226 Difference]: Without dead ends: 45 [2021-12-27 21:50:00,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 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-27 21:50:00,199 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:50:00,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 36 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:50:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-27 21:50:00,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2021-12-27 21:50:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 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-27 21:50:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-12-27 21:50:00,204 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2021-12-27 21:50:00,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:50:00,204 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-27 21:50:00,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 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-27 21:50:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-12-27 21:50:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-27 21:50:00,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:00,205 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:00,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-27 21:50:00,405 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-27 21:50:00,405 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:00,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838205, now seen corresponding path program 9 times [2021-12-27 21:50:00,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:00,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466691377] [2021-12-27 21:50:00,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:00,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:00,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:00,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466691377] [2021-12-27 21:50:00,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466691377] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:50:00,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721456675] [2021-12-27 21:50:00,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-27 21:50:00,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:00,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:50:00,490 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-27 21:50:00,491 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-27 21:50:00,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-27 21:50:00,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:50:00,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-27 21:50:00,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:50:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:00,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:50:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:00,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721456675] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:50:00,706 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:50:00,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-27 21:50:00,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516465558] [2021-12-27 21:50:00,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:50:00,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-27 21:50:00,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:50:00,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-27 21:50:00,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:50:00,707 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 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-27 21:50:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:50:00,792 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2021-12-27 21:50:00,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-27 21:50:00,793 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 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-27 21:50:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:50:00,793 INFO L225 Difference]: With dead ends: 53 [2021-12-27 21:50:00,793 INFO L226 Difference]: Without dead ends: 35 [2021-12-27 21:50:00,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 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-27 21:50:00,794 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:50:00,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 33 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:50:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-27 21:50:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2021-12-27 21:50:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:50:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-12-27 21:50:00,798 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2021-12-27 21:50:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:50:00,798 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-12-27 21:50:00,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 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-27 21:50:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-12-27 21:50:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-27 21:50:00,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:00,799 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:00,825 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-27 21:50:01,025 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-27 21:50:01,025 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:01,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 10 times [2021-12-27 21:50:01,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:01,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860015100] [2021-12-27 21:50:01,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:01,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:01,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:01,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860015100] [2021-12-27 21:50:01,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860015100] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:50:01,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168749978] [2021-12-27 21:50:01,467 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-27 21:50:01,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:01,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:50:01,468 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-27 21:50:01,468 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-27 21:50:01,517 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-27 21:50:01,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:50:01,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-27 21:50:01,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:50:01,535 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-27 21:50:01,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:01,570 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-27 21:50:01,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:01,609 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-27 21:50:01,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:01,647 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-27 21:50:01,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:01,700 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-27 21:50:01,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:01,871 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-27 21:50:01,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:01,983 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:50:01,983 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 67 treesize of output 45 [2021-12-27 21:50:02,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:02,148 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:50:02,148 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-27 21:50:02,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:02,296 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:50:02,296 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-27 21:50:02,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:02,452 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:50:02,453 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 54 treesize of output 26 [2021-12-27 21:50:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:02,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:50:26,604 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse0 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (not (= .cse2 1)) (not (= .cse3 1)) (let ((.cse5 (+ .cse6 .cse0 .cse1 .cse2 .cse3)) (.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))))))))))) is different from false [2021-12-27 21:50:27,784 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 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| (+ .cse4 .cse0 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (let ((.cse3 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (+ .cse4 .cse0 .cse1 .cse5 .cse6))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= .cse5 1)) (not (= .cse6 1)))))))))) is different from false [2021-12-27 21:50:30,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 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 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 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|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse3 1)) (not (= .cse4 1)) (not (= .cse5 1)) (not (= .cse6 1)))))))))) is different from false [2021-12-27 21:50:32,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 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| (+ .cse3 .cse0 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 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| (+ .cse3 .cse0 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (not (= .cse0 1)) (let ((.cse2 (+ .cse3 .cse0 .cse4 .cse5 .cse6)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 4))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= .cse4 1)) (not (= .cse5 1)) (not (= .cse6 1)))))))))) is different from false [2021-12-27 21:50:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2021-12-27 21:50:34,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168749978] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:50:34,432 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:50:34,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2021-12-27 21:50:34,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619347468] [2021-12-27 21:50:34,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:50:34,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-27 21:50:34,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:50:34,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-27 21:50:34,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2080, Unknown=12, NotChecked=380, Total=2652 [2021-12-27 21:50:34,433 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 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-27 21:50:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:50:34,941 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-12-27 21:50:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-27 21:50:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 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-27 21:50:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:50:34,942 INFO L225 Difference]: With dead ends: 53 [2021-12-27 21:50:34,942 INFO L226 Difference]: Without dead ends: 49 [2021-12-27 21:50:34,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=231, Invalid=2425, Unknown=12, NotChecked=412, Total=3080 [2021-12-27 21:50:34,945 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:50:34,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 241 Invalid, 0 Unknown, 320 Unchecked, 0.1s Time] [2021-12-27 21:50:34,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-27 21:50:34,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2021-12-27 21:50:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 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-27 21:50:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-12-27 21:50:34,957 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2021-12-27 21:50:34,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:50:34,958 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-12-27 21:50:34,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 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-27 21:50:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-12-27 21:50:34,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-27 21:50:34,959 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:34,959 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:34,975 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-27 21:50:35,167 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-27 21:50:35,167 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:35,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 3 times [2021-12-27 21:50:35,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:35,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178647240] [2021-12-27 21:50:35,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:35,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:35,176 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-27 21:50:35,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929574351] [2021-12-27 21:50:35,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-27 21:50:35,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:35,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:50:35,178 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-27 21:50:35,179 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-27 21:50:35,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-27 21:50:35,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:50:35,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-27 21:50:35,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:50:35,255 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-27 21:50:35,272 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 15 treesize of output 11 [2021-12-27 21:50:35,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 18 treesize of output 20 [2021-12-27 21:50:35,367 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-27 21:50:35,397 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-27 21:50:35,426 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:50:35,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 23 treesize of output 23 [2021-12-27 21:50:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-27 21:50:35,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:50:35,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_547 (Array Int Int))) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) is different from false [2021-12-27 21:50:35,684 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:50:35,684 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 26 treesize of output 27 [2021-12-27 21:50:35,690 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2021-12-27 21:50:35,690 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-27 21:50:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2021-12-27 21:50:35,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:35,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178647240] [2021-12-27 21:50:35,707 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-27 21:50:35,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929574351] [2021-12-27 21:50:35,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929574351] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:50:35,707 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:50:35,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-12-27 21:50:35,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138150836] [2021-12-27 21:50:35,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:50:35,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-27 21:50:35,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:50:35,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-27 21:50:35,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=129, Unknown=6, NotChecked=24, Total=210 [2021-12-27 21:50:35,708 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:50:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:50:38,162 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2021-12-27 21:50:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:50:38,163 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-27 21:50:38,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:50:38,163 INFO L225 Difference]: With dead ends: 55 [2021-12-27 21:50:38,163 INFO L226 Difference]: Without dead ends: 51 [2021-12-27 21:50:38,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=73, Invalid=165, Unknown=6, NotChecked=28, Total=272 [2021-12-27 21:50:38,164 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:50:38,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 61 Unchecked, 0.0s Time] [2021-12-27 21:50:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-27 21:50:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-27 21:50:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:50:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-12-27 21:50:38,171 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2021-12-27 21:50:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:50:38,171 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-12-27 21:50:38,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:50:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-12-27 21:50:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-27 21:50:38,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:38,172 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:38,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-27 21:50:38,377 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-27 21:50:38,377 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:38,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 11 times [2021-12-27 21:50:38,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:38,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603599113] [2021-12-27 21:50:38,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:38,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:38,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:38,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603599113] [2021-12-27 21:50:38,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603599113] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:50:38,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349030380] [2021-12-27 21:50:38,488 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-27 21:50:38,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:38,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:50:38,489 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-27 21:50:38,507 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-27 21:50:38,584 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-27 21:50:38,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:50:38,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-27 21:50:38,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:50:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:38,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:50:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:38,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349030380] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:50:38,778 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:50:38,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-27 21:50:38,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118326923] [2021-12-27 21:50:38,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:50:38,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-27 21:50:38,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:50:38,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-27 21:50:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-27 21:50:38,779 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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-27 21:50:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:50:39,007 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2021-12-27 21:50:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-27 21:50:39,009 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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 33 [2021-12-27 21:50:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:50:39,009 INFO L225 Difference]: With dead ends: 69 [2021-12-27 21:50:39,009 INFO L226 Difference]: Without dead ends: 65 [2021-12-27 21:50:39,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2021-12-27 21:50:39,010 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 61 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:50:39,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 34 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:50:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-27 21:50:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2021-12-27 21:50:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 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-27 21:50:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-12-27 21:50:39,015 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2021-12-27 21:50:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:50:39,015 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-27 21:50:39,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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-27 21:50:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2021-12-27 21:50:39,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-27 21:50:39,015 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:39,015 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:39,035 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-27 21:50:39,227 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-27 21:50:39,227 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 12 times [2021-12-27 21:50:39,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:39,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080628330] [2021-12-27 21:50:39,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:39,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:39,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:39,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080628330] [2021-12-27 21:50:39,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080628330] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:50:39,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470402908] [2021-12-27 21:50:39,322 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-27 21:50:39,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:39,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:50:39,323 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-27 21:50:39,328 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-27 21:50:39,394 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-27 21:50:39,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:50:39,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-27 21:50:39,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:50:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:39,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:50:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:39,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470402908] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:50:39,588 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:50:39,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-27 21:50:39,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180384434] [2021-12-27 21:50:39,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:50:39,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-27 21:50:39,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:50:39,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-27 21:50:39,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-27 21:50:39,589 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 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-27 21:50:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:50:39,712 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2021-12-27 21:50:39,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-27 21:50:39,713 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 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 34 [2021-12-27 21:50:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:50:39,713 INFO L225 Difference]: With dead ends: 78 [2021-12-27 21:50:39,713 INFO L226 Difference]: Without dead ends: 50 [2021-12-27 21:50:39,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-12-27 21:50:39,714 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:50:39,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 26 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:50:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-27 21:50:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2021-12-27 21:50:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 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-27 21:50:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2021-12-27 21:50:39,718 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 34 [2021-12-27 21:50:39,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:50:39,719 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-12-27 21:50:39,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 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-27 21:50:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2021-12-27 21:50:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-27 21:50:39,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:39,719 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:39,735 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-27 21:50:39,919 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-27 21:50:39,920 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 13 times [2021-12-27 21:50:39,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:39,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450491814] [2021-12-27 21:50:39,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:39,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:40,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:40,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450491814] [2021-12-27 21:50:40,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450491814] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:50:40,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75590704] [2021-12-27 21:50:40,546 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-27 21:50:40,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:40,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:50:40,547 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-27 21:50:40,548 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-27 21:50:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:40,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-27 21:50:40,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:50:40,630 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-27 21:50:40,632 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-27 21:50:40,639 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-27 21:50:40,654 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-27 21:50:40,668 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-27 21:50:40,684 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-27 21:50:40,702 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-27 21:50:40,873 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-27 21:50:41,005 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:50:41,006 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-27 21:50:41,148 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:50:41,148 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-27 21:50:41,320 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-27 21:50:41,320 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-27 21:50:41,468 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:50:41,468 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-27 21:50:41,598 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:50:41,599 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 56 treesize of output 28 [2021-12-27 21:50:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:41,655 INFO L328 TraceCheckSpWp]: Computing backward predicates...