/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/loops/eureka_05.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 04:17:24,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 04:17:24,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 04:17:24,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 04:17:24,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 04:17:24,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 04:17:24,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 04:17:24,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 04:17:24,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 04:17:24,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 04:17:24,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 04:17:24,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 04:17:24,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 04:17:24,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 04:17:24,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 04:17:24,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 04:17:24,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 04:17:24,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 04:17:24,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 04:17:24,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 04:17:24,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 04:17:24,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 04:17:24,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 04:17:24,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 04:17:24,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 04:17:24,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 04:17:24,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 04:17:24,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 04:17:24,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 04:17:24,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 04:17:24,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 04:17:24,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 04:17:24,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 04:17:24,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 04:17:24,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 04:17:24,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 04:17:24,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 04:17:24,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 04:17:24,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 04:17:24,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 04:17:24,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 04:17:24,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 04:17:24,134 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 04:17:24,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 04:17:24,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 04:17:24,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 04:17:24,137 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 04:17:24,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 04:17:24,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 04:17:24,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 04:17:24,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 04:17:24,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 04:17:24,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 04:17:24,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 04:17:24,139 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 04:17:24,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 04:17:24,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 04:17:24,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 04:17:24,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 04:17:24,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 04:17:24,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 04:17:24,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 04:17:24,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 04:17:24,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 04:17:24,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 04:17:24,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 04:17:24,142 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 04:17:24,142 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 [2020-12-22 04:17:24,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 04:17:24,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 04:17:24,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 04:17:24,600 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 04:17:24,602 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 04:17:24,603 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_05.i [2020-12-22 04:17:24,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08f9a5c02/a9dcd24fbb1043a98fa7ca7447953b9c/FLAG2c53731bd [2020-12-22 04:17:25,289 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 04:17:25,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i [2020-12-22 04:17:25,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08f9a5c02/a9dcd24fbb1043a98fa7ca7447953b9c/FLAG2c53731bd [2020-12-22 04:17:25,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08f9a5c02/a9dcd24fbb1043a98fa7ca7447953b9c [2020-12-22 04:17:25,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 04:17:25,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 04:17:25,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 04:17:25,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 04:17:25,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 04:17:25,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:17:25" (1/1) ... [2020-12-22 04:17:25,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ee4ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25, skipping insertion in model container [2020-12-22 04:17:25,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:17:25" (1/1) ... [2020-12-22 04:17:25,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 04:17:25,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 04:17:25,852 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i[810,823] [2020-12-22 04:17:25,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 04:17:25,883 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 04:17:25,901 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i[810,823] [2020-12-22 04:17:25,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 04:17:25,950 INFO L208 MainTranslator]: Completed translation [2020-12-22 04:17:25,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25 WrapperNode [2020-12-22 04:17:25,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 04:17:25,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 04:17:25,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 04:17:25,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 04:17:25,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25" (1/1) ... [2020-12-22 04:17:25,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25" (1/1) ... [2020-12-22 04:17:25,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 04:17:25,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 04:17:25,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 04:17:25,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 04:17:26,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25" (1/1) ... [2020-12-22 04:17:26,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25" (1/1) ... [2020-12-22 04:17:26,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25" (1/1) ... [2020-12-22 04:17:26,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25" (1/1) ... [2020-12-22 04:17:26,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25" (1/1) ... [2020-12-22 04:17:26,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25" (1/1) ... [2020-12-22 04:17:26,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25" (1/1) ... [2020-12-22 04:17:26,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 04:17:26,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 04:17:26,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 04:17:26,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 04:17:26,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 04:17:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 04:17:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 04:17:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 04:17:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 04:17:26,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 04:17:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-22 04:17:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 04:17:26,385 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 04:17:26,386 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2020-12-22 04:17:26,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:17:26 BoogieIcfgContainer [2020-12-22 04:17:26,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 04:17:26,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 04:17:26,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 04:17:26,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 04:17:26,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:17:25" (1/3) ... [2020-12-22 04:17:26,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f68425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:17:26, skipping insertion in model container [2020-12-22 04:17:26,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:17:25" (2/3) ... [2020-12-22 04:17:26,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f68425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:17:26, skipping insertion in model container [2020-12-22 04:17:26,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:17:26" (3/3) ... [2020-12-22 04:17:26,397 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2020-12-22 04:17:26,404 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 04:17:26,410 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-22 04:17:26,435 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-22 04:17:26,521 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 04:17:26,521 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 04:17:26,521 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 04:17:26,521 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 04:17:26,522 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 04:17:26,522 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 04:17:26,522 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 04:17:26,522 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 04:17:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-12-22 04:17:26,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-22 04:17:26,541 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:26,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:26,542 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:26,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:26,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2015864939, now seen corresponding path program 1 times [2020-12-22 04:17:26,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:26,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674220547] [2020-12-22 04:17:26,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:17:26,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674220547] [2020-12-22 04:17:26,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:17:26,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 04:17:26,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761079249] [2020-12-22 04:17:26,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 04:17:26,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:26,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 04:17:26,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 04:17:26,758 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-12-22 04:17:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:17:26,797 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2020-12-22 04:17:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 04:17:26,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-22 04:17:26,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:17:26,808 INFO L225 Difference]: With dead ends: 42 [2020-12-22 04:17:26,808 INFO L226 Difference]: Without dead ends: 20 [2020-12-22 04:17:26,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 04:17:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-22 04:17:26,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-12-22 04:17:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-22 04:17:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-12-22 04:17:26,847 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2020-12-22 04:17:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:17:26,848 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-12-22 04:17:26,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 04:17:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2020-12-22 04:17:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 04:17:26,849 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:26,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:26,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 04:17:26,850 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:26,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1565230291, now seen corresponding path program 1 times [2020-12-22 04:17:26,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:26,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922910731] [2020-12-22 04:17:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:17:26,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922910731] [2020-12-22 04:17:26,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522444751] [2020-12-22 04:17:26,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:26,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-22 04:17:26,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:17:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:17:27,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:17:27,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-22 04:17:27,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72086887] [2020-12-22 04:17:27,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 04:17:27,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:27,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 04:17:27,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 04:17:27,033 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2020-12-22 04:17:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:17:27,062 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-12-22 04:17:27,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 04:17:27,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-22 04:17:27,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:17:27,063 INFO L225 Difference]: With dead ends: 36 [2020-12-22 04:17:27,063 INFO L226 Difference]: Without dead ends: 22 [2020-12-22 04:17:27,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 04:17:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-12-22 04:17:27,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-12-22 04:17:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-12-22 04:17:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-12-22 04:17:27,069 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2020-12-22 04:17:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:17:27,070 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-12-22 04:17:27,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 04:17:27,070 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-12-22 04:17:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-22 04:17:27,071 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:27,071 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:27,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-22 04:17:27,286 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:27,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:27,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1566025071, now seen corresponding path program 2 times [2020-12-22 04:17:27,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:27,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4058198] [2020-12-22 04:17:27,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 04:17:27,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4058198] [2020-12-22 04:17:27,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:17:27,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 04:17:27,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831850664] [2020-12-22 04:17:27,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 04:17:27,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:27,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 04:17:27,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 04:17:27,382 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2020-12-22 04:17:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:17:27,432 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-12-22 04:17:27,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 04:17:27,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-22 04:17:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:17:27,434 INFO L225 Difference]: With dead ends: 34 [2020-12-22 04:17:27,434 INFO L226 Difference]: Without dead ends: 27 [2020-12-22 04:17:27,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 04:17:27,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-22 04:17:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2020-12-22 04:17:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-12-22 04:17:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-12-22 04:17:27,440 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2020-12-22 04:17:27,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:17:27,441 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-12-22 04:17:27,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 04:17:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-12-22 04:17:27,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 04:17:27,442 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:27,442 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:27,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 04:17:27,443 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:27,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:27,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2104278057, now seen corresponding path program 1 times [2020-12-22 04:17:27,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:27,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061253862] [2020-12-22 04:17:27,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 04:17:27,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061253862] [2020-12-22 04:17:27,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:17:27,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 04:17:27,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395173221] [2020-12-22 04:17:27,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:17:27,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:27,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:17:27,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:17:27,528 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2020-12-22 04:17:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:17:27,586 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-12-22 04:17:27,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 04:17:27,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-22 04:17:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:17:27,588 INFO L225 Difference]: With dead ends: 43 [2020-12-22 04:17:27,588 INFO L226 Difference]: Without dead ends: 30 [2020-12-22 04:17:27,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-22 04:17:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-22 04:17:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2020-12-22 04:17:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-12-22 04:17:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-12-22 04:17:27,595 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17 [2020-12-22 04:17:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:17:27,596 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-12-22 04:17:27,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:17:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-12-22 04:17:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 04:17:27,597 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:27,597 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:27,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 04:17:27,598 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:27,599 INFO L82 PathProgramCache]: Analyzing trace with hash -913507013, now seen corresponding path program 1 times [2020-12-22 04:17:27,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:27,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137284652] [2020-12-22 04:17:27,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 04:17:27,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137284652] [2020-12-22 04:17:27,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857556951] [2020-12-22 04:17:27,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:27,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-22 04:17:27,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:17:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-22 04:17:27,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:17:27,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2020-12-22 04:17:27,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523289230] [2020-12-22 04:17:27,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 04:17:27,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:27,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 04:17:27,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-22 04:17:27,789 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 8 states. [2020-12-22 04:17:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:17:27,959 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2020-12-22 04:17:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 04:17:27,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-22 04:17:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:17:27,962 INFO L225 Difference]: With dead ends: 53 [2020-12-22 04:17:27,962 INFO L226 Difference]: Without dead ends: 37 [2020-12-22 04:17:27,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-12-22 04:17:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-22 04:17:27,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-12-22 04:17:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-12-22 04:17:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-12-22 04:17:27,983 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2020-12-22 04:17:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:17:27,984 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-12-22 04:17:27,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 04:17:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-12-22 04:17:27,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 04:17:27,987 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:27,987 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:28,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:28,201 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:28,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:28,203 INFO L82 PathProgramCache]: Analyzing trace with hash 34400469, now seen corresponding path program 2 times [2020-12-22 04:17:28,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:28,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468247472] [2020-12-22 04:17:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-22 04:17:28,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468247472] [2020-12-22 04:17:28,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360743429] [2020-12-22 04:17:28,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:28,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 04:17:28,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:17:28,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-22 04:17:28,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:17:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 04:17:28,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:17:28,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-12-22 04:17:28,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696969681] [2020-12-22 04:17:28,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 04:17:28,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:28,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 04:17:28,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-22 04:17:28,427 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 10 states. [2020-12-22 04:17:28,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:17:28,583 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2020-12-22 04:17:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 04:17:28,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-12-22 04:17:28,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:17:28,585 INFO L225 Difference]: With dead ends: 66 [2020-12-22 04:17:28,585 INFO L226 Difference]: Without dead ends: 44 [2020-12-22 04:17:28,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2020-12-22 04:17:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-12-22 04:17:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2020-12-22 04:17:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-22 04:17:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2020-12-22 04:17:28,591 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2020-12-22 04:17:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:17:28,592 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2020-12-22 04:17:28,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 04:17:28,592 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-12-22 04:17:28,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-22 04:17:28,593 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:28,593 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:28,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:28,808 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:28,810 INFO L82 PathProgramCache]: Analyzing trace with hash 593601357, now seen corresponding path program 3 times [2020-12-22 04:17:28,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:28,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506806668] [2020-12-22 04:17:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-22 04:17:28,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506806668] [2020-12-22 04:17:28,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231795006] [2020-12-22 04:17:28,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:28,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-12-22 04:17:28,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:17:28,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-22 04:17:28,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:17:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-22 04:17:29,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:17:29,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-12-22 04:17:29,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668447119] [2020-12-22 04:17:29,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 04:17:29,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:29,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 04:17:29,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-22 04:17:29,070 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 9 states. [2020-12-22 04:17:29,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:17:29,159 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2020-12-22 04:17:29,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 04:17:29,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-12-22 04:17:29,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:17:29,160 INFO L225 Difference]: With dead ends: 56 [2020-12-22 04:17:29,160 INFO L226 Difference]: Without dead ends: 39 [2020-12-22 04:17:29,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-22 04:17:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-12-22 04:17:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-12-22 04:17:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-22 04:17:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2020-12-22 04:17:29,167 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 31 [2020-12-22 04:17:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:17:29,167 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-12-22 04:17:29,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 04:17:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-12-22 04:17:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-22 04:17:29,168 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:29,168 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:29,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:29,383 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:29,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:29,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1074369433, now seen corresponding path program 4 times [2020-12-22 04:17:29,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:29,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272547140] [2020-12-22 04:17:29,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-22 04:17:29,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272547140] [2020-12-22 04:17:29,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120320471] [2020-12-22 04:17:29,495 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:29,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-22 04:17:29,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:17:29,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-22 04:17:29,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:17:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-22 04:17:29,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:17:29,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-12-22 04:17:29,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451271088] [2020-12-22 04:17:29,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 04:17:29,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:29,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 04:17:29,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-22 04:17:29,650 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 12 states. [2020-12-22 04:17:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:17:29,901 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2020-12-22 04:17:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-22 04:17:29,902 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2020-12-22 04:17:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:17:29,902 INFO L225 Difference]: With dead ends: 72 [2020-12-22 04:17:29,903 INFO L226 Difference]: Without dead ends: 55 [2020-12-22 04:17:29,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2020-12-22 04:17:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-22 04:17:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2020-12-22 04:17:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-22 04:17:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2020-12-22 04:17:29,911 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 34 [2020-12-22 04:17:29,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:17:29,911 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2020-12-22 04:17:29,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 04:17:29,911 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2020-12-22 04:17:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-22 04:17:29,913 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:29,913 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:30,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:30,128 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:30,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:30,129 INFO L82 PathProgramCache]: Analyzing trace with hash -483995587, now seen corresponding path program 5 times [2020-12-22 04:17:30,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:30,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998626649] [2020-12-22 04:17:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-12-22 04:17:30,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998626649] [2020-12-22 04:17:30,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821465256] [2020-12-22 04:17:30,242 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:30,315 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-12-22 04:17:30,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:17:30,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-22 04:17:30,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:17:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-12-22 04:17:30,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 04:17:30,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2020-12-22 04:17:30,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223047641] [2020-12-22 04:17:30,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:17:30,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:30,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:17:30,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-22 04:17:30,387 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 5 states. [2020-12-22 04:17:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:17:30,456 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2020-12-22 04:17:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 04:17:30,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-12-22 04:17:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:17:30,458 INFO L225 Difference]: With dead ends: 80 [2020-12-22 04:17:30,458 INFO L226 Difference]: Without dead ends: 53 [2020-12-22 04:17:30,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-12-22 04:17:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-22 04:17:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-12-22 04:17:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-22 04:17:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2020-12-22 04:17:30,465 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 45 [2020-12-22 04:17:30,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:17:30,466 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2020-12-22 04:17:30,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:17:30,466 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2020-12-22 04:17:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-22 04:17:30,467 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:30,468 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:30,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:30,681 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:30,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:30,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1464031703, now seen corresponding path program 6 times [2020-12-22 04:17:30,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:30,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983496148] [2020-12-22 04:17:30,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-22 04:17:30,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983496148] [2020-12-22 04:17:30,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603033730] [2020-12-22 04:17:30,841 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:30,978 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2020-12-22 04:17:30,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:17:30,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-22 04:17:30,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:17:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-22 04:17:31,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:17:31,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-12-22 04:17:31,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032253810] [2020-12-22 04:17:31,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 04:17:31,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:31,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 04:17:31,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-12-22 04:17:31,122 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 13 states. [2020-12-22 04:17:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:17:31,298 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2020-12-22 04:17:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 04:17:31,299 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2020-12-22 04:17:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:17:31,301 INFO L225 Difference]: With dead ends: 84 [2020-12-22 04:17:31,301 INFO L226 Difference]: Without dead ends: 56 [2020-12-22 04:17:31,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2020-12-22 04:17:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-12-22 04:17:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2020-12-22 04:17:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-22 04:17:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2020-12-22 04:17:31,309 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 48 [2020-12-22 04:17:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:17:31,309 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2020-12-22 04:17:31,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 04:17:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2020-12-22 04:17:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-22 04:17:31,311 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:31,311 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:31,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-22 04:17:31,526 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:31,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:31,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1988798461, now seen corresponding path program 7 times [2020-12-22 04:17:31,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:31,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667158586] [2020-12-22 04:17:31,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 43 proven. 20 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-12-22 04:17:31,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667158586] [2020-12-22 04:17:31,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830622922] [2020-12-22 04:17:31,659 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:31,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-22 04:17:31,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:17:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2020-12-22 04:17:31,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:17:31,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-12-22 04:17:31,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965231200] [2020-12-22 04:17:31,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 04:17:31,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:31,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 04:17:31,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-12-22 04:17:31,847 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 12 states. [2020-12-22 04:17:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:17:32,136 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2020-12-22 04:17:32,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 04:17:32,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2020-12-22 04:17:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:17:32,137 INFO L225 Difference]: With dead ends: 133 [2020-12-22 04:17:32,137 INFO L226 Difference]: Without dead ends: 90 [2020-12-22 04:17:32,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2020-12-22 04:17:32,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-12-22 04:17:32,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2020-12-22 04:17:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-12-22 04:17:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2020-12-22 04:17:32,147 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 51 [2020-12-22 04:17:32,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:17:32,147 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2020-12-22 04:17:32,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 04:17:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2020-12-22 04:17:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-22 04:17:32,148 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:32,148 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:32,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-22 04:17:32,362 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:32,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:32,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1926489495, now seen corresponding path program 8 times [2020-12-22 04:17:32,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:32,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855541985] [2020-12-22 04:17:32,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2020-12-22 04:17:32,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855541985] [2020-12-22 04:17:32,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342030210] [2020-12-22 04:17:32,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:32,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 04:17:32,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:17:32,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-22 04:17:32,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:17:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2020-12-22 04:17:32,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:17:32,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-12-22 04:17:32,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336116640] [2020-12-22 04:17:32,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 04:17:32,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:32,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 04:17:32,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-12-22 04:17:32,702 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 13 states. [2020-12-22 04:17:32,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:17:32,943 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2020-12-22 04:17:32,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 04:17:32,944 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2020-12-22 04:17:32,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:17:32,945 INFO L225 Difference]: With dead ends: 93 [2020-12-22 04:17:32,945 INFO L226 Difference]: Without dead ends: 69 [2020-12-22 04:17:32,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2020-12-22 04:17:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-12-22 04:17:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2020-12-22 04:17:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-12-22 04:17:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2020-12-22 04:17:32,954 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 56 [2020-12-22 04:17:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:17:32,955 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2020-12-22 04:17:32,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 04:17:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2020-12-22 04:17:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-22 04:17:32,956 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:17:32,956 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:17:33,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:33,170 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:17:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:17:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1118322939, now seen corresponding path program 9 times [2020-12-22 04:17:33,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:17:33,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447973849] [2020-12-22 04:17:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:17:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:17:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 25 proven. 82 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-12-22 04:17:33,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447973849] [2020-12-22 04:17:33,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640896704] [2020-12-22 04:17:33,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:17:33,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-12-22 04:17:33,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:17:33,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-22 04:17:33,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:17:33,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:17:33,668 INFO L348 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2020-12-22 04:17:33,669 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2020-12-22 04:17:33,672 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:17:33,725 INFO L625 ElimStorePlain]: treesize reduction 4, result has 93.5 percent of original size [2020-12-22 04:17:33,730 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:17:33,734 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:17:33,736 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 04:17:33,739 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:17:33,739 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:58 [2020-12-22 04:17:33,743 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:17:33,745 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:17:33,746 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 04:17:33,786 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:17:33,788 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:17:33,790 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 04:17:33,792 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 04:17:33,838 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:17:33,839 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2020-12-22 04:17:33,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:17:33,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:17:33,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:17:33,851 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:17:33,885 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:17:33,885 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2020-12-22 04:17:33,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:17:33,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:17:33,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:17:33,895 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 04:17:33,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:17:33,936 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:17:33,937 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2020-12-22 04:17:33,945 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:17:33,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:17:33,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:17:33,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:17:33,959 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-22 04:17:34,125 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-22 04:17:34,126 INFO L625 ElimStorePlain]: treesize reduction 16, result has 88.4 percent of original size [2020-12-22 04:17:34,131 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-22 04:17:34,132 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:159, output treesize:59 [2020-12-22 04:17:34,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:17:34,181 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-12-22 04:17:34,183 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:17:34,195 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:17:34,197 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 04:17:34,197 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2020-12-22 04:17:34,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:17:34,255 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:17:34,256 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2020-12-22 04:17:34,260 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:17:34,296 INFO L625 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2020-12-22 04:17:34,298 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:17:34,299 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2020-12-22 04:17:34,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:17:34,364 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:17:34,365 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2020-12-22 04:17:34,368 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:17:34,401 INFO L625 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2020-12-22 04:17:34,402 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:17:34,403 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2020-12-22 04:17:34,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:17:34,462 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:17:34,462 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2020-12-22 04:17:34,466 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:17:34,498 INFO L625 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2020-12-22 04:17:34,501 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:17:34,501 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2020-12-22 04:17:34,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:17:34,564 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:17:34,565 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2020-12-22 04:17:34,571 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:17:34,602 INFO L625 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2020-12-22 04:17:34,608 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-22 04:17:34,608 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:49 [2020-12-22 04:17:42,667 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2020-12-22 04:17:44,753 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 34 [2020-12-22 04:17:46,833 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 37 [2020-12-22 04:17:46,860 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-22 04:17:46,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:17:46,867 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:17:46,868 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 35 [2020-12-22 04:17:46,870 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:17:46,888 INFO L625 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2020-12-22 04:17:46,890 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:17:46,890 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:10 [2020-12-22 04:17:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2020-12-22 04:17:46,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:17:46,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2020-12-22 04:17:46,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927746140] [2020-12-22 04:17:46,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 04:17:46,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:17:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 04:17:46,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=172, Unknown=3, NotChecked=0, Total=210 [2020-12-22 04:17:46,959 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 15 states. [2020-12-22 04:18:07,267 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 56 [2020-12-22 04:18:09,346 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 58 [2020-12-22 04:18:13,466 WARN L197 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-12-22 04:18:17,614 WARN L197 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2020-12-22 04:18:46,184 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 61 [2020-12-22 04:19:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:19:03,738 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2020-12-22 04:19:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-22 04:19:03,739 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2020-12-22 04:19:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:19:03,739 INFO L225 Difference]: With dead ends: 125 [2020-12-22 04:19:03,740 INFO L226 Difference]: Without dead ends: 80 [2020-12-22 04:19:03,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 57.6s TimeCoverageRelationStatistics Valid=283, Invalid=757, Unknown=16, NotChecked=0, Total=1056 [2020-12-22 04:19:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-12-22 04:19:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2020-12-22 04:19:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-12-22 04:19:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2020-12-22 04:19:03,752 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 59 [2020-12-22 04:19:03,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:19:03,752 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2020-12-22 04:19:03,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 04:19:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2020-12-22 04:19:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-22 04:19:03,753 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:19:03,753 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:19:03,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:19:03,955 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:19:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:19:03,956 INFO L82 PathProgramCache]: Analyzing trace with hash 539933349, now seen corresponding path program 1 times [2020-12-22 04:19:03,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:19:03,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581573234] [2020-12-22 04:19:03,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:19:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:19:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-22 04:19:04,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581573234] [2020-12-22 04:19:04,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984213436] [2020-12-22 04:19:04,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:19:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:19:04,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-22 04:19:04,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:19:04,565 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2020-12-22 04:19:04,565 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2020-12-22 04:19:04,567 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:04,595 INFO L625 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2020-12-22 04:19:04,597 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:04,599 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:04,600 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-22 04:19:04,601 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:04,601 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:31 [2020-12-22 04:19:04,603 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:04,603 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:04,604 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-22 04:19:04,639 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:04,640 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:04,641 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-22 04:19:04,695 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:04,695 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:19:04,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:04,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:04,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:04,702 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:04,777 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:04,777 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2020-12-22 04:19:04,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:04,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:04,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:04,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:04,792 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:04,835 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:04,835 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:19:04,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:04,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:04,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:04,843 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:04,880 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:04,881 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:19:04,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:04,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:04,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:04,888 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:04,954 INFO L625 ElimStorePlain]: treesize reduction 47, result has 41.3 percent of original size [2020-12-22 04:19:04,957 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-22 04:19:04,958 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:21 [2020-12-22 04:19:05,088 INFO L382 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 [2020-12-22 04:19:05,089 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:05,093 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:05,094 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:05,094 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-12-22 04:19:05,156 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:05,156 INFO L382 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 1 case distinctions, treesize of input 38 treesize of output 69 [2020-12-22 04:19:05,159 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:05,173 INFO L625 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2020-12-22 04:19:05,174 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:05,175 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2020-12-22 04:19:05,210 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:05,211 INFO L382 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 1 case distinctions, treesize of input 38 treesize of output 69 [2020-12-22 04:19:05,213 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:05,228 INFO L625 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2020-12-22 04:19:05,229 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:05,230 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2020-12-22 04:19:05,260 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:05,260 INFO L382 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 1 case distinctions, treesize of input 38 treesize of output 69 [2020-12-22 04:19:05,262 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:05,276 INFO L625 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2020-12-22 04:19:05,278 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:05,278 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2020-12-22 04:19:05,305 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:05,305 INFO L382 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 1 case distinctions, treesize of input 38 treesize of output 69 [2020-12-22 04:19:05,308 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:05,322 INFO L625 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2020-12-22 04:19:05,323 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:05,323 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2020-12-22 04:19:05,349 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:05,350 INFO L382 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 1 case distinctions, treesize of input 38 treesize of output 69 [2020-12-22 04:19:05,352 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:05,365 INFO L625 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2020-12-22 04:19:05,367 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:05,367 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:7 [2020-12-22 04:19:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-22 04:19:05,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:19:05,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2020-12-22 04:19:05,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432140338] [2020-12-22 04:19:05,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-22 04:19:05,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:19:05,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-22 04:19:05,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2020-12-22 04:19:05,463 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 23 states. [2020-12-22 04:19:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:19:06,760 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2020-12-22 04:19:06,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-22 04:19:06,761 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2020-12-22 04:19:06,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:19:06,762 INFO L225 Difference]: With dead ends: 102 [2020-12-22 04:19:06,762 INFO L226 Difference]: Without dead ends: 100 [2020-12-22 04:19:06,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=346, Invalid=1460, Unknown=0, NotChecked=0, Total=1806 [2020-12-22 04:19:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-12-22 04:19:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 74. [2020-12-22 04:19:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-12-22 04:19:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2020-12-22 04:19:06,778 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 69 [2020-12-22 04:19:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:19:06,778 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2020-12-22 04:19:06,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-22 04:19:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2020-12-22 04:19:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-22 04:19:06,779 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:19:06,779 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:19:06,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-22 04:19:06,981 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:19:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:19:06,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1470867525, now seen corresponding path program 1 times [2020-12-22 04:19:06,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:19:06,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857173223] [2020-12-22 04:19:06,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:19:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:19:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 78 proven. 16 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2020-12-22 04:19:07,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857173223] [2020-12-22 04:19:07,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861818349] [2020-12-22 04:19:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:19:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:19:07,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-22 04:19:07,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:19:07,615 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2020-12-22 04:19:07,615 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2020-12-22 04:19:07,618 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:07,649 INFO L625 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2020-12-22 04:19:07,652 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:07,654 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:07,655 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-22 04:19:07,656 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:07,657 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:31 [2020-12-22 04:19:07,660 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:07,660 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:07,661 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-22 04:19:07,698 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:07,704 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:07,705 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-22 04:19:07,785 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:07,786 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2020-12-22 04:19:07,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:07,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:07,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:07,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:07,794 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:07,836 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:07,837 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:19:07,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:07,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:07,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:07,844 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:07,893 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:07,893 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:19:07,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:07,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:07,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:07,903 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:07,938 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:07,938 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:19:07,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:07,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:07,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:07,952 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:08,031 INFO L625 ElimStorePlain]: treesize reduction 66, result has 33.3 percent of original size [2020-12-22 04:19:08,035 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-22 04:19:08,036 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:21 [2020-12-22 04:19:08,174 INFO L382 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 [2020-12-22 04:19:08,174 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:08,181 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:08,185 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:08,185 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-12-22 04:19:08,270 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:08,270 INFO L382 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 1 case distinctions, treesize of input 25 treesize of output 54 [2020-12-22 04:19:08,274 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:08,295 INFO L625 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2020-12-22 04:19:08,296 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:08,297 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2020-12-22 04:19:08,460 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:08,461 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 99 [2020-12-22 04:19:08,464 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:08,488 INFO L625 ElimStorePlain]: treesize reduction 36, result has 52.0 percent of original size [2020-12-22 04:19:08,490 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:08,490 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:28 [2020-12-22 04:19:08,563 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:08,564 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 99 [2020-12-22 04:19:08,567 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:08,590 INFO L625 ElimStorePlain]: treesize reduction 44, result has 47.0 percent of original size [2020-12-22 04:19:08,592 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:08,592 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:28 [2020-12-22 04:19:08,656 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:08,656 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 99 [2020-12-22 04:19:08,659 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:08,687 INFO L625 ElimStorePlain]: treesize reduction 30, result has 56.5 percent of original size [2020-12-22 04:19:08,689 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:08,690 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:28 [2020-12-22 04:19:08,740 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:08,741 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 99 [2020-12-22 04:19:08,743 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:08,768 INFO L625 ElimStorePlain]: treesize reduction 30, result has 56.5 percent of original size [2020-12-22 04:19:08,771 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:08,771 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:28 [2020-12-22 04:19:08,812 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:08,813 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 99 [2020-12-22 04:19:08,815 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:08,842 INFO L625 ElimStorePlain]: treesize reduction 38, result has 50.6 percent of original size [2020-12-22 04:19:08,845 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:08,845 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:58, output treesize:24 [2020-12-22 04:19:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-22 04:19:09,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:19:09,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 23 [2020-12-22 04:19:09,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837437964] [2020-12-22 04:19:09,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-22 04:19:09,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:19:09,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-22 04:19:09,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2020-12-22 04:19:09,225 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 24 states. [2020-12-22 04:19:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:19:11,203 INFO L93 Difference]: Finished difference Result 153 states and 182 transitions. [2020-12-22 04:19:11,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-22 04:19:11,204 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2020-12-22 04:19:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:19:11,205 INFO L225 Difference]: With dead ends: 153 [2020-12-22 04:19:11,205 INFO L226 Difference]: Without dead ends: 102 [2020-12-22 04:19:11,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=336, Invalid=2016, Unknown=0, NotChecked=0, Total=2352 [2020-12-22 04:19:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-12-22 04:19:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2020-12-22 04:19:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-12-22 04:19:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2020-12-22 04:19:11,222 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 73 [2020-12-22 04:19:11,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:19:11,222 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2020-12-22 04:19:11,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-22 04:19:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2020-12-22 04:19:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-22 04:19:11,223 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:19:11,223 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:19:11,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-22 04:19:11,438 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:19:11,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:19:11,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1908267949, now seen corresponding path program 2 times [2020-12-22 04:19:11,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:19:11,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369756011] [2020-12-22 04:19:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:19:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:19:12,102 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-22 04:19:12,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369756011] [2020-12-22 04:19:12,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745551245] [2020-12-22 04:19:12,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:19:12,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 04:19:12,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:19:12,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-22 04:19:12,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:19:12,274 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2020-12-22 04:19:12,275 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2020-12-22 04:19:12,278 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:12,305 INFO L625 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2020-12-22 04:19:12,307 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:12,307 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:12,308 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-22 04:19:12,309 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:12,309 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:31 [2020-12-22 04:19:12,310 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:12,311 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:12,312 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-22 04:19:12,345 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:12,346 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:12,347 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-22 04:19:12,425 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:12,426 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2020-12-22 04:19:12,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:12,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:12,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:12,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:12,435 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:12,480 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:12,480 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:19:12,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:12,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:12,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:12,486 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:12,535 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:12,535 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:19:12,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:12,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:12,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:12,546 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:12,583 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:12,584 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:19:12,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:12,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:12,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:12,590 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:12,671 INFO L625 ElimStorePlain]: treesize reduction 66, result has 33.3 percent of original size [2020-12-22 04:19:12,674 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-22 04:19:12,674 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:21 [2020-12-22 04:19:12,756 INFO L382 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 [2020-12-22 04:19:12,757 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:12,763 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:12,764 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:12,764 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-12-22 04:19:12,840 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:12,841 INFO L382 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 1 case distinctions, treesize of input 25 treesize of output 54 [2020-12-22 04:19:12,842 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:12,863 INFO L625 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2020-12-22 04:19:12,864 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:12,864 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2020-12-22 04:19:13,005 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:13,006 INFO L382 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 3 case distinctions, treesize of input 36 treesize of output 118 [2020-12-22 04:19:13,011 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:13,059 INFO L625 ElimStorePlain]: treesize reduction 60, result has 42.3 percent of original size [2020-12-22 04:19:13,067 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:13,067 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2020-12-22 04:19:13,290 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:13,290 INFO L382 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 4 case distinctions, treesize of input 62 treesize of output 143 [2020-12-22 04:19:13,294 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:13,334 INFO L625 ElimStorePlain]: treesize reduction 80, result has 40.7 percent of original size [2020-12-22 04:19:13,337 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:13,337 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:74, output treesize:44 [2020-12-22 04:19:13,457 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:13,458 INFO L382 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 4 case distinctions, treesize of input 62 treesize of output 143 [2020-12-22 04:19:13,461 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:13,500 INFO L625 ElimStorePlain]: treesize reduction 68, result has 44.7 percent of original size [2020-12-22 04:19:13,502 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:13,502 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:74, output treesize:44 [2020-12-22 04:19:13,602 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:13,603 INFO L382 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 4 case distinctions, treesize of input 62 treesize of output 143 [2020-12-22 04:19:13,609 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:13,651 INFO L625 ElimStorePlain]: treesize reduction 80, result has 40.7 percent of original size [2020-12-22 04:19:13,654 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:13,654 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:74, output treesize:44 [2020-12-22 04:19:13,749 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:13,749 INFO L382 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 4 case distinctions, treesize of input 62 treesize of output 143 [2020-12-22 04:19:13,753 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:13,795 INFO L625 ElimStorePlain]: treesize reduction 96, result has 36.4 percent of original size [2020-12-22 04:19:13,798 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:13,798 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:74, output treesize:44 [2020-12-22 04:19:13,869 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:13,869 INFO L382 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 4 case distinctions, treesize of input 62 treesize of output 143 [2020-12-22 04:19:13,873 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:13,913 INFO L625 ElimStorePlain]: treesize reduction 68, result has 44.7 percent of original size [2020-12-22 04:19:13,916 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:13,916 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:74, output treesize:40 [2020-12-22 04:19:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-22 04:19:14,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:19:14,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2020-12-22 04:19:14,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669728088] [2020-12-22 04:19:14,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-22 04:19:14,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:19:14,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-22 04:19:14,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2020-12-22 04:19:14,475 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand 30 states. [2020-12-22 04:19:15,946 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2020-12-22 04:19:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:19:17,598 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2020-12-22 04:19:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-22 04:19:17,602 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2020-12-22 04:19:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:19:17,604 INFO L225 Difference]: With dead ends: 101 [2020-12-22 04:19:17,604 INFO L226 Difference]: Without dead ends: 99 [2020-12-22 04:19:17,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=453, Invalid=2517, Unknown=0, NotChecked=0, Total=2970 [2020-12-22 04:19:17,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-12-22 04:19:17,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2020-12-22 04:19:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-12-22 04:19:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2020-12-22 04:19:17,624 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 77 [2020-12-22 04:19:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:19:17,624 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2020-12-22 04:19:17,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-22 04:19:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2020-12-22 04:19:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-22 04:19:17,625 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:19:17,625 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:19:17,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-22 04:19:17,840 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:19:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:19:17,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1507902871, now seen corresponding path program 3 times [2020-12-22 04:19:17,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:19:17,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425304804] [2020-12-22 04:19:17,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:19:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:19:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 121 proven. 47 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-12-22 04:19:18,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425304804] [2020-12-22 04:19:18,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370486786] [2020-12-22 04:19:18,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:19:18,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-12-22 04:19:18,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:19:18,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-22 04:19:18,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:19:18,904 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2020-12-22 04:19:18,904 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2020-12-22 04:19:18,906 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:18,947 INFO L625 ElimStorePlain]: treesize reduction 10, result has 83.9 percent of original size [2020-12-22 04:19:18,950 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:18,950 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:18,951 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-22 04:19:18,952 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:18,952 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:52 [2020-12-22 04:19:18,954 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:18,954 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:18,958 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-22 04:19:19,006 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:19,007 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:19,007 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-22 04:19:19,054 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:19,055 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:19:19,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:19,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:19,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:19,060 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:19,103 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:19,104 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:19:19,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:19,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:19,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:19,109 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:19,187 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:19,188 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2020-12-22 04:19:19,193 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:19,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:19,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:19,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:19,198 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:19,233 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:19,233 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:19:19,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:19,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:19,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:19,239 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:19,360 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2020-12-22 04:19:19,360 INFO L625 ElimStorePlain]: treesize reduction 108, result has 41.0 percent of original size [2020-12-22 04:19:19,363 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-22 04:19:19,363 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:189, output treesize:63 [2020-12-22 04:19:19,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:19:19,430 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2020-12-22 04:19:19,432 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:19,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:19,447 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:19,447 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2020-12-22 04:19:19,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:19:19,551 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:19,551 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2020-12-22 04:19:19,553 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:19,593 INFO L625 ElimStorePlain]: treesize reduction 28, result has 64.6 percent of original size [2020-12-22 04:19:19,595 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:19,595 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2020-12-22 04:19:19,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:19:19,684 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:19,684 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2020-12-22 04:19:19,686 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:19,726 INFO L625 ElimStorePlain]: treesize reduction 28, result has 64.6 percent of original size [2020-12-22 04:19:19,727 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:19,727 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2020-12-22 04:19:19,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:19:19,812 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:19,812 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2020-12-22 04:19:19,814 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:19,857 INFO L625 ElimStorePlain]: treesize reduction 28, result has 64.6 percent of original size [2020-12-22 04:19:19,862 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:19,862 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2020-12-22 04:19:19,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:19:19,956 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:19,956 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 72 [2020-12-22 04:19:19,958 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:19,989 INFO L625 ElimStorePlain]: treesize reduction 26, result has 62.9 percent of original size [2020-12-22 04:19:19,991 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:19,991 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:44 [2020-12-22 04:19:20,490 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-22 04:19:20,743 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:20,744 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 54 [2020-12-22 04:19:20,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:20,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:20,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:20,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:20,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:20,753 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:20,782 INFO L625 ElimStorePlain]: treesize reduction 46, result has 19.3 percent of original size [2020-12-22 04:19:20,784 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:20,784 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:66, output treesize:7 [2020-12-22 04:19:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2020-12-22 04:19:20,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:19:20,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 28 [2020-12-22 04:19:20,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895638747] [2020-12-22 04:19:20,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-22 04:19:20,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:19:20,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-22 04:19:20,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2020-12-22 04:19:20,885 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 28 states. [2020-12-22 04:19:25,832 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2020-12-22 04:19:26,461 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-12-22 04:19:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:19:26,791 INFO L93 Difference]: Finished difference Result 144 states and 171 transitions. [2020-12-22 04:19:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 04:19:26,792 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 81 [2020-12-22 04:19:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:19:26,793 INFO L225 Difference]: With dead ends: 144 [2020-12-22 04:19:26,793 INFO L226 Difference]: Without dead ends: 82 [2020-12-22 04:19:26,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2020-12-22 04:19:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-12-22 04:19:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-12-22 04:19:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-12-22 04:19:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2020-12-22 04:19:26,810 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 81 [2020-12-22 04:19:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:19:26,810 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2020-12-22 04:19:26,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-22 04:19:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2020-12-22 04:19:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-22 04:19:26,811 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:19:26,811 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:19:27,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:19:27,026 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:19:27,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:19:27,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1389330395, now seen corresponding path program 4 times [2020-12-22 04:19:27,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:19:27,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489462168] [2020-12-22 04:19:27,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:19:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:19:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 115 proven. 92 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-12-22 04:19:28,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489462168] [2020-12-22 04:19:28,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620616516] [2020-12-22 04:19:28,227 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:19:28,310 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-22 04:19:28,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:19:28,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 43 conjunts are in the unsatisfiable core [2020-12-22 04:19:28,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:19:29,035 INFO L348 Elim1Store]: treesize reduction 327, result has 9.9 percent of original size [2020-12-22 04:19:29,036 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 57 [2020-12-22 04:19:29,039 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:29,050 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:29,050 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:29,051 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:46 [2020-12-22 04:19:29,392 INFO L348 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2020-12-22 04:19:29,392 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 13 [2020-12-22 04:19:29,394 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:29,396 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:29,397 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:29,397 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:5 [2020-12-22 04:19:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 90 proven. 123 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-12-22 04:19:29,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:19:29,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2020-12-22 04:19:29,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822090112] [2020-12-22 04:19:29,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-12-22 04:19:29,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:19:29,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-12-22 04:19:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2020-12-22 04:19:29,483 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 40 states. [2020-12-22 04:19:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:19:33,223 INFO L93 Difference]: Finished difference Result 194 states and 236 transitions. [2020-12-22 04:19:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-12-22 04:19:33,224 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 81 [2020-12-22 04:19:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:19:33,225 INFO L225 Difference]: With dead ends: 194 [2020-12-22 04:19:33,225 INFO L226 Difference]: Without dead ends: 148 [2020-12-22 04:19:33,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=401, Invalid=4155, Unknown=0, NotChecked=0, Total=4556 [2020-12-22 04:19:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-12-22 04:19:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2020-12-22 04:19:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-12-22 04:19:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 157 transitions. [2020-12-22 04:19:33,251 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 157 transitions. Word has length 81 [2020-12-22 04:19:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:19:33,252 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 157 transitions. [2020-12-22 04:19:33,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-12-22 04:19:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 157 transitions. [2020-12-22 04:19:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-22 04:19:33,252 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:19:33,253 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:19:33,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-22 04:19:33,466 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:19:33,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:19:33,467 INFO L82 PathProgramCache]: Analyzing trace with hash 144575521, now seen corresponding path program 5 times [2020-12-22 04:19:33,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:19:33,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962731790] [2020-12-22 04:19:33,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:19:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:19:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 78 proven. 7 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2020-12-22 04:19:33,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962731790] [2020-12-22 04:19:33,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080742332] [2020-12-22 04:19:33,923 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:19:34,025 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2020-12-22 04:19:34,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:19:34,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-22 04:19:34,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:19:34,862 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2020-12-22 04:19:34,862 INFO L348 Elim1Store]: treesize reduction 239, result has 46.3 percent of original size [2020-12-22 04:19:34,863 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 223 [2020-12-22 04:19:34,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:34,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:34,867 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:34,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,869 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 04:19:34,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:34,873 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-12-22 04:19:34,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,876 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:34,876 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:34,880 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:34,880 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:34,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,886 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:19:34,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:34,899 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:19:35,334 WARN L197 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2020-12-22 04:19:35,335 INFO L625 ElimStorePlain]: treesize reduction 525, result has 34.5 percent of original size [2020-12-22 04:19:35,339 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:35,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:35,341 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:35,342 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 04:19:35,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:35,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:35,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:35,348 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:35,349 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 04:19:35,354 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:19:35,354 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:266 [2020-12-22 04:19:35,357 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:35,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:35,358 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:35,359 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 04:19:35,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:35,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:35,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:35,364 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:35,365 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 04:19:37,539 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:37,540 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:37,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:37,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:37,544 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:37,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:37,545 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:37,548 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:37,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:37,549 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:37,551 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 04:19:37,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:37,554 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:37,555 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 04:19:37,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:37,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:37,562 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 04:19:37,563 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:37,565 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:37,568 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:37,569 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 04:19:37,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:37,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:37,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:37,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:37,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:37,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:37,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:37,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:37,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:37,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 04:19:37,591 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:37,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:37,592 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:37,594 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 04:19:37,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:37,596 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 04:19:37,598 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 04:19:37,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:37,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:19:38,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:38,413 INFO L348 Elim1Store]: treesize reduction 35, result has 67.0 percent of original size [2020-12-22 04:19:38,414 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 80 [2020-12-22 04:19:38,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:38,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:38,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:38,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:19:38,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:38,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:38,423 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:38,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:38,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:38,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:38,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:38,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:38,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:38,433 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:38,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:38,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:19:38,435 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:19:38,438 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-22 04:19:38,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:19:38,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:19:38,455 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:19:38,455 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:18 [2020-12-22 04:19:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 143 proven. 47 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-12-22 04:19:38,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:19:38,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 22] total 31 [2020-12-22 04:19:38,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812837240] [2020-12-22 04:19:38,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-12-22 04:19:38,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:19:38,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-12-22 04:19:38,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=847, Unknown=1, NotChecked=0, Total=930 [2020-12-22 04:19:38,920 INFO L87 Difference]: Start difference. First operand 130 states and 157 transitions. Second operand 31 states. [2020-12-22 04:19:53,091 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2020-12-22 04:19:53,330 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2020-12-22 04:19:59,882 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2020-12-22 04:20:04,280 WARN L197 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-12-22 04:20:07,846 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 55 [2020-12-22 04:20:08,119 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 47 [2020-12-22 04:20:08,541 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-22 04:20:08,952 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 41 [2020-12-22 04:20:09,500 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2020-12-22 04:20:12,223 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 34 [2020-12-22 04:20:14,480 WARN L197 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2020-12-22 04:20:14,960 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 41 [2020-12-22 04:20:18,198 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2020-12-22 04:20:18,622 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2020-12-22 04:20:19,024 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 63 [2020-12-22 04:20:21,539 WARN L197 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 101 DAG size of output: 98 [2020-12-22 04:20:22,880 WARN L197 SmtUtils]: Spent 950.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-12-22 04:20:23,489 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 55 [2020-12-22 04:20:23,968 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-22 04:20:26,372 WARN L197 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 79 [2020-12-22 04:20:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:20:28,842 INFO L93 Difference]: Finished difference Result 348 states and 440 transitions. [2020-12-22 04:20:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2020-12-22 04:20:28,848 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2020-12-22 04:20:28,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:20:28,851 INFO L225 Difference]: With dead ends: 348 [2020-12-22 04:20:28,851 INFO L226 Difference]: Without dead ends: 243 [2020-12-22 04:20:28,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2298 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=992, Invalid=7560, Unknown=4, NotChecked=0, Total=8556 [2020-12-22 04:20:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-12-22 04:20:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 185. [2020-12-22 04:20:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-12-22 04:20:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2020-12-22 04:20:28,894 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 81 [2020-12-22 04:20:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:20:28,894 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2020-12-22 04:20:28,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-12-22 04:20:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2020-12-22 04:20:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-22 04:20:28,895 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:20:28,895 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:20:29,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:20:29,096 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:20:29,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:20:29,097 INFO L82 PathProgramCache]: Analyzing trace with hash 705275299, now seen corresponding path program 6 times [2020-12-22 04:20:29,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:20:29,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761713876] [2020-12-22 04:20:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:20:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:20:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2020-12-22 04:20:29,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761713876] [2020-12-22 04:20:29,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711812183] [2020-12-22 04:20:29,853 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:20:30,072 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2020-12-22 04:20:30,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:20:30,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-22 04:20:30,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:20:30,176 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:30,176 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 59 [2020-12-22 04:20:30,183 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:30,200 INFO L625 ElimStorePlain]: treesize reduction 20, result has 47.4 percent of original size [2020-12-22 04:20:30,201 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:30,201 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:7 [2020-12-22 04:20:30,561 INFO L348 Elim1Store]: treesize reduction 120, result has 13.7 percent of original size [2020-12-22 04:20:30,562 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 34 [2020-12-22 04:20:30,564 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:30,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:30,575 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:30,575 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:19 [2020-12-22 04:20:30,756 INFO L348 Elim1Store]: treesize reduction 12, result has 85.9 percent of original size [2020-12-22 04:20:30,757 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 82 [2020-12-22 04:20:30,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:30,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:20:30,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:30,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:20:30,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:30,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:20:30,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:30,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,803 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:20:30,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:30,809 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 04:20:30,813 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-12-22 04:20:30,943 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2020-12-22 04:20:30,944 INFO L625 ElimStorePlain]: treesize reduction 83, result has 42.8 percent of original size [2020-12-22 04:20:30,945 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:30,945 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:62 [2020-12-22 04:20:31,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:31,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:31,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 206 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-12-22 04:20:31,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:20:31,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 31 [2020-12-22 04:20:31,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875987875] [2020-12-22 04:20:31,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-22 04:20:31,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:20:31,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-22 04:20:31,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2020-12-22 04:20:31,551 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand 32 states. [2020-12-22 04:20:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:20:33,898 INFO L93 Difference]: Finished difference Result 422 states and 549 transitions. [2020-12-22 04:20:33,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-12-22 04:20:33,900 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2020-12-22 04:20:33,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:20:33,901 INFO L225 Difference]: With dead ends: 422 [2020-12-22 04:20:33,902 INFO L226 Difference]: Without dead ends: 296 [2020-12-22 04:20:33,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=625, Invalid=2345, Unknown=0, NotChecked=0, Total=2970 [2020-12-22 04:20:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-12-22 04:20:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 220. [2020-12-22 04:20:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-12-22 04:20:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 287 transitions. [2020-12-22 04:20:33,946 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 287 transitions. Word has length 81 [2020-12-22 04:20:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:20:33,946 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 287 transitions. [2020-12-22 04:20:33,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-22 04:20:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 287 transitions. [2020-12-22 04:20:33,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-22 04:20:33,947 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:20:33,947 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:20:34,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:20:34,156 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:20:34,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:20:34,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1238516121, now seen corresponding path program 7 times [2020-12-22 04:20:34,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:20:34,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864269009] [2020-12-22 04:20:34,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:20:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:20:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-12-22 04:20:34,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864269009] [2020-12-22 04:20:34,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065969327] [2020-12-22 04:20:34,884 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:20:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:20:34,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 54 conjunts are in the unsatisfiable core [2020-12-22 04:20:34,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:20:35,046 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2020-12-22 04:20:35,046 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2020-12-22 04:20:35,048 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:35,087 INFO L625 ElimStorePlain]: treesize reduction 10, result has 77.3 percent of original size [2020-12-22 04:20:35,089 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:20:35,090 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:20:35,091 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-22 04:20:35,091 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:20:35,091 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:34 [2020-12-22 04:20:35,092 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:20:35,093 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:20:35,093 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-22 04:20:35,141 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:20:35,142 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:20:35,142 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-22 04:20:35,204 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:35,205 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:20:35,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:20:35,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:35,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:35,227 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:35,284 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:35,285 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:20:35,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:20:35,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:35,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:35,290 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:35,383 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:35,384 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2020-12-22 04:20:35,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:20:35,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:20:35,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:35,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:35,392 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:35,439 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:35,440 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:20:35,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:20:35,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:35,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:35,446 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:35,543 INFO L625 ElimStorePlain]: treesize reduction 59, result has 43.3 percent of original size [2020-12-22 04:20:35,547 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-22 04:20:35,547 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:129, output treesize:33 [2020-12-22 04:20:35,652 INFO L382 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 [2020-12-22 04:20:35,653 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:35,666 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:35,667 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:35,667 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2020-12-22 04:20:35,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:35,768 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-12-22 04:20:35,769 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:35,786 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:35,787 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:35,788 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2020-12-22 04:20:35,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:35,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:35,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:35,916 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2020-12-22 04:20:35,919 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:35,936 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:35,937 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:35,937 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2020-12-22 04:20:36,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,081 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2020-12-22 04:20:36,083 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:36,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:36,102 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:36,102 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2020-12-22 04:20:36,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,309 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:36,310 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 105 [2020-12-22 04:20:36,312 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:36,376 INFO L625 ElimStorePlain]: treesize reduction 20, result has 74.7 percent of original size [2020-12-22 04:20:36,378 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:36,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:78, output treesize:48 [2020-12-22 04:20:36,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,589 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:36,589 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 97 [2020-12-22 04:20:36,592 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:36,642 INFO L625 ElimStorePlain]: treesize reduction 16, result has 77.8 percent of original size [2020-12-22 04:20:36,644 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:36,644 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:45 [2020-12-22 04:20:36,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,690 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:36,691 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 105 [2020-12-22 04:20:36,695 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:36,745 INFO L625 ElimStorePlain]: treesize reduction 20, result has 73.7 percent of original size [2020-12-22 04:20:36,746 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:36,746 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:75, output treesize:45 [2020-12-22 04:20:36,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,796 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:36,796 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 105 [2020-12-22 04:20:36,799 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:36,849 INFO L625 ElimStorePlain]: treesize reduction 20, result has 73.7 percent of original size [2020-12-22 04:20:36,850 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:36,851 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:75, output treesize:45 [2020-12-22 04:20:36,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 04:20:36,896 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:36,897 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 91 [2020-12-22 04:20:36,901 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:36,938 INFO L625 ElimStorePlain]: treesize reduction 18, result has 73.9 percent of original size [2020-12-22 04:20:36,940 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:36,941 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:66, output treesize:38 [2020-12-22 04:20:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-22 04:20:37,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:20:37,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21] total 31 [2020-12-22 04:20:37,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355785462] [2020-12-22 04:20:37,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-22 04:20:37,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:20:37,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-22 04:20:37,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2020-12-22 04:20:37,530 INFO L87 Difference]: Start difference. First operand 220 states and 287 transitions. Second operand 32 states. [2020-12-22 04:20:38,894 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-12-22 04:20:39,100 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-12-22 04:20:39,272 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2020-12-22 04:20:39,471 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-12-22 04:20:39,677 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-12-22 04:20:39,868 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2020-12-22 04:20:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:20:41,590 INFO L93 Difference]: Finished difference Result 430 states and 565 transitions. [2020-12-22 04:20:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-12-22 04:20:41,591 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2020-12-22 04:20:41,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:20:41,592 INFO L225 Difference]: With dead ends: 430 [2020-12-22 04:20:41,592 INFO L226 Difference]: Without dead ends: 235 [2020-12-22 04:20:41,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=376, Invalid=3284, Unknown=0, NotChecked=0, Total=3660 [2020-12-22 04:20:41,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-12-22 04:20:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 225. [2020-12-22 04:20:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2020-12-22 04:20:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2020-12-22 04:20:41,651 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 81 [2020-12-22 04:20:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:20:41,651 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2020-12-22 04:20:41,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-22 04:20:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2020-12-22 04:20:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-22 04:20:41,653 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:20:41,653 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:20:41,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-22 04:20:41,868 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:20:41,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:20:41,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1741635899, now seen corresponding path program 8 times [2020-12-22 04:20:41,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:20:41,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332446473] [2020-12-22 04:20:41,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:20:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:20:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 90 proven. 119 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-12-22 04:20:43,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332446473] [2020-12-22 04:20:43,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071604842] [2020-12-22 04:20:43,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:20:43,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 04:20:43,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:20:43,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-22 04:20:43,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:20:43,727 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2020-12-22 04:20:43,728 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2020-12-22 04:20:43,730 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:43,771 INFO L625 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2020-12-22 04:20:43,772 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:20:43,773 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:20:43,774 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-22 04:20:43,776 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:20:43,776 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:31 [2020-12-22 04:20:43,777 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:20:43,778 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:20:43,778 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-22 04:20:43,840 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:20:43,841 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-22 04:20:43,842 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-22 04:20:43,951 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:43,951 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2020-12-22 04:20:43,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:20:43,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:20:43,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:43,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:43,959 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:44,022 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:44,022 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:20:44,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:20:44,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:44,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:44,028 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:44,095 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:44,095 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:20:44,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:20:44,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:44,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:44,101 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:44,153 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:44,154 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2020-12-22 04:20:44,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 04:20:44,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:20:44,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:20:44,161 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:44,281 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2020-12-22 04:20:44,282 INFO L625 ElimStorePlain]: treesize reduction 62, result has 34.7 percent of original size [2020-12-22 04:20:44,285 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-22 04:20:44,286 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:21 [2020-12-22 04:20:44,351 INFO L382 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 [2020-12-22 04:20:44,352 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:44,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:44,362 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:44,362 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-12-22 04:20:44,498 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:44,498 INFO L382 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 1 case distinctions, treesize of input 25 treesize of output 54 [2020-12-22 04:20:44,500 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:44,531 INFO L625 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2020-12-22 04:20:44,532 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 04:20:44,533 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2020-12-22 04:20:44,748 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:44,748 INFO L382 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 3 case distinctions, treesize of input 36 treesize of output 118 [2020-12-22 04:20:44,751 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:44,807 INFO L625 ElimStorePlain]: treesize reduction 60, result has 42.3 percent of original size [2020-12-22 04:20:44,809 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 04:20:44,809 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2020-12-22 04:20:45,102 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:45,103 INFO L382 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 6 case distinctions, treesize of input 47 treesize of output 198 [2020-12-22 04:20:45,106 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:45,200 INFO L625 ElimStorePlain]: treesize reduction 110, result has 35.3 percent of original size [2020-12-22 04:20:45,202 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 04:20:45,202 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:60 [2020-12-22 04:20:45,596 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-22 04:20:45,596 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:45,597 INFO L382 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 10 case distinctions, treesize of input 58 treesize of output 294 [2020-12-22 04:20:45,602 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:45,742 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2020-12-22 04:20:45,743 INFO L625 ElimStorePlain]: treesize reduction 172, result has 30.6 percent of original size [2020-12-22 04:20:45,747 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-22 04:20:45,747 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:80, output treesize:76 [2020-12-22 04:20:46,199 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-22 04:20:46,200 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:46,200 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 84 treesize of output 279 [2020-12-22 04:20:46,208 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:46,316 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2020-12-22 04:20:46,317 INFO L625 ElimStorePlain]: treesize reduction 196, result has 30.7 percent of original size [2020-12-22 04:20:46,322 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-22 04:20:46,323 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:106, output treesize:76 [2020-12-22 04:20:46,618 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-22 04:20:46,619 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:46,620 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 84 treesize of output 279 [2020-12-22 04:20:46,630 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:46,775 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2020-12-22 04:20:46,776 INFO L625 ElimStorePlain]: treesize reduction 228, result has 27.6 percent of original size [2020-12-22 04:20:46,783 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-22 04:20:46,783 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:106, output treesize:76 [2020-12-22 04:20:47,121 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-22 04:20:47,121 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:47,122 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 84 treesize of output 279 [2020-12-22 04:20:47,132 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:47,273 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2020-12-22 04:20:47,273 INFO L625 ElimStorePlain]: treesize reduction 196, result has 30.7 percent of original size [2020-12-22 04:20:47,280 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-22 04:20:47,280 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:106, output treesize:76 [2020-12-22 04:20:47,516 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-22 04:20:47,516 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:47,517 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 84 treesize of output 279 [2020-12-22 04:20:47,523 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:47,631 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2020-12-22 04:20:47,632 INFO L625 ElimStorePlain]: treesize reduction 196, result has 30.7 percent of original size [2020-12-22 04:20:47,636 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-22 04:20:47,637 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:106, output treesize:76 [2020-12-22 04:20:47,814 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-22 04:20:47,815 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 04:20:47,815 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 84 treesize of output 279 [2020-12-22 04:20:47,822 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 04:20:47,930 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2020-12-22 04:20:47,931 INFO L625 ElimStorePlain]: treesize reduction 220, result has 28.3 percent of original size [2020-12-22 04:20:47,936 INFO L547 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-22 04:20:47,936 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:106, output treesize:72 [2020-12-22 04:20:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-22 04:20:49,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:20:49,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2020-12-22 04:20:49,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094413915] [2020-12-22 04:20:49,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-12-22 04:20:49,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:20:49,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-12-22 04:20:49,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1516, Unknown=0, NotChecked=0, Total=1640 [2020-12-22 04:20:49,530 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand 41 states. [2020-12-22 04:20:51,106 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2020-12-22 04:20:51,777 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2020-12-22 04:20:52,095 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2020-12-22 04:20:52,402 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2020-12-22 04:20:52,928 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2020-12-22 04:20:53,328 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2020-12-22 04:20:53,704 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2020-12-22 04:20:53,977 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2020-12-22 04:20:54,266 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2020-12-22 04:20:54,549 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2020-12-22 04:20:54,878 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2020-12-22 04:20:55,146 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2020-12-22 04:20:56,030 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-12-22 04:20:56,306 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2020-12-22 04:20:56,910 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2020-12-22 04:20:57,106 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2020-12-22 04:20:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:20:58,546 INFO L93 Difference]: Finished difference Result 430 states and 567 transitions. [2020-12-22 04:20:58,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-12-22 04:20:58,548 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 85 [2020-12-22 04:20:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:20:58,552 INFO L225 Difference]: With dead ends: 430 [2020-12-22 04:20:58,552 INFO L226 Difference]: Without dead ends: 316 [2020-12-22 04:20:58,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=744, Invalid=6062, Unknown=0, NotChecked=0, Total=6806 [2020-12-22 04:20:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-12-22 04:20:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 270. [2020-12-22 04:20:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-12-22 04:20:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 347 transitions. [2020-12-22 04:20:58,621 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 347 transitions. Word has length 85 [2020-12-22 04:20:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:20:58,621 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 347 transitions. [2020-12-22 04:20:58,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-12-22 04:20:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 347 transitions. [2020-12-22 04:20:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-22 04:20:58,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:20:58,623 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:20:58,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:20:58,837 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:20:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:20:58,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1580992173, now seen corresponding path program 9 times [2020-12-22 04:20:58,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:20:58,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819417524] [2020-12-22 04:20:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:20:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:20:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 33 proven. 17 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2020-12-22 04:20:58,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819417524] [2020-12-22 04:20:58,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754729473] [2020-12-22 04:20:58,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:20:59,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-12-22 04:20:59,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 04:20:59,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-22 04:20:59,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:20:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2020-12-22 04:20:59,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 04:20:59,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2020-12-22 04:20:59,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71114915] [2020-12-22 04:20:59,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 04:20:59,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:20:59,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 04:20:59,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-12-22 04:20:59,363 INFO L87 Difference]: Start difference. First operand 270 states and 347 transitions. Second operand 8 states. [2020-12-22 04:20:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:20:59,526 INFO L93 Difference]: Finished difference Result 273 states and 350 transitions. [2020-12-22 04:20:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 04:20:59,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-12-22 04:20:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:20:59,527 INFO L225 Difference]: With dead ends: 273 [2020-12-22 04:20:59,527 INFO L226 Difference]: Without dead ends: 0 [2020-12-22 04:20:59,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-12-22 04:20:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-22 04:20:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-22 04:20:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-22 04:20:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-22 04:20:59,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2020-12-22 04:20:59,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:20:59,530 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-22 04:20:59,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 04:20:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-22 04:20:59,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-22 04:20:59,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-22 04:20:59,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-22 04:20:59,876 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 186 [2020-12-22 04:21:01,284 WARN L197 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 502 DAG size of output: 448 [2020-12-22 04:21:01,497 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 215 [2020-12-22 04:21:01,666 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 224 [2020-12-22 04:21:05,135 WARN L197 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 183 DAG size of output: 101 [2020-12-22 04:21:26,718 WARN L197 SmtUtils]: Spent 21.58 s on a formula simplification. DAG size of input: 439 DAG size of output: 86 [2020-12-22 04:21:28,722 WARN L197 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 215 DAG size of output: 83 [2020-12-22 04:21:30,555 WARN L197 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 224 DAG size of output: 81 [2020-12-22 04:21:38,128 WARN L197 SmtUtils]: Spent 7.57 s on a formula simplification. DAG size of input: 178 DAG size of output: 129 [2020-12-22 04:21:38,133 INFO L189 CegarLoopUtils]: For program point L15(lines 15 17) no Hoare annotation was computed. [2020-12-22 04:21:38,134 INFO L185 CegarLoopUtils]: At program point L15-2(lines 14 19) the Hoare annotation is: (let ((.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse12 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (let ((.cse0 (= (select |#valid| |~#array~0.base|) 1)) (.cse2 (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= |~#array~0.base| 0) (= (select |#valid| 0) 0)) (= (select |#valid| |#t~string0.base|) 1) (= (select |#valid| |#t~string1.base|) 1)))) (.cse3 (= 5 ~n~0)) (.cse4 (= (select .cse12 (+ |ULTIMATE.start_main_~#array~1.offset| 4)) 1)) (.cse5 (= 3 (select .cse12 (+ |ULTIMATE.start_main_~#array~1.offset| 12)))) (.cse6 (= (select .cse12 (+ |ULTIMATE.start_main_~#array~1.offset| 16)) 4)) (.cse8 (let ((.cse13 (<= ~n~0 ULTIMATE.start_SelectionSort_~lh~0)) (.cse14 (<= ULTIMATE.start_SelectionSort_~i~0 (+ ULTIMATE.start_SelectionSort_~lh~0 1))) (.cse15 (<= 0 ULTIMATE.start_main_~i~1)) (.cse16 (<= 5 ~n~0))) (or (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) .cse13 (= (select .cse12 0) 0) .cse14 .cse15 .cse16 (<= ULTIMATE.start_main_~i~1 4)) (and .cse13 .cse1 (= ULTIMATE.start_main_~i~1 0) .cse14 .cse15 .cse16 (= (select .cse12 (+ |ULTIMATE.start_main_~#array~1.offset| (* ULTIMATE.start_main_~i~1 4))) 0))))) (.cse7 (= 2 (select .cse12 (+ |ULTIMATE.start_main_~#array~1.offset| 8)))) (.cse9 (not (= |ULTIMATE.start_main_~#array~1.base| |~#array~0.base|))) (.cse10 (= |~#array~0.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~#array~1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 (<= 3 ULTIMATE.start_main_~i~1) .cse6 .cse8 .cse7 .cse9 .cse10 .cse11)))) [2020-12-22 04:21:38,134 INFO L189 CegarLoopUtils]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2020-12-22 04:21:38,135 INFO L185 CegarLoopUtils]: At program point L44-3(lines 44 45) the Hoare annotation is: (let ((.cse19 (select |#memory_int| |~#array~0.base|))) (let ((.cse20 (select .cse19 (+ |~#array~0.offset| 4))) (.cse18 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (let ((.cse4 (= |~#array~0.offset| 0)) (.cse0 (= (select .cse19 (+ |~#array~0.offset| 16)) 0)) (.cse1 (= (select .cse19 |~#array~0.offset|) 0)) (.cse12 (= 3 (select .cse18 (+ |ULTIMATE.start_main_~#array~1.offset| 12)))) (.cse2 (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= (select |#valid| 0) 0)) (not (= |#t~string1.base| |~#array~0.base|)) (= (select |#valid| |#t~string0.base|) 1) (not (= |#t~string0.base| |~#array~0.base|)) (= (select |#valid| |#t~string1.base|) 1)))) (.cse3 (= (select .cse19 (+ |~#array~0.offset| 12)) 0)) (.cse16 (<= 0 |~#array~0.offset|)) (.cse5 (= |ULTIMATE.start_main_~#array~1.offset| 0)) (.cse6 (= (select |#valid| |~#array~0.base|) 1)) (.cse7 (= 5 ~n~0)) (.cse15 (<= |~#array~0.offset| 0)) (.cse8 (<= 0 .cse20)) (.cse9 (< 1 |~#array~0.base|)) (.cse13 (= (select .cse18 (+ |ULTIMATE.start_main_~#array~1.offset| 16)) 4)) (.cse10 (<= .cse20 0)) (.cse11 (= 0 (select .cse19 (+ |~#array~0.offset| 8))))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_main_~#array~1.base| |~#array~0.base|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_main_~i~1 4) .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_main_~i~1 2) .cse8 .cse9 .cse13 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_main_~i~1 1) (div (+ |~#array~0.offset| (* |ULTIMATE.start_main_~#array~1.offset| (- 1)) 8) 4)) (exists ((v_ULTIMATE.start_main_~i~1_56 Int) (v_ULTIMATE.start_main_~i~1_55 Int)) (let ((.cse14 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (and (= (select .cse14 (+ |ULTIMATE.start_main_~#array~1.offset| (* v_ULTIMATE.start_main_~i~1_56 4))) v_ULTIMATE.start_main_~i~1_56) (<= (+ ULTIMATE.start_main_~i~1 1) v_ULTIMATE.start_main_~i~1_56) (<= (+ v_ULTIMATE.start_main_~i~1_56 1) v_ULTIMATE.start_main_~i~1_55) (= (select .cse14 (+ |ULTIMATE.start_main_~#array~1.offset| (* v_ULTIMATE.start_main_~i~1_55 4))) v_ULTIMATE.start_main_~i~1_55) (<= v_ULTIMATE.start_main_~i~1_55 3)))) .cse5 .cse6 (<= 1 ULTIMATE.start_main_~i~1) .cse7 .cse15 .cse8 .cse9 .cse13 .cse10 .cse11) (and (= ULTIMATE.start_main_~i~1 0) .cse0 .cse1 .cse2 .cse3 .cse16 (exists ((v_ULTIMATE.start_main_~i~1_57 Int) (v_ULTIMATE.start_main_~i~1_56 Int) (v_ULTIMATE.start_main_~i~1_55 Int)) (let ((.cse17 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (and (= (select .cse17 (+ |ULTIMATE.start_main_~#array~1.offset| (* v_ULTIMATE.start_main_~i~1_56 4))) v_ULTIMATE.start_main_~i~1_56) (<= (+ v_ULTIMATE.start_main_~i~1_56 1) v_ULTIMATE.start_main_~i~1_55) (<= (+ v_ULTIMATE.start_main_~i~1_57 1) v_ULTIMATE.start_main_~i~1_56) (= (select .cse17 (+ |ULTIMATE.start_main_~#array~1.offset| (* v_ULTIMATE.start_main_~i~1_55 4))) v_ULTIMATE.start_main_~i~1_55) (= (select .cse17 (+ |ULTIMATE.start_main_~#array~1.offset| (* v_ULTIMATE.start_main_~i~1_57 4))) v_ULTIMATE.start_main_~i~1_57) (<= v_ULTIMATE.start_main_~i~1_55 3) (<= (+ ULTIMATE.start_main_~i~1 1) v_ULTIMATE.start_main_~i~1_57)))) .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse13 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~i~1 3) .cse16 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 (<= 3 ULTIMATE.start_main_~i~1) .cse13 .cse10 .cse11) (and (= (select .cse18 0) 0) .cse0 .cse1 .cse12 .cse2 .cse3 .cse16 (exists ((v_ULTIMATE.start_main_~i~1_40 Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|) (+ (* v_ULTIMATE.start_main_~i~1_40 4) |ULTIMATE.start_main_~#array~1.offset|)) v_ULTIMATE.start_main_~i~1_40) (<= v_ULTIMATE.start_main_~i~1_40 1) (<= (+ ULTIMATE.start_main_~i~1 1) v_ULTIMATE.start_main_~i~1_40))) .cse5 .cse6 .cse7 .cse15 (= (select .cse18 (+ |ULTIMATE.start_main_~#array~1.offset| 4)) 1) .cse8 .cse9 (= 2 (select .cse18 (+ |ULTIMATE.start_main_~#array~1.offset| 8))) .cse13 .cse10 .cse11))))) [2020-12-22 04:21:38,135 INFO L189 CegarLoopUtils]: For program point L44-4(lines 44 45) no Hoare annotation was computed. [2020-12-22 04:21:38,135 INFO L189 CegarLoopUtils]: For program point L40(lines 40 52) no Hoare annotation was computed. [2020-12-22 04:21:38,135 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-22 04:21:38,135 INFO L189 CegarLoopUtils]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2020-12-22 04:21:38,135 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-22 04:21:38,136 INFO L185 CegarLoopUtils]: At program point L32-3(lines 32 33) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (let ((.cse0 (= (select .cse15 0) 0)) (.cse1 (= 3 (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 12)))) (.cse2 (not (= |ULTIMATE.start_main_~#array~1.base| |~#array~0.base|))) (.cse4 (<= 0 |~#array~0.offset|)) (.cse5 (exists ((v_ULTIMATE.start_main_~i~1_40 Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|) (+ (* v_ULTIMATE.start_main_~i~1_40 4) |ULTIMATE.start_main_~#array~1.offset|)) v_ULTIMATE.start_main_~i~1_40) (<= v_ULTIMATE.start_main_~i~1_40 1) (<= (+ ULTIMATE.start_main_~i~1 1) v_ULTIMATE.start_main_~i~1_40)))) (.cse6 (= |ULTIMATE.start_main_~#array~1.offset| 0)) (.cse7 (= (select |#valid| |~#array~0.base|) 1)) (.cse8 (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= |~#array~0.base| 0) (= (select |#valid| 0) 0)) (= (select |#valid| |#t~string0.base|) 1) (= (select |#valid| |#t~string1.base|) 1)))) (.cse9 (= 5 ~n~0)) (.cse10 (let ((.cse16 (select |#memory_int| |~#array~0.base|))) (<= (select .cse16 (+ (* ULTIMATE.start_SelectionSort_~rh~0 4) |~#array~0.offset|)) (select .cse16 (+ (* ULTIMATE.start_SelectionSort_~i~0 4) |~#array~0.offset| (- 4)))))) (.cse11 (<= |~#array~0.offset| 0)) (.cse12 (= (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 4)) 1)) (.cse13 (= 2 (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 8)))) (.cse14 (= (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 16)) 4)) (.cse3 (+ ULTIMATE.start_SelectionSort_~lh~0 1))) (or (and (< ULTIMATE.start_SelectionSort_~lh~0 ~n~0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_SelectionSort_~i~0 .cse3) .cse4 .cse5 .cse6 (<= .cse3 ULTIMATE.start_SelectionSort_~i~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= (+ ULTIMATE.start_SelectionSort_~lh~0 2) ULTIMATE.start_SelectionSort_~i~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< .cse3 ~n~0))))) [2020-12-22 04:21:38,136 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-22 04:21:38,136 INFO L189 CegarLoopUtils]: For program point L32-4(lines 32 33) no Hoare annotation was computed. [2020-12-22 04:21:38,136 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2020-12-22 04:21:38,136 INFO L189 CegarLoopUtils]: For program point L16(line 16) no Hoare annotation was computed. [2020-12-22 04:21:38,137 INFO L189 CegarLoopUtils]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2020-12-22 04:21:38,137 INFO L185 CegarLoopUtils]: At program point L49-3(lines 49 50) the Hoare annotation is: (let ((.cse13 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (let ((.cse14 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse0 (<= ~n~0 ULTIMATE.start_SelectionSort_~lh~0)) (.cse15 (= (select .cse13 0) 0)) (.cse1 (= 3 (select .cse13 (+ |ULTIMATE.start_main_~#array~1.offset| 12)))) (.cse2 (<= ULTIMATE.start_SelectionSort_~i~0 (+ ULTIMATE.start_SelectionSort_~lh~0 1))) (.cse3 (not (= |ULTIMATE.start_main_~#array~1.base| |~#array~0.base|))) (.cse4 (<= 0 ULTIMATE.start_main_~i~1)) (.cse5 (= |~#array~0.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~#array~1.offset| 0)) (.cse7 (= (select |#valid| |~#array~0.base|) 1)) (.cse8 (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= |~#array~0.base| 0) (= (select |#valid| 0) 0)) (= (select |#valid| |#t~string0.base|) 1) (= (select |#valid| |#t~string1.base|) 1)))) (.cse9 (= 5 ~n~0)) (.cse10 (= (select .cse13 (+ |ULTIMATE.start_main_~#array~1.offset| 4)) 1)) (.cse11 (= (select .cse13 (+ |ULTIMATE.start_main_~#array~1.offset| 16)) 4)) (.cse12 (= 2 (select .cse13 (+ |ULTIMATE.start_main_~#array~1.offset| 8)))) (.cse16 (<= 5 ~n~0))) (or (and .cse0 (= ULTIMATE.start_main_~i~1 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select .cse13 (+ |ULTIMATE.start_main_~#array~1.offset| (* ULTIMATE.start_main_~i~1 4))) 0)) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 4 ULTIMATE.start_main_~i~1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2020-12-22 04:21:38,137 INFO L189 CegarLoopUtils]: For program point L49-4(lines 49 50) no Hoare annotation was computed. [2020-12-22 04:21:38,137 INFO L189 CegarLoopUtils]: For program point L33(line 33) no Hoare annotation was computed. [2020-12-22 04:21:38,137 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-22 04:21:38,137 INFO L189 CegarLoopUtils]: For program point L30-2(lines 30 37) no Hoare annotation was computed. [2020-12-22 04:21:38,137 INFO L185 CegarLoopUtils]: At program point L30-3(lines 30 37) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (let ((.cse6 (+ ULTIMATE.start_SelectionSort_~lh~0 1)) (.cse2 (not (= |ULTIMATE.start_main_~#array~1.base| |~#array~0.base|))) (.cse3 (= |~#array~0.offset| 0)) (.cse8 (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= |~#array~0.base| 0) (= (select |#valid| 0) 0)) (= (select |#valid| |#t~string0.base|) 1) (= (select |#valid| |#t~string1.base|) 1)))) (.cse0 (= (select .cse15 0) 0)) (.cse1 (= 3 (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 12)))) (.cse4 (exists ((v_ULTIMATE.start_main_~i~1_40 Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|) (+ (* v_ULTIMATE.start_main_~i~1_40 4) |ULTIMATE.start_main_~#array~1.offset|)) v_ULTIMATE.start_main_~i~1_40) (<= v_ULTIMATE.start_main_~i~1_40 1) (<= (+ ULTIMATE.start_main_~i~1 1) v_ULTIMATE.start_main_~i~1_40)))) (.cse5 (= |ULTIMATE.start_main_~#array~1.offset| 0)) (.cse7 (= (select |#valid| |~#array~0.base|) 1)) (.cse9 (= 5 ~n~0)) (.cse10 (= (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 4)) 1)) (.cse12 (= 2 (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 8)))) (.cse11 (= (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 16)) 4))) (or (and (< ULTIMATE.start_SelectionSort_~lh~0 ~n~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 ULTIMATE.start_SelectionSort_~i~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ~n~0 ULTIMATE.start_SelectionSort_~lh~0) .cse0 .cse1 (<= ULTIMATE.start_SelectionSort_~i~0 .cse6) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (select |#memory_int| |~#array~0.base|))) (let ((.cse14 (select .cse13 (+ |~#array~0.offset| 4)))) (and .cse0 (= (select .cse13 (+ |~#array~0.offset| 16)) 0) (= (select .cse13 |~#array~0.offset|) 0) .cse1 (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= (select |#valid| 0) 0)) (not (= |#t~string1.base| |~#array~0.base|)) (= (select |#valid| |#t~string0.base|) 1) (not (= |#t~string0.base| |~#array~0.base|)) (= (select |#valid| |#t~string1.base|) 1))) (= (select .cse13 (+ |~#array~0.offset| 12)) 0) (<= 0 |~#array~0.offset|) .cse4 .cse5 .cse7 .cse9 (<= |~#array~0.offset| 0) .cse10 (<= 0 .cse14) (= ULTIMATE.start_SelectionSort_~lh~0 0) (< 1 |~#array~0.base|) .cse12 .cse11 (<= .cse14 0) (= 0 (select .cse13 (+ |~#array~0.offset| 8))))))))) [2020-12-22 04:21:38,138 INFO L189 CegarLoopUtils]: For program point L26(lines 26 38) no Hoare annotation was computed. [2020-12-22 04:21:38,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,200 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,200 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,200 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 04:21:38 BoogieIcfgContainer [2020-12-22 04:21:38,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 04:21:38,283 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 04:21:38,283 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 04:21:38,283 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 04:21:38,283 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:17:26" (3/4) ... [2020-12-22 04:21:38,287 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-22 04:21:38,298 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-22 04:21:38,299 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-22 04:21:38,299 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-22 04:21:38,299 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 04:21:38,327 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && !(array == array)) && array == 0) && array == 0) && \valid[array] == 1) && 5 == n) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 4] <= 0) && i == 4) && 0 == unknown-#memory_int-unknown[array][array + 8]) || ((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && array == 0) && array == 0) && \valid[array] == 1) && 5 == n) && i == 2) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && i + 1 <= (array + array * -1 + 8) / 4) && (\exists v_ULTIMATE.start_main_~i~1_56 : int, v_ULTIMATE.start_main_~i~1_55 : int :: (((unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_56 * 4] == v_ULTIMATE.start_main_~i~1_56 && i + 1 <= v_ULTIMATE.start_main_~i~1_56) && v_ULTIMATE.start_main_~i~1_56 + 1 <= v_ULTIMATE.start_main_~i~1_55) && unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_55 * 4] == v_ULTIMATE.start_main_~i~1_55) && v_ULTIMATE.start_main_~i~1_55 <= 3)) && array == 0) && \valid[array] == 1) && 1 <= i) && 5 == n) && array <= 0) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((i == 0 && unknown-#memory_int-unknown[array][array + 16] == 0) && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_57 : int, v_ULTIMATE.start_main_~i~1_56 : int, v_ULTIMATE.start_main_~i~1_55 : int :: (((((unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_56 * 4] == v_ULTIMATE.start_main_~i~1_56 && v_ULTIMATE.start_main_~i~1_56 + 1 <= v_ULTIMATE.start_main_~i~1_55) && v_ULTIMATE.start_main_~i~1_57 + 1 <= v_ULTIMATE.start_main_~i~1_56) && unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_55 * 4] == v_ULTIMATE.start_main_~i~1_55) && unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_57 * 4] == v_ULTIMATE.start_main_~i~1_57) && v_ULTIMATE.start_main_~i~1_55 <= 3) && i + 1 <= v_ULTIMATE.start_main_~i~1_57)) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && i <= 3) && 0 <= array) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && 3 <= i) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || ((((((((((((((((((unknown-#memory_int-unknown[array][0] == 0 && unknown-#memory_int-unknown[array][array + 16] == 0) && unknown-#memory_int-unknown[array][array] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8]) [2020-12-22 04:21:38,328 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((lh < n && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(array == array)) && array == 0) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && lh + 1 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) || (((((((((((((n <= lh && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && array == 0) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((((((unknown-#memory_int-unknown[array][0] == 0 && unknown-#memory_int-unknown[array][array + 16] == 0) && unknown-#memory_int-unknown[array][array] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && lh == 0) && 1 < array) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8]) [2020-12-22 04:21:38,328 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((n <= lh && i == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && 0 <= i) && array == 0) && array == 0) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + i * 4] == 0) || ((((((((((((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && 0 <= i) && array == 0) && array == 0) && \valid[array] == 1) && 1 == cond) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && 5 <= n)) || ((((((((((((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && 0 <= i) && array == 0) && array == 0) && 4 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && 5 <= n) [2020-12-22 04:21:38,328 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((lh < n && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(array == array)) && i <= lh + 1) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && lh + 1 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][rh * 4 + array] <= unknown-#memory_int-unknown[array][i * 4 + array + -4]) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) || (((((((((((((((unknown-#memory_int-unknown[array][0] == 0 && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(array == array)) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && lh + 2 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][rh * 4 + array] <= unknown-#memory_int-unknown[array][i * 4 + array + -4]) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) && lh + 1 < n) [2020-12-22 04:21:38,329 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\valid[array] == 1 && 1 == cond) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && 3 == unknown-#memory_int-unknown[array][array + 12]) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && (((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && i <= 4) || ((((((n <= lh && 1 == cond) && i == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && unknown-#memory_int-unknown[array][array + i * 4] == 0))) && !(array == array)) && array == 0) && array == 0) || (((((((((((\valid[array] == 1 && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && 3 == unknown-#memory_int-unknown[array][array + 12]) && 3 <= i) && unknown-#memory_int-unknown[array][array + 16] == 4) && (((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && i <= 4) || ((((((n <= lh && 1 == cond) && i == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && unknown-#memory_int-unknown[array][array + i * 4] == 0))) && 2 == unknown-#memory_int-unknown[array][array + 8]) && !(array == array)) && array == 0) && array == 0) [2020-12-22 04:21:38,351 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/eureka_05.i-witness.graphml [2020-12-22 04:21:38,351 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 04:21:38,351 INFO L168 Benchmark]: Toolchain (without parser) took 252684.75 ms. Allocated memory was 151.0 MB in the beginning and 239.1 MB in the end (delta: 88.1 MB). Free memory was 126.7 MB in the beginning and 146.1 MB in the end (delta: -19.4 MB). Peak memory consumption was 69.6 MB. Max. memory is 8.0 GB. [2020-12-22 04:21:38,352 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 151.0 MB. Free memory is still 122.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 04:21:38,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.55 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 116.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-12-22 04:21:38,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.46 ms. Allocated memory is still 151.0 MB. Free memory was 116.5 MB in the beginning and 114.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 04:21:38,358 INFO L168 Benchmark]: Boogie Preprocessor took 29.15 ms. Allocated memory is still 151.0 MB. Free memory was 114.9 MB in the beginning and 113.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-22 04:21:38,358 INFO L168 Benchmark]: RCFGBuilder took 364.82 ms. Allocated memory is still 151.0 MB. Free memory was 113.7 MB in the beginning and 98.8 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-22 04:21:38,359 INFO L168 Benchmark]: TraceAbstraction took 251892.34 ms. Allocated memory was 151.0 MB in the beginning and 239.1 MB in the end (delta: 88.1 MB). Free memory was 98.4 MB in the beginning and 148.8 MB in the end (delta: -50.3 MB). Peak memory consumption was 116.0 MB. Max. memory is 8.0 GB. [2020-12-22 04:21:38,359 INFO L168 Benchmark]: Witness Printer took 68.21 ms. Allocated memory is still 239.1 MB. Free memory was 148.8 MB in the beginning and 146.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 04:21:38,360 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 151.0 MB. Free memory is still 122.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 282.55 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 116.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 40.46 ms. Allocated memory is still 151.0 MB. Free memory was 116.5 MB in the beginning and 114.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 29.15 ms. Allocated memory is still 151.0 MB. Free memory was 114.9 MB in the beginning and 113.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 364.82 ms. Allocated memory is still 151.0 MB. Free memory was 113.7 MB in the beginning and 98.8 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 251892.34 ms. Allocated memory was 151.0 MB in the beginning and 239.1 MB in the end (delta: 88.1 MB). Free memory was 98.4 MB in the beginning and 148.8 MB in the end (delta: -50.3 MB). Peak memory consumption was 116.0 MB. Max. memory is 8.0 GB. * Witness Printer took 68.21 ms. Allocated memory is still 239.1 MB. Free memory was 148.8 MB in the beginning and 146.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2020-12-22 04:21:38,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] Derived loop invariant: ((((((((((((((lh < n && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(array == array)) && array == 0) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && lh + 1 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) || (((((((((((((n <= lh && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && array == 0) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((((((unknown-#memory_int-unknown[array][0] == 0 && unknown-#memory_int-unknown[array][array + 16] == 0) && unknown-#memory_int-unknown[array][array] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && lh == 0) && 1 < array) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8]) - InvariantResult [Line: 14]: Loop Invariant [2020-12-22 04:21:38,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] Derived loop invariant: (((((((((((\valid[array] == 1 && 1 == cond) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && 3 == unknown-#memory_int-unknown[array][array + 12]) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && (((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && i <= 4) || ((((((n <= lh && 1 == cond) && i == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && unknown-#memory_int-unknown[array][array + i * 4] == 0))) && !(array == array)) && array == 0) && array == 0) || (((((((((((\valid[array] == 1 && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && 3 == unknown-#memory_int-unknown[array][array + 12]) && 3 <= i) && unknown-#memory_int-unknown[array][array + 16] == 4) && (((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && i <= 4) || ((((((n <= lh && 1 == cond) && i == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && unknown-#memory_int-unknown[array][array + i * 4] == 0))) && 2 == unknown-#memory_int-unknown[array][array + 8]) && !(array == array)) && array == 0) && array == 0) - InvariantResult [Line: 32]: Loop Invariant [2020-12-22 04:21:38,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] Derived loop invariant: ((((((((((((((((lh < n && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(array == array)) && i <= lh + 1) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && lh + 1 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][rh * 4 + array] <= unknown-#memory_int-unknown[array][i * 4 + array + -4]) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) || (((((((((((((((unknown-#memory_int-unknown[array][0] == 0 && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(array == array)) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && lh + 2 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][rh * 4 + array] <= unknown-#memory_int-unknown[array][i * 4 + array + -4]) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) && lh + 1 < n) - InvariantResult [Line: 49]: Loop Invariant [2020-12-22 04:21:38,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] Derived loop invariant: (((((((((((((((n <= lh && i == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && 0 <= i) && array == 0) && array == 0) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + i * 4] == 0) || ((((((((((((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && 0 <= i) && array == 0) && array == 0) && \valid[array] == 1) && 1 == cond) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && 5 <= n)) || ((((((((((((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && 0 <= i) && array == 0) && array == 0) && 4 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && 5 <= n) - InvariantResult [Line: 44]: Loop Invariant [2020-12-22 04:21:38,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-22 04:21:38,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-22 04:21:38,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-22 04:21:38,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-22 04:21:38,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-22 04:21:38,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-22 04:21:38,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] Derived loop invariant: (((((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && !(array == array)) && array == 0) && array == 0) && \valid[array] == 1) && 5 == n) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 4] <= 0) && i == 4) && 0 == unknown-#memory_int-unknown[array][array + 8]) || ((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && array == 0) && array == 0) && \valid[array] == 1) && 5 == n) && i == 2) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && i + 1 <= (array + array * -1 + 8) / 4) && (\exists v_ULTIMATE.start_main_~i~1_56 : int, v_ULTIMATE.start_main_~i~1_55 : int :: (((unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_56 * 4] == v_ULTIMATE.start_main_~i~1_56 && i + 1 <= v_ULTIMATE.start_main_~i~1_56) && v_ULTIMATE.start_main_~i~1_56 + 1 <= v_ULTIMATE.start_main_~i~1_55) && unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_55 * 4] == v_ULTIMATE.start_main_~i~1_55) && v_ULTIMATE.start_main_~i~1_55 <= 3)) && array == 0) && \valid[array] == 1) && 1 <= i) && 5 == n) && array <= 0) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((i == 0 && unknown-#memory_int-unknown[array][array + 16] == 0) && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_57 : int, v_ULTIMATE.start_main_~i~1_56 : int, v_ULTIMATE.start_main_~i~1_55 : int :: (((((unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_56 * 4] == v_ULTIMATE.start_main_~i~1_56 && v_ULTIMATE.start_main_~i~1_56 + 1 <= v_ULTIMATE.start_main_~i~1_55) && v_ULTIMATE.start_main_~i~1_57 + 1 <= v_ULTIMATE.start_main_~i~1_56) && unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_55 * 4] == v_ULTIMATE.start_main_~i~1_55) && unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_57 * 4] == v_ULTIMATE.start_main_~i~1_57) && v_ULTIMATE.start_main_~i~1_55 <= 3) && i + 1 <= v_ULTIMATE.start_main_~i~1_57)) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && i <= 3) && 0 <= array) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && 3 <= i) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || ((((((((((((((((((unknown-#memory_int-unknown[array][0] == 0 && unknown-#memory_int-unknown[array][array + 16] == 0) && unknown-#memory_int-unknown[array][array] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 213.2s, OverallIterations: 23, TraceHistogramMax: 10, AutomataDifference: 160.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 38.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 421 SDtfs, 2630 SDslu, 2942 SDs, 0 SdLazy, 6983 SolverSat, 1206 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 64.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1789 GetRequests, 1049 SyntacticMatches, 48 SemanticMatches, 692 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9431 ImplicationChecksByTransitivity, 122.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 355 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 113 NumberOfFragments, 2177 HoareAnnotationTreeSize, 5 FomulaSimplifications, 517253 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 5 FomulaSimplificationsInter, 365773 FormulaSimplificationTreeSizeReductionInter, 36.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 44.7s InterpolantComputationTime, 2397 NumberOfCodeBlocks, 2250 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 2354 ConstructedInterpolants, 251 QuantifiedInterpolants, 2438116 SizeOfPredicates, 224 NumberOfNonLiveVariables, 3578 ConjunctsInSsa, 425 ConjunctsInUnsatCore, 43 InterpolantComputations, 5 PerfectInterpolantSequences, 5396/6849 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...