/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-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 07:10:33,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 07:10:33,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 07:10:33,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 07:10:33,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 07:10:33,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 07:10:33,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 07:10:33,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 07:10:33,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 07:10:33,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 07:10:33,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 07:10:33,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 07:10:33,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 07:10:33,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 07:10:33,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 07:10:33,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 07:10:33,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 07:10:33,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 07:10:33,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 07:10:33,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 07:10:33,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 07:10:33,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 07:10:33,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 07:10:33,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 07:10:33,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 07:10:33,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 07:10:33,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 07:10:33,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 07:10:33,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 07:10:33,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 07:10:33,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 07:10:33,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 07:10:33,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 07:10:33,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 07:10:33,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 07:10:33,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 07:10:33,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 07:10:33,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 07:10:33,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 07:10:33,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 07:10:33,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 07:10:33,723 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 07:10:33,775 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 07:10:33,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 07:10:33,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 07:10:33,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 07:10:33,780 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 07:10:33,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 07:10:33,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 07:10:33,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 07:10:33,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 07:10:33,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 07:10:33,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 07:10:33,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 07:10:33,783 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 07:10:33,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 07:10:33,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 07:10:33,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 07:10:33,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 07:10:33,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 07:10:33,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 07:10:33,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 07:10:33,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 07:10:33,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 07:10:33,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 07:10:33,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 07:10:33,785 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 07:10:33,785 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-bitabs/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-23 07:10:34,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 07:10:34,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 07:10:34,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 07:10:34,172 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 07:10:34,173 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 07:10:34,173 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2020-12-23 07:10:34,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3e1a33cae/6c76345f8192488990ceae7cbbe492a6/FLAG3b98c1f99 [2020-12-23 07:10:34,913 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 07:10:34,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2020-12-23 07:10:34,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3e1a33cae/6c76345f8192488990ceae7cbbe492a6/FLAG3b98c1f99 [2020-12-23 07:10:35,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3e1a33cae/6c76345f8192488990ceae7cbbe492a6 [2020-12-23 07:10:35,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 07:10:35,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 07:10:35,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 07:10:35,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 07:10:35,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 07:10:35,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 07:10:35" (1/1) ... [2020-12-23 07:10:35,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235af214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35, skipping insertion in model container [2020-12-23 07:10:35,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 07:10:35" (1/1) ... [2020-12-23 07:10:35,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 07:10:35,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 07:10:35,453 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c[468,481] left hand side expression in assignment: lhs: VariableLHS[~last~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st~0,] left hand side expression in assignment: lhs: VariableLHS[~c~0,] left hand side expression in assignment: lhs: VariableLHS[~st~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] [2020-12-23 07:10:35,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 07:10:35,493 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 07:10:35,515 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c[468,481] left hand side expression in assignment: lhs: VariableLHS[~last~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st~0,] left hand side expression in assignment: lhs: VariableLHS[~c~0,] left hand side expression in assignment: lhs: VariableLHS[~st~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] [2020-12-23 07:10:35,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 07:10:35,566 INFO L208 MainTranslator]: Completed translation [2020-12-23 07:10:35,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35 WrapperNode [2020-12-23 07:10:35,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 07:10:35,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 07:10:35,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 07:10:35,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 07:10:35,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35" (1/1) ... [2020-12-23 07:10:35,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35" (1/1) ... [2020-12-23 07:10:35,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 07:10:35,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 07:10:35,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 07:10:35,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 07:10:35,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35" (1/1) ... [2020-12-23 07:10:35,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35" (1/1) ... [2020-12-23 07:10:35,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35" (1/1) ... [2020-12-23 07:10:35,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35" (1/1) ... [2020-12-23 07:10:35,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35" (1/1) ... [2020-12-23 07:10:35,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35" (1/1) ... [2020-12-23 07:10:35,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35" (1/1) ... [2020-12-23 07:10:35,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 07:10:35,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 07:10:35,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 07:10:35,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 07:10:35,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 07:10:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 07:10:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 07:10:35,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 07:10:36,322 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 07:10:36,322 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-23 07:10:36,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:10:36 BoogieIcfgContainer [2020-12-23 07:10:36,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 07:10:36,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 07:10:36,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 07:10:36,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 07:10:36,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 07:10:35" (1/3) ... [2020-12-23 07:10:36,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6045bc6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 07:10:36, skipping insertion in model container [2020-12-23 07:10:36,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:10:35" (2/3) ... [2020-12-23 07:10:36,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6045bc6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 07:10:36, skipping insertion in model container [2020-12-23 07:10:36,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:10:36" (3/3) ... [2020-12-23 07:10:36,333 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2020-12-23 07:10:36,340 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 07:10:36,345 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 07:10:36,364 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 07:10:36,390 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 07:10:36,390 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 07:10:36,390 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 07:10:36,391 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 07:10:36,391 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 07:10:36,391 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 07:10:36,391 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 07:10:36,391 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 07:10:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-12-23 07:10:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 07:10:36,412 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:36,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:36,414 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:36,421 INFO L82 PathProgramCache]: Analyzing trace with hash -493598204, now seen corresponding path program 1 times [2020-12-23 07:10:36,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:36,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643117722] [2020-12-23 07:10:36,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:36,585 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-23 07:10:36,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643117722] [2020-12-23 07:10:36,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 07:10:36,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 07:10:36,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510953181] [2020-12-23 07:10:36,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 07:10:36,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:36,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 07:10:36,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 07:10:36,609 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-12-23 07:10:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:36,626 INFO L93 Difference]: Finished difference Result 33 states and 53 transitions. [2020-12-23 07:10:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 07:10:36,628 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-12-23 07:10:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:36,637 INFO L225 Difference]: With dead ends: 33 [2020-12-23 07:10:36,637 INFO L226 Difference]: Without dead ends: 16 [2020-12-23 07:10:36,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 07:10:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-12-23 07:10:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-12-23 07:10:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-12-23 07:10:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-12-23 07:10:36,675 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 12 [2020-12-23 07:10:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:36,676 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-12-23 07:10:36,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 07:10:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-12-23 07:10:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 07:10:36,677 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:36,677 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:36,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 07:10:36,678 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:36,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:36,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2059231113, now seen corresponding path program 1 times [2020-12-23 07:10:36,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:36,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819968500] [2020-12-23 07:10:36,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:36,779 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-23 07:10:36,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819968500] [2020-12-23 07:10:36,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 07:10:36,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 07:10:36,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112697712] [2020-12-23 07:10:36,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 07:10:36,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:36,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 07:10:36,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 07:10:36,783 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 4 states. [2020-12-23 07:10:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:36,885 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2020-12-23 07:10:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 07:10:36,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-23 07:10:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:36,887 INFO L225 Difference]: With dead ends: 32 [2020-12-23 07:10:36,887 INFO L226 Difference]: Without dead ends: 20 [2020-12-23 07:10:36,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 07:10:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-23 07:10:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2020-12-23 07:10:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-23 07:10:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-12-23 07:10:36,893 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2020-12-23 07:10:36,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:36,894 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-12-23 07:10:36,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 07:10:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-12-23 07:10:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 07:10:36,895 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:36,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:36,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 07:10:36,895 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:36,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:36,896 INFO L82 PathProgramCache]: Analyzing trace with hash 573171571, now seen corresponding path program 1 times [2020-12-23 07:10:36,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:36,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914715129] [2020-12-23 07:10:36,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 07:10:36,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914715129] [2020-12-23 07:10:36,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 07:10:36,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 07:10:36,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781947665] [2020-12-23 07:10:36,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 07:10:36,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:36,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 07:10:36,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 07:10:36,945 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 3 states. [2020-12-23 07:10:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:36,986 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2020-12-23 07:10:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 07:10:36,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-12-23 07:10:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:36,987 INFO L225 Difference]: With dead ends: 38 [2020-12-23 07:10:36,988 INFO L226 Difference]: Without dead ends: 25 [2020-12-23 07:10:36,988 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-23 07:10:36,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-23 07:10:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2020-12-23 07:10:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-12-23 07:10:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-12-23 07:10:36,993 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 15 [2020-12-23 07:10:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:36,994 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-12-23 07:10:36,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 07:10:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-12-23 07:10:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 07:10:36,995 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:36,995 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:36,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 07:10:36,995 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash 630429873, now seen corresponding path program 1 times [2020-12-23 07:10:36,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:36,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693053514] [2020-12-23 07:10:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 07:10:37,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693053514] [2020-12-23 07:10:37,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 07:10:37,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 07:10:37,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995546760] [2020-12-23 07:10:37,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 07:10:37,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:37,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 07:10:37,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 07:10:37,098 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand 4 states. [2020-12-23 07:10:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:37,137 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2020-12-23 07:10:37,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 07:10:37,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-23 07:10:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:37,140 INFO L225 Difference]: With dead ends: 46 [2020-12-23 07:10:37,140 INFO L226 Difference]: Without dead ends: 32 [2020-12-23 07:10:37,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 07:10:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-23 07:10:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-12-23 07:10:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-12-23 07:10:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2020-12-23 07:10:37,150 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 15 [2020-12-23 07:10:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:37,150 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2020-12-23 07:10:37,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 07:10:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2020-12-23 07:10:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 07:10:37,151 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:37,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:37,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 07:10:37,152 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash 630489455, now seen corresponding path program 1 times [2020-12-23 07:10:37,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:37,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037119301] [2020-12-23 07:10:37,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:37,214 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-23 07:10:37,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037119301] [2020-12-23 07:10:37,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907237085] [2020-12-23 07:10:37,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:37,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 07:10:37,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:37,386 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-23 07:10:37,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:37,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-12-23 07:10:37,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304825065] [2020-12-23 07:10:37,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 07:10:37,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:37,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 07:10:37,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-12-23 07:10:37,390 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand 7 states. [2020-12-23 07:10:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:37,543 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2020-12-23 07:10:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 07:10:37,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-23 07:10:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:37,547 INFO L225 Difference]: With dead ends: 67 [2020-12-23 07:10:37,548 INFO L226 Difference]: Without dead ends: 41 [2020-12-23 07:10:37,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-12-23 07:10:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-12-23 07:10:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2020-12-23 07:10:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-23 07:10:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2020-12-23 07:10:37,562 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 15 [2020-12-23 07:10:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:37,563 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2020-12-23 07:10:37,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 07:10:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2020-12-23 07:10:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 07:10:37,565 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:37,566 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:37,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:10:37,780 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:37,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:37,781 INFO L82 PathProgramCache]: Analyzing trace with hash 730990835, now seen corresponding path program 2 times [2020-12-23 07:10:37,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:37,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7804534] [2020-12-23 07:10:37,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:37,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7804534] [2020-12-23 07:10:37,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244591935] [2020-12-23 07:10:37,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:37,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:10:37,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:37,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 07:10:37,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 07:10:38,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:38,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-12-23 07:10:38,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696397143] [2020-12-23 07:10:38,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 07:10:38,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:38,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 07:10:38,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-23 07:10:38,060 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 9 states. [2020-12-23 07:10:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:38,336 INFO L93 Difference]: Finished difference Result 123 states and 179 transitions. [2020-12-23 07:10:38,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 07:10:38,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-23 07:10:38,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:38,341 INFO L225 Difference]: With dead ends: 123 [2020-12-23 07:10:38,341 INFO L226 Difference]: Without dead ends: 91 [2020-12-23 07:10:38,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2020-12-23 07:10:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-12-23 07:10:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2020-12-23 07:10:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-23 07:10:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2020-12-23 07:10:38,368 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 18 [2020-12-23 07:10:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:38,371 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2020-12-23 07:10:38,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 07:10:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2020-12-23 07:10:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-23 07:10:38,376 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:38,376 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:38,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:10:38,577 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:38,578 INFO L82 PathProgramCache]: Analyzing trace with hash -104466575, now seen corresponding path program 1 times [2020-12-23 07:10:38,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:38,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590572350] [2020-12-23 07:10:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:38,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590572350] [2020-12-23 07:10:38,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027748914] [2020-12-23 07:10:38,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:38,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 07:10:38,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:38,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:38,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-12-23 07:10:38,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732443919] [2020-12-23 07:10:38,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 07:10:38,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:38,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 07:10:38,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2020-12-23 07:10:38,873 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand 11 states. [2020-12-23 07:10:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:38,982 INFO L93 Difference]: Finished difference Result 199 states and 267 transitions. [2020-12-23 07:10:38,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 07:10:38,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-12-23 07:10:38,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:38,984 INFO L225 Difference]: With dead ends: 199 [2020-12-23 07:10:38,984 INFO L226 Difference]: Without dead ends: 127 [2020-12-23 07:10:38,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2020-12-23 07:10:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-12-23 07:10:39,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 88. [2020-12-23 07:10:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-12-23 07:10:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2020-12-23 07:10:39,015 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 21 [2020-12-23 07:10:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:39,018 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2020-12-23 07:10:39,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 07:10:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2020-12-23 07:10:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 07:10:39,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:39,019 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:39,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:10:39,221 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:39,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:39,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1399176113, now seen corresponding path program 2 times [2020-12-23 07:10:39,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:39,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453732767] [2020-12-23 07:10:39,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:39,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453732767] [2020-12-23 07:10:39,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015722681] [2020-12-23 07:10:39,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:39,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:10:39,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:39,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 07:10:39,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 07:10:39,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:39,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-12-23 07:10:39,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536805075] [2020-12-23 07:10:39,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 07:10:39,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:39,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 07:10:39,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-12-23 07:10:39,531 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand 12 states. [2020-12-23 07:10:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:39,813 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2020-12-23 07:10:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 07:10:39,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-12-23 07:10:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:39,816 INFO L225 Difference]: With dead ends: 291 [2020-12-23 07:10:39,817 INFO L226 Difference]: Without dead ends: 207 [2020-12-23 07:10:39,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2020-12-23 07:10:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-12-23 07:10:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 146. [2020-12-23 07:10:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 07:10:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2020-12-23 07:10:39,838 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 24 [2020-12-23 07:10:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:39,839 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2020-12-23 07:10:39,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 07:10:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2020-12-23 07:10:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 07:10:39,840 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:39,840 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:40,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:10:40,056 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2084547665, now seen corresponding path program 3 times [2020-12-23 07:10:40,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:40,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903108988] [2020-12-23 07:10:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:40,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903108988] [2020-12-23 07:10:40,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91420804] [2020-12-23 07:10:40,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:40,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 07:10:40,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:40,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 07:10:40,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 07:10:40,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 07:10:40,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2020-12-23 07:10:40,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982830906] [2020-12-23 07:10:40,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 07:10:40,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:40,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 07:10:40,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-12-23 07:10:40,298 INFO L87 Difference]: Start difference. First operand 146 states and 194 transitions. Second operand 4 states. [2020-12-23 07:10:40,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:40,352 INFO L93 Difference]: Finished difference Result 334 states and 446 transitions. [2020-12-23 07:10:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 07:10:40,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-12-23 07:10:40,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:40,354 INFO L225 Difference]: With dead ends: 334 [2020-12-23 07:10:40,355 INFO L226 Difference]: Without dead ends: 192 [2020-12-23 07:10:40,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-12-23 07:10:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-12-23 07:10:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 164. [2020-12-23 07:10:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-12-23 07:10:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2020-12-23 07:10:40,374 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 27 [2020-12-23 07:10:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:40,375 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2020-12-23 07:10:40,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 07:10:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2020-12-23 07:10:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 07:10:40,376 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:40,376 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:40,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:10:40,591 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1868779761, now seen corresponding path program 1 times [2020-12-23 07:10:40,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:40,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140246899] [2020-12-23 07:10:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-23 07:10:40,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140246899] [2020-12-23 07:10:40,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 07:10:40,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 07:10:40,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761752337] [2020-12-23 07:10:40,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 07:10:40,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 07:10:40,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 07:10:40,625 INFO L87 Difference]: Start difference. First operand 164 states and 202 transitions. Second operand 3 states. [2020-12-23 07:10:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:40,672 INFO L93 Difference]: Finished difference Result 336 states and 416 transitions. [2020-12-23 07:10:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 07:10:40,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 07:10:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:40,674 INFO L225 Difference]: With dead ends: 336 [2020-12-23 07:10:40,674 INFO L226 Difference]: Without dead ends: 176 [2020-12-23 07:10:40,675 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-23 07:10:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-12-23 07:10:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2020-12-23 07:10:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-12-23 07:10:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2020-12-23 07:10:40,689 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 27 [2020-12-23 07:10:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:40,690 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2020-12-23 07:10:40,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 07:10:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2020-12-23 07:10:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 07:10:40,691 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:40,691 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:40,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 07:10:40,692 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:40,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1325275563, now seen corresponding path program 1 times [2020-12-23 07:10:40,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:40,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568060403] [2020-12-23 07:10:40,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:40,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568060403] [2020-12-23 07:10:40,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829547462] [2020-12-23 07:10:40,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:40,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 07:10:40,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:40,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:40,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-12-23 07:10:40,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739671742] [2020-12-23 07:10:40,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 07:10:40,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 07:10:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2020-12-23 07:10:40,961 INFO L87 Difference]: Start difference. First operand 162 states and 196 transitions. Second operand 15 states. [2020-12-23 07:10:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:41,096 INFO L93 Difference]: Finished difference Result 449 states and 539 transitions. [2020-12-23 07:10:41,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 07:10:41,097 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2020-12-23 07:10:41,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:41,099 INFO L225 Difference]: With dead ends: 449 [2020-12-23 07:10:41,099 INFO L226 Difference]: Without dead ends: 291 [2020-12-23 07:10:41,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2020-12-23 07:10:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-12-23 07:10:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 192. [2020-12-23 07:10:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-12-23 07:10:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 230 transitions. [2020-12-23 07:10:41,115 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 230 transitions. Word has length 28 [2020-12-23 07:10:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:41,115 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 230 transitions. [2020-12-23 07:10:41,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 07:10:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 230 transitions. [2020-12-23 07:10:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 07:10:41,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:41,117 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:41,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:10:41,332 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash 399501479, now seen corresponding path program 2 times [2020-12-23 07:10:41,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:41,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199327610] [2020-12-23 07:10:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:41,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199327610] [2020-12-23 07:10:41,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923281206] [2020-12-23 07:10:41,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:41,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:10:41,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:41,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 07:10:41,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:41,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:41,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-12-23 07:10:41,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064306834] [2020-12-23 07:10:41,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 07:10:41,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:41,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 07:10:41,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2020-12-23 07:10:41,659 INFO L87 Difference]: Start difference. First operand 192 states and 230 transitions. Second operand 17 states. [2020-12-23 07:10:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:41,810 INFO L93 Difference]: Finished difference Result 509 states and 607 transitions. [2020-12-23 07:10:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 07:10:41,810 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2020-12-23 07:10:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:41,817 INFO L225 Difference]: With dead ends: 509 [2020-12-23 07:10:41,818 INFO L226 Difference]: Without dead ends: 321 [2020-12-23 07:10:41,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2020-12-23 07:10:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-12-23 07:10:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 222. [2020-12-23 07:10:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-12-23 07:10:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 264 transitions. [2020-12-23 07:10:41,844 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 264 transitions. Word has length 31 [2020-12-23 07:10:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:41,844 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 264 transitions. [2020-12-23 07:10:41,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 07:10:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 264 transitions. [2020-12-23 07:10:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 07:10:41,848 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:41,848 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:42,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:10:42,063 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:42,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:42,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1351227349, now seen corresponding path program 3 times [2020-12-23 07:10:42,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:42,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513276553] [2020-12-23 07:10:42,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:42,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513276553] [2020-12-23 07:10:42,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571056329] [2020-12-23 07:10:42,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:42,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-23 07:10:42,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:42,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 07:10:42,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 07:10:42,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 07:10:42,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2020-12-23 07:10:42,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187017771] [2020-12-23 07:10:42,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 07:10:42,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:42,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 07:10:42,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-12-23 07:10:42,318 INFO L87 Difference]: Start difference. First operand 222 states and 264 transitions. Second operand 5 states. [2020-12-23 07:10:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:42,402 INFO L93 Difference]: Finished difference Result 225 states and 266 transitions. [2020-12-23 07:10:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 07:10:42,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-12-23 07:10:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:42,404 INFO L225 Difference]: With dead ends: 225 [2020-12-23 07:10:42,404 INFO L226 Difference]: Without dead ends: 165 [2020-12-23 07:10:42,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-12-23 07:10:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-12-23 07:10:42,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2020-12-23 07:10:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-12-23 07:10:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 197 transitions. [2020-12-23 07:10:42,418 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 197 transitions. Word has length 34 [2020-12-23 07:10:42,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:42,419 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 197 transitions. [2020-12-23 07:10:42,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 07:10:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 197 transitions. [2020-12-23 07:10:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 07:10:42,423 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:42,423 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:42,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 07:10:42,638 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:42,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:42,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1860700439, now seen corresponding path program 1 times [2020-12-23 07:10:42,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:42,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011668989] [2020-12-23 07:10:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:42,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011668989] [2020-12-23 07:10:42,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387399630] [2020-12-23 07:10:42,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:42,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-23 07:10:42,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:43,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:43,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-12-23 07:10:43,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931818538] [2020-12-23 07:10:43,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 07:10:43,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:43,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 07:10:43,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2020-12-23 07:10:43,020 INFO L87 Difference]: Start difference. First operand 164 states and 197 transitions. Second operand 19 states. [2020-12-23 07:10:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:43,167 INFO L93 Difference]: Finished difference Result 443 states and 529 transitions. [2020-12-23 07:10:43,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 07:10:43,168 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2020-12-23 07:10:43,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:43,169 INFO L225 Difference]: With dead ends: 443 [2020-12-23 07:10:43,169 INFO L226 Difference]: Without dead ends: 283 [2020-12-23 07:10:43,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2020-12-23 07:10:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-12-23 07:10:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 188. [2020-12-23 07:10:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-23 07:10:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 225 transitions. [2020-12-23 07:10:43,184 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 225 transitions. Word has length 34 [2020-12-23 07:10:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:43,185 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 225 transitions. [2020-12-23 07:10:43,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 07:10:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 225 transitions. [2020-12-23 07:10:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 07:10:43,186 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:43,186 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:43,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:10:43,401 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:43,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:43,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1470700201, now seen corresponding path program 2 times [2020-12-23 07:10:43,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:43,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527849866] [2020-12-23 07:10:43,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:43,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527849866] [2020-12-23 07:10:43,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029031893] [2020-12-23 07:10:43,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:43,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:10:43,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:43,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 07:10:43,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:43,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:43,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2020-12-23 07:10:43,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998363045] [2020-12-23 07:10:43,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-23 07:10:43,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-23 07:10:43,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2020-12-23 07:10:43,841 INFO L87 Difference]: Start difference. First operand 188 states and 225 transitions. Second operand 21 states. [2020-12-23 07:10:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:43,975 INFO L93 Difference]: Finished difference Result 491 states and 585 transitions. [2020-12-23 07:10:43,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 07:10:43,976 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2020-12-23 07:10:43,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:43,978 INFO L225 Difference]: With dead ends: 491 [2020-12-23 07:10:43,978 INFO L226 Difference]: Without dead ends: 307 [2020-12-23 07:10:43,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2020-12-23 07:10:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-12-23 07:10:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 212. [2020-12-23 07:10:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-12-23 07:10:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 253 transitions. [2020-12-23 07:10:43,996 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 253 transitions. Word has length 37 [2020-12-23 07:10:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:43,997 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 253 transitions. [2020-12-23 07:10:43,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-23 07:10:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 253 transitions. [2020-12-23 07:10:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 07:10:43,997 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:43,998 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:44,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 07:10:44,211 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:44,212 INFO L82 PathProgramCache]: Analyzing trace with hash -877109527, now seen corresponding path program 3 times [2020-12-23 07:10:44,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:44,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873283730] [2020-12-23 07:10:44,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:44,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873283730] [2020-12-23 07:10:44,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417354032] [2020-12-23 07:10:44,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:44,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-23 07:10:44,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:44,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 07:10:44,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:44,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 07:10:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2020-12-23 07:10:44,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 07:10:44,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2020-12-23 07:10:44,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235241261] [2020-12-23 07:10:44,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 07:10:44,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:44,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 07:10:44,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2020-12-23 07:10:44,596 INFO L87 Difference]: Start difference. First operand 212 states and 253 transitions. Second operand 8 states. [2020-12-23 07:10:44,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:44,788 INFO L93 Difference]: Finished difference Result 486 states and 576 transitions. [2020-12-23 07:10:44,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 07:10:44,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-12-23 07:10:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:44,792 INFO L225 Difference]: With dead ends: 486 [2020-12-23 07:10:44,792 INFO L226 Difference]: Without dead ends: 484 [2020-12-23 07:10:44,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2020-12-23 07:10:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-12-23 07:10:44,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 300. [2020-12-23 07:10:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-12-23 07:10:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 355 transitions. [2020-12-23 07:10:44,842 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 355 transitions. Word has length 40 [2020-12-23 07:10:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:44,843 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 355 transitions. [2020-12-23 07:10:44,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 07:10:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 355 transitions. [2020-12-23 07:10:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 07:10:44,844 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:44,844 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:45,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 07:10:45,058 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:45,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:45,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1952423639, now seen corresponding path program 1 times [2020-12-23 07:10:45,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:45,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072898340] [2020-12-23 07:10:45,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-12-23 07:10:45,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072898340] [2020-12-23 07:10:45,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 07:10:45,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 07:10:45,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001927167] [2020-12-23 07:10:45,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 07:10:45,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:45,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 07:10:45,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 07:10:45,090 INFO L87 Difference]: Start difference. First operand 300 states and 355 transitions. Second operand 3 states. [2020-12-23 07:10:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:45,128 INFO L93 Difference]: Finished difference Result 427 states and 509 transitions. [2020-12-23 07:10:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 07:10:45,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-12-23 07:10:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:45,131 INFO L225 Difference]: With dead ends: 427 [2020-12-23 07:10:45,131 INFO L226 Difference]: Without dead ends: 319 [2020-12-23 07:10:45,132 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-23 07:10:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-12-23 07:10:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 306. [2020-12-23 07:10:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-12-23 07:10:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 361 transitions. [2020-12-23 07:10:45,159 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 361 transitions. Word has length 40 [2020-12-23 07:10:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:45,159 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 361 transitions. [2020-12-23 07:10:45,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 07:10:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 361 transitions. [2020-12-23 07:10:45,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 07:10:45,160 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:45,160 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:45,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 07:10:45,160 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:45,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:45,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1950517015, now seen corresponding path program 1 times [2020-12-23 07:10:45,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:45,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754731178] [2020-12-23 07:10:45,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:45,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754731178] [2020-12-23 07:10:45,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492969543] [2020-12-23 07:10:45,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:45,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-23 07:10:45,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:45,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:45,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2020-12-23 07:10:45,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3178900] [2020-12-23 07:10:45,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-23 07:10:45,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:45,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-23 07:10:45,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2020-12-23 07:10:45,568 INFO L87 Difference]: Start difference. First operand 306 states and 361 transitions. Second operand 23 states. [2020-12-23 07:10:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:45,751 INFO L93 Difference]: Finished difference Result 669 states and 793 transitions. [2020-12-23 07:10:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 07:10:45,752 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2020-12-23 07:10:45,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:45,755 INFO L225 Difference]: With dead ends: 669 [2020-12-23 07:10:45,755 INFO L226 Difference]: Without dead ends: 439 [2020-12-23 07:10:45,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2020-12-23 07:10:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-12-23 07:10:45,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 339. [2020-12-23 07:10:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-12-23 07:10:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 399 transitions. [2020-12-23 07:10:45,785 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 399 transitions. Word has length 40 [2020-12-23 07:10:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:45,785 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 399 transitions. [2020-12-23 07:10:45,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-23 07:10:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 399 transitions. [2020-12-23 07:10:45,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-23 07:10:45,786 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:45,786 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:45,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 07:10:45,997 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:45,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash -658324379, now seen corresponding path program 2 times [2020-12-23 07:10:45,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:45,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627643178] [2020-12-23 07:10:45,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:46,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627643178] [2020-12-23 07:10:46,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246874026] [2020-12-23 07:10:46,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:46,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:10:46,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:46,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 07:10:46,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-12-23 07:10:46,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:46,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2020-12-23 07:10:46,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784127936] [2020-12-23 07:10:46,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 07:10:46,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:46,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 07:10:46,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2020-12-23 07:10:46,328 INFO L87 Difference]: Start difference. First operand 339 states and 399 transitions. Second operand 19 states. [2020-12-23 07:10:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:46,974 INFO L93 Difference]: Finished difference Result 1075 states and 1251 transitions. [2020-12-23 07:10:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-23 07:10:46,974 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2020-12-23 07:10:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:46,978 INFO L225 Difference]: With dead ends: 1075 [2020-12-23 07:10:46,979 INFO L226 Difference]: Without dead ends: 821 [2020-12-23 07:10:46,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=486, Invalid=996, Unknown=0, NotChecked=0, Total=1482 [2020-12-23 07:10:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2020-12-23 07:10:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 333. [2020-12-23 07:10:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-12-23 07:10:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 388 transitions. [2020-12-23 07:10:47,012 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 388 transitions. Word has length 43 [2020-12-23 07:10:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:47,012 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 388 transitions. [2020-12-23 07:10:47,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 07:10:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 388 transitions. [2020-12-23 07:10:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 07:10:47,013 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:47,013 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:47,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:10:47,227 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1311604647, now seen corresponding path program 3 times [2020-12-23 07:10:47,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:47,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267148261] [2020-12-23 07:10:47,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:10:47,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267148261] [2020-12-23 07:10:47,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925559525] [2020-12-23 07:10:47,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:47,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-23 07:10:47,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:47,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-23 07:10:47,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:47,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 07:10:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-12-23 07:10:47,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 07:10:47,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21 [2020-12-23 07:10:47,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836814090] [2020-12-23 07:10:47,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 07:10:47,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:47,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 07:10:47,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2020-12-23 07:10:47,637 INFO L87 Difference]: Start difference. First operand 333 states and 388 transitions. Second operand 8 states. [2020-12-23 07:10:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:47,849 INFO L93 Difference]: Finished difference Result 442 states and 513 transitions. [2020-12-23 07:10:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 07:10:47,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-12-23 07:10:47,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:47,852 INFO L225 Difference]: With dead ends: 442 [2020-12-23 07:10:47,852 INFO L226 Difference]: Without dead ends: 440 [2020-12-23 07:10:47,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2020-12-23 07:10:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-12-23 07:10:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 333. [2020-12-23 07:10:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-12-23 07:10:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 388 transitions. [2020-12-23 07:10:47,883 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 388 transitions. Word has length 46 [2020-12-23 07:10:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:47,884 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 388 transitions. [2020-12-23 07:10:47,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 07:10:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 388 transitions. [2020-12-23 07:10:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 07:10:47,885 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:47,885 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:48,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:10:48,099 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:48,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:48,100 INFO L82 PathProgramCache]: Analyzing trace with hash -53609623, now seen corresponding path program 1 times [2020-12-23 07:10:48,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:48,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541246667] [2020-12-23 07:10:48,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2020-12-23 07:10:48,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541246667] [2020-12-23 07:10:48,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 07:10:48,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 07:10:48,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527577488] [2020-12-23 07:10:48,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 07:10:48,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:48,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 07:10:48,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 07:10:48,149 INFO L87 Difference]: Start difference. First operand 333 states and 388 transitions. Second operand 5 states. [2020-12-23 07:10:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:48,230 INFO L93 Difference]: Finished difference Result 561 states and 655 transitions. [2020-12-23 07:10:48,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 07:10:48,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-12-23 07:10:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:48,233 INFO L225 Difference]: With dead ends: 561 [2020-12-23 07:10:48,233 INFO L226 Difference]: Without dead ends: 448 [2020-12-23 07:10:48,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-23 07:10:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-12-23 07:10:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 400. [2020-12-23 07:10:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-12-23 07:10:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 469 transitions. [2020-12-23 07:10:48,275 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 469 transitions. Word has length 46 [2020-12-23 07:10:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:48,275 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 469 transitions. [2020-12-23 07:10:48,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 07:10:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 469 transitions. [2020-12-23 07:10:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 07:10:48,277 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:48,277 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 20, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:48,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 07:10:48,277 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:48,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1284068705, now seen corresponding path program 1 times [2020-12-23 07:10:48,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:48,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809265062] [2020-12-23 07:10:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 387 proven. 176 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2020-12-23 07:10:48,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809265062] [2020-12-23 07:10:48,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853815497] [2020-12-23 07:10:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:48,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 07:10:48,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 387 proven. 176 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2020-12-23 07:10:48,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:48,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2020-12-23 07:10:48,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490789290] [2020-12-23 07:10:48,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-23 07:10:48,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:48,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-23 07:10:48,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=417, Unknown=0, NotChecked=0, Total=702 [2020-12-23 07:10:48,835 INFO L87 Difference]: Start difference. First operand 400 states and 469 transitions. Second operand 27 states. [2020-12-23 07:10:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:49,251 INFO L93 Difference]: Finished difference Result 1102 states and 1266 transitions. [2020-12-23 07:10:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 07:10:49,252 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 87 [2020-12-23 07:10:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:49,257 INFO L225 Difference]: With dead ends: 1102 [2020-12-23 07:10:49,257 INFO L226 Difference]: Without dead ends: 793 [2020-12-23 07:10:49,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=417, Unknown=0, NotChecked=0, Total=702 [2020-12-23 07:10:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2020-12-23 07:10:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 439. [2020-12-23 07:10:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-12-23 07:10:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 514 transitions. [2020-12-23 07:10:49,305 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 514 transitions. Word has length 87 [2020-12-23 07:10:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:49,306 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 514 transitions. [2020-12-23 07:10:49,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-23 07:10:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 514 transitions. [2020-12-23 07:10:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-23 07:10:49,307 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:49,308 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 22, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:49,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-12-23 07:10:49,520 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:49,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:49,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1856213775, now seen corresponding path program 2 times [2020-12-23 07:10:49,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:49,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717932941] [2020-12-23 07:10:49,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 458 proven. 210 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2020-12-23 07:10:49,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717932941] [2020-12-23 07:10:49,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099547680] [2020-12-23 07:10:49,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:49,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:10:49,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:49,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-23 07:10:49,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 458 proven. 210 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2020-12-23 07:10:50,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:50,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2020-12-23 07:10:50,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659275511] [2020-12-23 07:10:50,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-12-23 07:10:50,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-12-23 07:10:50,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=484, Unknown=0, NotChecked=0, Total=812 [2020-12-23 07:10:50,175 INFO L87 Difference]: Start difference. First operand 439 states and 514 transitions. Second operand 29 states. [2020-12-23 07:10:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:50,651 INFO L93 Difference]: Finished difference Result 1171 states and 1346 transitions. [2020-12-23 07:10:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 07:10:50,651 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 93 [2020-12-23 07:10:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:50,656 INFO L225 Difference]: With dead ends: 1171 [2020-12-23 07:10:50,656 INFO L226 Difference]: Without dead ends: 832 [2020-12-23 07:10:50,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=328, Invalid=484, Unknown=0, NotChecked=0, Total=812 [2020-12-23 07:10:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2020-12-23 07:10:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 478. [2020-12-23 07:10:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2020-12-23 07:10:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 559 transitions. [2020-12-23 07:10:50,724 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 559 transitions. Word has length 93 [2020-12-23 07:10:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:50,725 INFO L481 AbstractCegarLoop]: Abstraction has 478 states and 559 transitions. [2020-12-23 07:10:50,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-12-23 07:10:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 559 transitions. [2020-12-23 07:10:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 07:10:50,728 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:50,728 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 24, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:50,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:10:50,938 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:50,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:50,939 INFO L82 PathProgramCache]: Analyzing trace with hash -267019423, now seen corresponding path program 3 times [2020-12-23 07:10:50,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:50,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78774590] [2020-12-23 07:10:50,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 535 proven. 247 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-12-23 07:10:51,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78774590] [2020-12-23 07:10:51,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060030858] [2020-12-23 07:10:51,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:51,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-23 07:10:51,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:51,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-23 07:10:51,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:51,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 07:10:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 37 proven. 541 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2020-12-23 07:10:51,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:51,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 24 [2020-12-23 07:10:51,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129413444] [2020-12-23 07:10:51,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-23 07:10:51,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:51,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-23 07:10:51,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2020-12-23 07:10:51,463 INFO L87 Difference]: Start difference. First operand 478 states and 559 transitions. Second operand 24 states. [2020-12-23 07:10:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:54,325 INFO L93 Difference]: Finished difference Result 2208 states and 2540 transitions. [2020-12-23 07:10:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2020-12-23 07:10:54,326 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2020-12-23 07:10:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:54,335 INFO L225 Difference]: With dead ends: 2208 [2020-12-23 07:10:54,335 INFO L226 Difference]: Without dead ends: 1839 [2020-12-23 07:10:54,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2190 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1574, Invalid=5908, Unknown=0, NotChecked=0, Total=7482 [2020-12-23 07:10:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2020-12-23 07:10:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 770. [2020-12-23 07:10:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2020-12-23 07:10:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 901 transitions. [2020-12-23 07:10:54,456 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 901 transitions. Word has length 99 [2020-12-23 07:10:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:54,456 INFO L481 AbstractCegarLoop]: Abstraction has 770 states and 901 transitions. [2020-12-23 07:10:54,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-23 07:10:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 901 transitions. [2020-12-23 07:10:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 07:10:54,458 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:54,458 INFO L422 BasicCegarLoop]: trace histogram [28, 28, 24, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:54,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-12-23 07:10:54,674 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:54,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:54,675 INFO L82 PathProgramCache]: Analyzing trace with hash -111346257, now seen corresponding path program 1 times [2020-12-23 07:10:54,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:54,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529159744] [2020-12-23 07:10:54,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 49 proven. 861 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2020-12-23 07:10:54,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529159744] [2020-12-23 07:10:54,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993843232] [2020-12-23 07:10:54,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:55,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 07:10:55,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 618 proven. 287 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2020-12-23 07:10:55,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:55,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2020-12-23 07:10:55,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056732005] [2020-12-23 07:10:55,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-23 07:10:55,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:55,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-23 07:10:55,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=633, Unknown=0, NotChecked=0, Total=1056 [2020-12-23 07:10:55,464 INFO L87 Difference]: Start difference. First operand 770 states and 901 transitions. Second operand 33 states. [2020-12-23 07:10:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:55,888 INFO L93 Difference]: Finished difference Result 1968 states and 2264 transitions. [2020-12-23 07:10:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 07:10:55,889 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 105 [2020-12-23 07:10:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:55,895 INFO L225 Difference]: With dead ends: 1968 [2020-12-23 07:10:55,895 INFO L226 Difference]: Without dead ends: 1316 [2020-12-23 07:10:55,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=423, Invalid=633, Unknown=0, NotChecked=0, Total=1056 [2020-12-23 07:10:55,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2020-12-23 07:10:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 809. [2020-12-23 07:10:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2020-12-23 07:10:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 946 transitions. [2020-12-23 07:10:56,010 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 946 transitions. Word has length 105 [2020-12-23 07:10:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:56,010 INFO L481 AbstractCegarLoop]: Abstraction has 809 states and 946 transitions. [2020-12-23 07:10:56,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-23 07:10:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 946 transitions. [2020-12-23 07:10:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 07:10:56,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:56,012 INFO L422 BasicCegarLoop]: trace histogram [30, 30, 26, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:56,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-12-23 07:10:56,226 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:56,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:56,226 INFO L82 PathProgramCache]: Analyzing trace with hash 802849635, now seen corresponding path program 2 times [2020-12-23 07:10:56,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:56,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537975812] [2020-12-23 07:10:56,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 52 proven. 990 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2020-12-23 07:10:56,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537975812] [2020-12-23 07:10:56,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257582637] [2020-12-23 07:10:56,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:56,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:10:56,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:56,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-23 07:10:56,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 707 proven. 330 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2020-12-23 07:10:57,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:57,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2020-12-23 07:10:57,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954519813] [2020-12-23 07:10:57,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-23 07:10:57,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:57,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-23 07:10:57,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2020-12-23 07:10:57,085 INFO L87 Difference]: Start difference. First operand 809 states and 946 transitions. Second operand 35 states. [2020-12-23 07:10:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:10:57,665 INFO L93 Difference]: Finished difference Result 2078 states and 2393 transitions. [2020-12-23 07:10:57,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 07:10:57,666 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 111 [2020-12-23 07:10:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:10:57,671 INFO L225 Difference]: With dead ends: 2078 [2020-12-23 07:10:57,671 INFO L226 Difference]: Without dead ends: 1396 [2020-12-23 07:10:57,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2020-12-23 07:10:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-12-23 07:10:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 866. [2020-12-23 07:10:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2020-12-23 07:10:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1012 transitions. [2020-12-23 07:10:57,810 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1012 transitions. Word has length 111 [2020-12-23 07:10:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:10:57,810 INFO L481 AbstractCegarLoop]: Abstraction has 866 states and 1012 transitions. [2020-12-23 07:10:57,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-23 07:10:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1012 transitions. [2020-12-23 07:10:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 07:10:57,813 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:10:57,813 INFO L422 BasicCegarLoop]: trace histogram [32, 32, 28, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:10:58,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-23 07:10:58,028 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:10:58,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:10:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash -780287697, now seen corresponding path program 3 times [2020-12-23 07:10:58,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:10:58,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934028397] [2020-12-23 07:10:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:10:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:10:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 55 proven. 1128 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2020-12-23 07:10:58,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934028397] [2020-12-23 07:10:58,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712554817] [2020-12-23 07:10:58,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/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-23 07:10:58,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-23 07:10:58,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:10:58,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 07:10:58,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:10:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 807 proven. 47 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2020-12-23 07:10:58,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:10:58,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7] total 25 [2020-12-23 07:10:58,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074394789] [2020-12-23 07:10:58,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-23 07:10:58,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:10:58,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-23 07:10:58,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2020-12-23 07:10:58,577 INFO L87 Difference]: Start difference. First operand 866 states and 1012 transitions. Second operand 25 states. [2020-12-23 07:11:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:11:01,158 INFO L93 Difference]: Finished difference Result 1933 states and 2278 transitions. [2020-12-23 07:11:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2020-12-23 07:11:01,159 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 117 [2020-12-23 07:11:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:11:01,165 INFO L225 Difference]: With dead ends: 1933 [2020-12-23 07:11:01,165 INFO L226 Difference]: Without dead ends: 1203 [2020-12-23 07:11:01,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1816, Invalid=4990, Unknown=0, NotChecked=0, Total=6806 [2020-12-23 07:11:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-12-23 07:11:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 794. [2020-12-23 07:11:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-12-23 07:11:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 891 transitions. [2020-12-23 07:11:01,282 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 891 transitions. Word has length 117 [2020-12-23 07:11:01,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:11:01,283 INFO L481 AbstractCegarLoop]: Abstraction has 794 states and 891 transitions. [2020-12-23 07:11:01,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-23 07:11:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 891 transitions. [2020-12-23 07:11:01,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-23 07:11:01,285 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:11:01,285 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 20, 14, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:11:01,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-23 07:11:01,501 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:11:01,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:11:01,501 INFO L82 PathProgramCache]: Analyzing trace with hash 838744801, now seen corresponding path program 1 times [2020-12-23 07:11:01,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:11:01,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580865664] [2020-12-23 07:11:01,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:11:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 984 proven. 0 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2020-12-23 07:11:01,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580865664] [2020-12-23 07:11:01,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 07:11:01,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 07:11:01,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811835423] [2020-12-23 07:11:01,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 07:11:01,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:11:01,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 07:11:01,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 07:11:01,560 INFO L87 Difference]: Start difference. First operand 794 states and 891 transitions. Second operand 5 states. [2020-12-23 07:11:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:11:01,724 INFO L93 Difference]: Finished difference Result 1253 states and 1372 transitions. [2020-12-23 07:11:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 07:11:01,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2020-12-23 07:11:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:11:01,729 INFO L225 Difference]: With dead ends: 1253 [2020-12-23 07:11:01,729 INFO L226 Difference]: Without dead ends: 1051 [2020-12-23 07:11:01,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 07:11:01,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2020-12-23 07:11:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 803. [2020-12-23 07:11:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-12-23 07:11:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 903 transitions. [2020-12-23 07:11:01,836 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 903 transitions. Word has length 123 [2020-12-23 07:11:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:11:01,836 INFO L481 AbstractCegarLoop]: Abstraction has 803 states and 903 transitions. [2020-12-23 07:11:01,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 07:11:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 903 transitions. [2020-12-23 07:11:01,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-23 07:11:01,838 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:11:01,838 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 19, 15, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:11:01,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 07:11:01,839 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:11:01,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:11:01,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1273355935, now seen corresponding path program 4 times [2020-12-23 07:11:01,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:11:01,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842713533] [2020-12-23 07:11:01,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:11:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 903 proven. 425 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2020-12-23 07:11:02,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842713533] [2020-12-23 07:11:02,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043965915] [2020-12-23 07:11:02,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:02,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-23 07:11:02,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:11:02,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-23 07:11:02,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:11:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 1033 proven. 206 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2020-12-23 07:11:02,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:11:02,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 30 [2020-12-23 07:11:02,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409325262] [2020-12-23 07:11:02,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-23 07:11:02,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:11:02,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-23 07:11:02,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2020-12-23 07:11:02,553 INFO L87 Difference]: Start difference. First operand 803 states and 903 transitions. Second operand 30 states. [2020-12-23 07:11:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:11:04,817 INFO L93 Difference]: Finished difference Result 1871 states and 2087 transitions. [2020-12-23 07:11:04,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2020-12-23 07:11:04,817 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 123 [2020-12-23 07:11:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:11:04,823 INFO L225 Difference]: With dead ends: 1871 [2020-12-23 07:11:04,823 INFO L226 Difference]: Without dead ends: 1215 [2020-12-23 07:11:04,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1937, Invalid=5035, Unknown=0, NotChecked=0, Total=6972 [2020-12-23 07:11:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-12-23 07:11:04,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 793. [2020-12-23 07:11:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-12-23 07:11:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 884 transitions. [2020-12-23 07:11:04,938 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 884 transitions. Word has length 123 [2020-12-23 07:11:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:11:04,938 INFO L481 AbstractCegarLoop]: Abstraction has 793 states and 884 transitions. [2020-12-23 07:11:04,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-23 07:11:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 884 transitions. [2020-12-23 07:11:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-23 07:11:04,940 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:11:04,941 INFO L422 BasicCegarLoop]: trace histogram [36, 36, 21, 15, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:11:05,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-23 07:11:05,154 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:11:05,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:11:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1151168365, now seen corresponding path program 5 times [2020-12-23 07:11:05,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:11:05,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162945605] [2020-12-23 07:11:05,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:11:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 1010 proven. 477 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2020-12-23 07:11:05,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162945605] [2020-12-23 07:11:05,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564728677] [2020-12-23 07:11:05,511 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:05,608 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2020-12-23 07:11:05,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:11:05,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-23 07:11:05,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:11:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 1257 proven. 451 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2020-12-23 07:11:06,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:11:06,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 45 [2020-12-23 07:11:06,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151107094] [2020-12-23 07:11:06,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 45 states [2020-12-23 07:11:06,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:11:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2020-12-23 07:11:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=1553, Unknown=0, NotChecked=0, Total=1980 [2020-12-23 07:11:06,504 INFO L87 Difference]: Start difference. First operand 793 states and 884 transitions. Second operand 45 states. [2020-12-23 07:11:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:11:09,098 INFO L93 Difference]: Finished difference Result 1897 states and 2110 transitions. [2020-12-23 07:11:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2020-12-23 07:11:09,098 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 129 [2020-12-23 07:11:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:11:09,103 INFO L225 Difference]: With dead ends: 1897 [2020-12-23 07:11:09,104 INFO L226 Difference]: Without dead ends: 1251 [2020-12-23 07:11:09,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2803 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2325, Invalid=7977, Unknown=0, NotChecked=0, Total=10302 [2020-12-23 07:11:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2020-12-23 07:11:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1003. [2020-12-23 07:11:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2020-12-23 07:11:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1107 transitions. [2020-12-23 07:11:09,232 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1107 transitions. Word has length 129 [2020-12-23 07:11:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:11:09,232 INFO L481 AbstractCegarLoop]: Abstraction has 1003 states and 1107 transitions. [2020-12-23 07:11:09,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2020-12-23 07:11:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1107 transitions. [2020-12-23 07:11:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 07:11:09,235 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:11:09,235 INFO L422 BasicCegarLoop]: trace histogram [38, 38, 23, 15, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:11:09,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:09,450 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:11:09,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:11:09,451 INFO L82 PathProgramCache]: Analyzing trace with hash 244793185, now seen corresponding path program 6 times [2020-12-23 07:11:09,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:11:09,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336599641] [2020-12-23 07:11:09,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:11:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 1123 proven. 532 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2020-12-23 07:11:09,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336599641] [2020-12-23 07:11:09,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836273537] [2020-12-23 07:11:09,822 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:09,883 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2020-12-23 07:11:09,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:11:09,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 07:11:09,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:11:10,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 07:11:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 247 proven. 1141 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-12-23 07:11:10,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:11:10,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 30 [2020-12-23 07:11:10,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465694799] [2020-12-23 07:11:10,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-23 07:11:10,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:11:10,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-23 07:11:10,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2020-12-23 07:11:10,293 INFO L87 Difference]: Start difference. First operand 1003 states and 1107 transitions. Second operand 30 states. [2020-12-23 07:11:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:11:15,746 INFO L93 Difference]: Finished difference Result 2162 states and 2408 transitions. [2020-12-23 07:11:15,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2020-12-23 07:11:15,747 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 135 [2020-12-23 07:11:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:11:15,752 INFO L225 Difference]: With dead ends: 2162 [2020-12-23 07:11:15,753 INFO L226 Difference]: Without dead ends: 1354 [2020-12-23 07:11:15,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5858 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3764, Invalid=14326, Unknown=0, NotChecked=0, Total=18090 [2020-12-23 07:11:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-12-23 07:11:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1117. [2020-12-23 07:11:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2020-12-23 07:11:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1245 transitions. [2020-12-23 07:11:15,911 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1245 transitions. Word has length 135 [2020-12-23 07:11:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:11:15,911 INFO L481 AbstractCegarLoop]: Abstraction has 1117 states and 1245 transitions. [2020-12-23 07:11:15,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-23 07:11:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1245 transitions. [2020-12-23 07:11:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-12-23 07:11:15,914 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:11:15,914 INFO L422 BasicCegarLoop]: trace histogram [40, 40, 38, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:11:16,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2020-12-23 07:11:16,127 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:11:16,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:11:16,128 INFO L82 PathProgramCache]: Analyzing trace with hash 525616749, now seen corresponding path program 1 times [2020-12-23 07:11:16,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:11:16,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399384567] [2020-12-23 07:11:16,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:11:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1858 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2020-12-23 07:11:17,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399384567] [2020-12-23 07:11:17,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578858447] [2020-12-23 07:11:17,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:17,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 38 conjunts are in the unsatisfiable core [2020-12-23 07:11:17,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:11:18,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 07:11:18,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 07:11:18,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 07:11:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1838 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2020-12-23 07:11:18,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:11:18,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 54 [2020-12-23 07:11:18,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559208986] [2020-12-23 07:11:18,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 55 states [2020-12-23 07:11:18,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:11:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2020-12-23 07:11:18,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=2359, Unknown=0, NotChecked=0, Total=2970 [2020-12-23 07:11:18,726 INFO L87 Difference]: Start difference. First operand 1117 states and 1245 transitions. Second operand 55 states. [2020-12-23 07:11:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:11:25,220 INFO L93 Difference]: Finished difference Result 1938 states and 2125 transitions. [2020-12-23 07:11:25,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2020-12-23 07:11:25,221 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 141 [2020-12-23 07:11:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:11:25,228 INFO L225 Difference]: With dead ends: 1938 [2020-12-23 07:11:25,228 INFO L226 Difference]: Without dead ends: 1790 [2020-12-23 07:11:25,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5804 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2911, Invalid=16271, Unknown=0, NotChecked=0, Total=19182 [2020-12-23 07:11:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2020-12-23 07:11:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1421. [2020-12-23 07:11:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2020-12-23 07:11:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1579 transitions. [2020-12-23 07:11:25,379 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1579 transitions. Word has length 141 [2020-12-23 07:11:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:11:25,379 INFO L481 AbstractCegarLoop]: Abstraction has 1421 states and 1579 transitions. [2020-12-23 07:11:25,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2020-12-23 07:11:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1579 transitions. [2020-12-23 07:11:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-12-23 07:11:25,382 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:11:25,383 INFO L422 BasicCegarLoop]: trace histogram [40, 40, 39, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:11:25,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:25,597 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:11:25,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:11:25,597 INFO L82 PathProgramCache]: Analyzing trace with hash 714830123, now seen corresponding path program 2 times [2020-12-23 07:11:25,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:11:25,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971465589] [2020-12-23 07:11:25,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:11:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 587 proven. 1841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:11:26,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971465589] [2020-12-23 07:11:26,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172222248] [2020-12-23 07:11:26,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:26,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:11:26,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:11:26,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-23 07:11:26,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:11:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 86 proven. 1752 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2020-12-23 07:11:27,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:11:27,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23] total 64 [2020-12-23 07:11:27,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028358245] [2020-12-23 07:11:27,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 64 states [2020-12-23 07:11:27,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:11:27,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2020-12-23 07:11:27,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=927, Invalid=3105, Unknown=0, NotChecked=0, Total=4032 [2020-12-23 07:11:27,758 INFO L87 Difference]: Start difference. First operand 1421 states and 1579 transitions. Second operand 64 states. [2020-12-23 07:11:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:11:33,587 INFO L93 Difference]: Finished difference Result 2544 states and 2842 transitions. [2020-12-23 07:11:33,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2020-12-23 07:11:33,588 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 141 [2020-12-23 07:11:33,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:11:33,593 INFO L225 Difference]: With dead ends: 2544 [2020-12-23 07:11:33,593 INFO L226 Difference]: Without dead ends: 1654 [2020-12-23 07:11:33,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4030 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3100, Invalid=12400, Unknown=0, NotChecked=0, Total=15500 [2020-12-23 07:11:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2020-12-23 07:11:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1640. [2020-12-23 07:11:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2020-12-23 07:11:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 1776 transitions. [2020-12-23 07:11:33,786 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 1776 transitions. Word has length 141 [2020-12-23 07:11:33,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:11:33,787 INFO L481 AbstractCegarLoop]: Abstraction has 1640 states and 1776 transitions. [2020-12-23 07:11:33,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2020-12-23 07:11:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1776 transitions. [2020-12-23 07:11:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-12-23 07:11:33,790 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:11:33,790 INFO L422 BasicCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:11:34,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-12-23 07:11:34,005 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:11:34,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:11:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2094903851, now seen corresponding path program 1 times [2020-12-23 07:11:34,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:11:34,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542582049] [2020-12-23 07:11:34,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:11:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2020-12-23 07:11:34,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542582049] [2020-12-23 07:11:34,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813351558] [2020-12-23 07:11:34,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:34,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 07:11:34,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:11:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2020-12-23 07:11:34,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:11:34,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-12-23 07:11:34,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300265904] [2020-12-23 07:11:34,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 07:11:34,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:11:34,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 07:11:34,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2020-12-23 07:11:34,451 INFO L87 Difference]: Start difference. First operand 1640 states and 1776 transitions. Second operand 9 states. [2020-12-23 07:11:34,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:11:34,664 INFO L93 Difference]: Finished difference Result 1796 states and 1938 transitions. [2020-12-23 07:11:34,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 07:11:34,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2020-12-23 07:11:34,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:11:34,670 INFO L225 Difference]: With dead ends: 1796 [2020-12-23 07:11:34,670 INFO L226 Difference]: Without dead ends: 1720 [2020-12-23 07:11:34,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2020-12-23 07:11:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2020-12-23 07:11:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1714. [2020-12-23 07:11:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2020-12-23 07:11:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 1853 transitions. [2020-12-23 07:11:34,814 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 1853 transitions. Word has length 141 [2020-12-23 07:11:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:11:34,814 INFO L481 AbstractCegarLoop]: Abstraction has 1714 states and 1853 transitions. [2020-12-23 07:11:34,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 07:11:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 1853 transitions. [2020-12-23 07:11:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 07:11:34,816 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:11:34,817 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:11:35,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-12-23 07:11:35,027 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:11:35,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:11:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash 574504483, now seen corresponding path program 7 times [2020-12-23 07:11:35,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:11:35,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548241737] [2020-12-23 07:11:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:11:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 701 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:11:36,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548241737] [2020-12-23 07:11:36,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155895468] [2020-12-23 07:11:36,048 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:36,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 42 conjunts are in the unsatisfiable core [2020-12-23 07:11:36,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:11:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 797 proven. 1751 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 07:11:37,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:11:37,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 65 [2020-12-23 07:11:37,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442652169] [2020-12-23 07:11:37,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 65 states [2020-12-23 07:11:37,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:11:37,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2020-12-23 07:11:37,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=950, Invalid=3210, Unknown=0, NotChecked=0, Total=4160 [2020-12-23 07:11:37,655 INFO L87 Difference]: Start difference. First operand 1714 states and 1853 transitions. Second operand 65 states. [2020-12-23 07:11:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:11:41,838 INFO L93 Difference]: Finished difference Result 2006 states and 2163 transitions. [2020-12-23 07:11:41,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2020-12-23 07:11:41,838 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 144 [2020-12-23 07:11:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:11:41,844 INFO L225 Difference]: With dead ends: 2006 [2020-12-23 07:11:41,844 INFO L226 Difference]: Without dead ends: 1701 [2020-12-23 07:11:41,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7016 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5539, Invalid=19583, Unknown=0, NotChecked=0, Total=25122 [2020-12-23 07:11:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2020-12-23 07:11:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1566. [2020-12-23 07:11:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-12-23 07:11:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 1695 transitions. [2020-12-23 07:11:41,989 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 1695 transitions. Word has length 144 [2020-12-23 07:11:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:11:41,989 INFO L481 AbstractCegarLoop]: Abstraction has 1566 states and 1695 transitions. [2020-12-23 07:11:41,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2020-12-23 07:11:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 1695 transitions. [2020-12-23 07:11:41,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 07:11:41,992 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:11:41,992 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 40, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:11:42,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-23 07:11:42,208 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:11:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:11:42,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1051056613, now seen corresponding path program 3 times [2020-12-23 07:11:42,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:11:42,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903939175] [2020-12-23 07:11:42,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:11:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 721 proven. 1238 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2020-12-23 07:11:42,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903939175] [2020-12-23 07:11:42,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517656487] [2020-12-23 07:11:42,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:42,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-23 07:11:42,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:11:42,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 07:11:42,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:11:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1350 proven. 20 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2020-12-23 07:11:42,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:11:42,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 4] total 26 [2020-12-23 07:11:42,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097860495] [2020-12-23 07:11:42,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-12-23 07:11:42,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:11:42,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-12-23 07:11:42,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2020-12-23 07:11:42,970 INFO L87 Difference]: Start difference. First operand 1566 states and 1695 transitions. Second operand 26 states. [2020-12-23 07:11:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:11:46,176 INFO L93 Difference]: Finished difference Result 2515 states and 2719 transitions. [2020-12-23 07:11:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2020-12-23 07:11:46,177 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 144 [2020-12-23 07:11:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:11:46,180 INFO L225 Difference]: With dead ends: 2515 [2020-12-23 07:11:46,180 INFO L226 Difference]: Without dead ends: 1151 [2020-12-23 07:11:46,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2361 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3000, Invalid=8130, Unknown=0, NotChecked=0, Total=11130 [2020-12-23 07:11:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2020-12-23 07:11:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1145. [2020-12-23 07:11:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2020-12-23 07:11:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1224 transitions. [2020-12-23 07:11:46,298 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1224 transitions. Word has length 144 [2020-12-23 07:11:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:11:46,298 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1224 transitions. [2020-12-23 07:11:46,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-12-23 07:11:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1224 transitions. [2020-12-23 07:11:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-12-23 07:11:46,301 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:11:46,301 INFO L422 BasicCegarLoop]: trace histogram [60, 60, 57, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2020-12-23 07:11:46,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-12-23 07:11:46,517 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:11:46,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:11:46,517 INFO L82 PathProgramCache]: Analyzing trace with hash -668312775, now seen corresponding path program 4 times [2020-12-23 07:11:46,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:11:46,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789751298] [2020-12-23 07:11:46,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:11:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 61 proven. 4267 refuted. 0 times theorem prover too weak. 1186 trivial. 0 not checked. [2020-12-23 07:11:47,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789751298] [2020-12-23 07:11:47,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144938072] [2020-12-23 07:11:47,438 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:47,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-23 07:11:47,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:11:47,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 62 conjunts are in the unsatisfiable core [2020-12-23 07:11:47,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:11:50,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 07:11:50,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 07:11:50,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 07:11:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 532 proven. 4392 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2020-12-23 07:11:50,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:11:50,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 50] total 75 [2020-12-23 07:11:50,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677247659] [2020-12-23 07:11:50,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 75 states [2020-12-23 07:11:50,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:11:50,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2020-12-23 07:11:50,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1092, Invalid=4458, Unknown=0, NotChecked=0, Total=5550 [2020-12-23 07:11:50,581 INFO L87 Difference]: Start difference. First operand 1145 states and 1224 transitions. Second operand 75 states. [2020-12-23 07:11:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:11:57,515 INFO L93 Difference]: Finished difference Result 1676 states and 1791 transitions. [2020-12-23 07:11:57,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2020-12-23 07:11:57,515 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 209 [2020-12-23 07:11:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:11:57,519 INFO L225 Difference]: With dead ends: 1676 [2020-12-23 07:11:57,519 INFO L226 Difference]: Without dead ends: 768 [2020-12-23 07:11:57,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10117 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=4357, Invalid=23699, Unknown=0, NotChecked=0, Total=28056 [2020-12-23 07:11:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2020-12-23 07:11:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 346. [2020-12-23 07:11:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-12-23 07:11:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 353 transitions. [2020-12-23 07:11:57,540 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 353 transitions. Word has length 209 [2020-12-23 07:11:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:11:57,540 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 353 transitions. [2020-12-23 07:11:57,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2020-12-23 07:11:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 353 transitions. [2020-12-23 07:11:57,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-12-23 07:11:57,541 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:11:57,541 INFO L422 BasicCegarLoop]: trace histogram [60, 60, 60, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:11:57,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-12-23 07:11:57,742 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:11:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:11:57,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2084159889, now seen corresponding path program 2 times [2020-12-23 07:11:57,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:11:57,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660046256] [2020-12-23 07:11:57,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:11:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 4 proven. 3740 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2020-12-23 07:11:57,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660046256] [2020-12-23 07:11:57,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595594024] [2020-12-23 07:11:57,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:58,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:11:58,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:11:58,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 07:11:58,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:11:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 4 proven. 3740 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2020-12-23 07:11:58,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:11:58,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-12-23 07:11:58,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002376742] [2020-12-23 07:11:58,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 07:11:58,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:11:58,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 07:11:58,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2020-12-23 07:11:58,472 INFO L87 Difference]: Start difference. First operand 346 states and 353 transitions. Second operand 11 states. [2020-12-23 07:11:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:11:58,567 INFO L93 Difference]: Finished difference Result 484 states and 495 transitions. [2020-12-23 07:11:58,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 07:11:58,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 209 [2020-12-23 07:11:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:11:58,570 INFO L225 Difference]: With dead ends: 484 [2020-12-23 07:11:58,570 INFO L226 Difference]: Without dead ends: 414 [2020-12-23 07:11:58,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2020-12-23 07:11:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2020-12-23 07:11:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2020-12-23 07:11:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-12-23 07:11:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 422 transitions. [2020-12-23 07:11:58,602 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 422 transitions. Word has length 209 [2020-12-23 07:11:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:11:58,603 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 422 transitions. [2020-12-23 07:11:58,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 07:11:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 422 transitions. [2020-12-23 07:11:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2020-12-23 07:11:58,605 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:11:58,605 INFO L422 BasicCegarLoop]: trace histogram [80, 80, 80, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:11:58,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:58,821 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:11:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:11:58,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1255336115, now seen corresponding path program 3 times [2020-12-23 07:11:58,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:11:58,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221103639] [2020-12-23 07:11:58,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:11:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:11:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9848 backedges. 6 proven. 7482 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2020-12-23 07:11:59,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221103639] [2020-12-23 07:11:59,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722971061] [2020-12-23 07:11:59,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:11:59,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2020-12-23 07:11:59,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:11:59,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 07:11:59,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:11:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9848 backedges. 6 proven. 7482 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2020-12-23 07:11:59,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:11:59,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-12-23 07:11:59,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861814968] [2020-12-23 07:11:59,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 07:11:59,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:11:59,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 07:11:59,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-12-23 07:11:59,918 INFO L87 Difference]: Start difference. First operand 414 states and 422 transitions. Second operand 13 states. [2020-12-23 07:12:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:12:00,033 INFO L93 Difference]: Finished difference Result 552 states and 564 transitions. [2020-12-23 07:12:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 07:12:00,033 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 277 [2020-12-23 07:12:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:12:00,036 INFO L225 Difference]: With dead ends: 552 [2020-12-23 07:12:00,036 INFO L226 Difference]: Without dead ends: 482 [2020-12-23 07:12:00,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-12-23 07:12:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-12-23 07:12:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-12-23 07:12:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-12-23 07:12:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 491 transitions. [2020-12-23 07:12:00,071 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 491 transitions. Word has length 277 [2020-12-23 07:12:00,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:12:00,072 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 491 transitions. [2020-12-23 07:12:00,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 07:12:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 491 transitions. [2020-12-23 07:12:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2020-12-23 07:12:00,074 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:12:00,074 INFO L422 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:12:00,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-12-23 07:12:00,290 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:12:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:12:00,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1898663689, now seen corresponding path program 4 times [2020-12-23 07:12:00,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:12:00,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843941477] [2020-12-23 07:12:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:12:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15430 backedges. 8 proven. 12472 refuted. 0 times theorem prover too weak. 2950 trivial. 0 not checked. [2020-12-23 07:12:00,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843941477] [2020-12-23 07:12:00,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939474660] [2020-12-23 07:12:00,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:00,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-23 07:12:00,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:12:00,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-23 07:12:00,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:12:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 15430 backedges. 540 proven. 12530 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2020-12-23 07:12:02,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:12:02,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 29] total 36 [2020-12-23 07:12:02,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684697297] [2020-12-23 07:12:02,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-12-23 07:12:02,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:12:02,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-12-23 07:12:02,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2020-12-23 07:12:02,397 INFO L87 Difference]: Start difference. First operand 482 states and 491 transitions. Second operand 36 states. [2020-12-23 07:12:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:12:03,248 INFO L93 Difference]: Finished difference Result 621 states and 634 transitions. [2020-12-23 07:12:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-23 07:12:03,249 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 345 [2020-12-23 07:12:03,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:12:03,253 INFO L225 Difference]: With dead ends: 621 [2020-12-23 07:12:03,254 INFO L226 Difference]: Without dead ends: 551 [2020-12-23 07:12:03,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1064, Invalid=2016, Unknown=0, NotChecked=0, Total=3080 [2020-12-23 07:12:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-12-23 07:12:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 550. [2020-12-23 07:12:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-12-23 07:12:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 560 transitions. [2020-12-23 07:12:03,303 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 560 transitions. Word has length 345 [2020-12-23 07:12:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:12:03,304 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 560 transitions. [2020-12-23 07:12:03,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-12-23 07:12:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 560 transitions. [2020-12-23 07:12:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2020-12-23 07:12:03,307 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:12:03,307 INFO L422 BasicCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:12:03,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-12-23 07:12:03,521 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:12:03,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:12:03,522 INFO L82 PathProgramCache]: Analyzing trace with hash 874288955, now seen corresponding path program 5 times [2020-12-23 07:12:03,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:12:03,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778461076] [2020-12-23 07:12:03,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:12:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 10 proven. 18710 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2020-12-23 07:12:04,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778461076] [2020-12-23 07:12:04,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491609622] [2020-12-23 07:12:04,071 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:04,405 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2020-12-23 07:12:04,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:12:04,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-23 07:12:04,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:12:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 580 proven. 18730 refuted. 0 times theorem prover too weak. 2950 trivial. 0 not checked. [2020-12-23 07:12:06,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:12:06,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 31] total 39 [2020-12-23 07:12:06,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974129936] [2020-12-23 07:12:06,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-12-23 07:12:06,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:12:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-12-23 07:12:06,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1089, Unknown=0, NotChecked=0, Total=1482 [2020-12-23 07:12:06,023 INFO L87 Difference]: Start difference. First operand 550 states and 560 transitions. Second operand 39 states. [2020-12-23 07:12:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:12:07,626 INFO L93 Difference]: Finished difference Result 689 states and 703 transitions. [2020-12-23 07:12:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2020-12-23 07:12:07,627 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 413 [2020-12-23 07:12:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:12:07,631 INFO L225 Difference]: With dead ends: 689 [2020-12-23 07:12:07,631 INFO L226 Difference]: Without dead ends: 619 [2020-12-23 07:12:07,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2182, Invalid=4138, Unknown=0, NotChecked=0, Total=6320 [2020-12-23 07:12:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-12-23 07:12:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 618. [2020-12-23 07:12:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2020-12-23 07:12:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 629 transitions. [2020-12-23 07:12:07,661 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 629 transitions. Word has length 413 [2020-12-23 07:12:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:12:07,661 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 629 transitions. [2020-12-23 07:12:07,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-12-23 07:12:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 629 transitions. [2020-12-23 07:12:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2020-12-23 07:12:07,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:12:07,663 INFO L422 BasicCegarLoop]: trace histogram [140, 140, 140, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:12:07,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:07,864 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:12:07,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:12:07,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2038719617, now seen corresponding path program 6 times [2020-12-23 07:12:07,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:12:07,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371079580] [2020-12-23 07:12:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:12:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 30338 backedges. 12 proven. 26196 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2020-12-23 07:12:08,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371079580] [2020-12-23 07:12:08,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950539016] [2020-12-23 07:12:08,628 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:08,948 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2020-12-23 07:12:08,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:12:08,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-23 07:12:08,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:12:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 30338 backedges. 12 proven. 26196 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2020-12-23 07:12:10,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:12:10,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-12-23 07:12:10,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012549078] [2020-12-23 07:12:10,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 07:12:10,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:12:10,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 07:12:10,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2020-12-23 07:12:10,151 INFO L87 Difference]: Start difference. First operand 618 states and 629 transitions. Second operand 19 states. [2020-12-23 07:12:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:12:10,328 INFO L93 Difference]: Finished difference Result 756 states and 771 transitions. [2020-12-23 07:12:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 07:12:10,329 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 481 [2020-12-23 07:12:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:12:10,334 INFO L225 Difference]: With dead ends: 756 [2020-12-23 07:12:10,334 INFO L226 Difference]: Without dead ends: 686 [2020-12-23 07:12:10,334 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2020-12-23 07:12:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-12-23 07:12:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2020-12-23 07:12:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2020-12-23 07:12:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 698 transitions. [2020-12-23 07:12:10,379 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 698 transitions. Word has length 481 [2020-12-23 07:12:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:12:10,380 INFO L481 AbstractCegarLoop]: Abstraction has 686 states and 698 transitions. [2020-12-23 07:12:10,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 07:12:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 698 transitions. [2020-12-23 07:12:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2020-12-23 07:12:10,382 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:12:10,382 INFO L422 BasicCegarLoop]: trace histogram [160, 160, 160, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:12:10,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2020-12-23 07:12:10,583 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:12:10,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:12:10,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2034417091, now seen corresponding path program 7 times [2020-12-23 07:12:10,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:12:10,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038556173] [2020-12-23 07:12:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:12:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 39664 backedges. 14 proven. 34930 refuted. 0 times theorem prover too weak. 4720 trivial. 0 not checked. [2020-12-23 07:12:11,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038556173] [2020-12-23 07:12:11,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325257798] [2020-12-23 07:12:11,287 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:11,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 07:12:11,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:12:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 39664 backedges. 14 proven. 34930 refuted. 0 times theorem prover too weak. 4720 trivial. 0 not checked. [2020-12-23 07:12:12,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:12:12,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2020-12-23 07:12:12,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055478401] [2020-12-23 07:12:12,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-23 07:12:12,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:12:12,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-23 07:12:12,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2020-12-23 07:12:12,949 INFO L87 Difference]: Start difference. First operand 686 states and 698 transitions. Second operand 21 states. [2020-12-23 07:12:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:12:13,147 INFO L93 Difference]: Finished difference Result 824 states and 840 transitions. [2020-12-23 07:12:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 07:12:13,148 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 549 [2020-12-23 07:12:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:12:13,152 INFO L225 Difference]: With dead ends: 824 [2020-12-23 07:12:13,152 INFO L226 Difference]: Without dead ends: 754 [2020-12-23 07:12:13,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2020-12-23 07:12:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2020-12-23 07:12:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2020-12-23 07:12:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2020-12-23 07:12:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 767 transitions. [2020-12-23 07:12:13,194 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 767 transitions. Word has length 549 [2020-12-23 07:12:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:12:13,195 INFO L481 AbstractCegarLoop]: Abstraction has 754 states and 767 transitions. [2020-12-23 07:12:13,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-23 07:12:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 767 transitions. [2020-12-23 07:12:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2020-12-23 07:12:13,199 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:12:13,199 INFO L422 BasicCegarLoop]: trace histogram [180, 180, 180, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:12:13,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:13,400 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:12:13,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:12:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash -415039993, now seen corresponding path program 8 times [2020-12-23 07:12:13,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:12:13,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108559695] [2020-12-23 07:12:13,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:12:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 50238 backedges. 16 proven. 44912 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2020-12-23 07:12:14,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108559695] [2020-12-23 07:12:14,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205297280] [2020-12-23 07:12:14,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:14,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:12:14,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:12:14,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-23 07:12:14,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:12:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 50238 backedges. 16 proven. 44912 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2020-12-23 07:12:16,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:12:16,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2020-12-23 07:12:16,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033191999] [2020-12-23 07:12:16,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-23 07:12:16,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:12:16,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-23 07:12:16,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2020-12-23 07:12:16,220 INFO L87 Difference]: Start difference. First operand 754 states and 767 transitions. Second operand 23 states. [2020-12-23 07:12:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:12:16,426 INFO L93 Difference]: Finished difference Result 892 states and 909 transitions. [2020-12-23 07:12:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 07:12:16,426 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 617 [2020-12-23 07:12:16,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:12:16,429 INFO L225 Difference]: With dead ends: 892 [2020-12-23 07:12:16,429 INFO L226 Difference]: Without dead ends: 822 [2020-12-23 07:12:16,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2020-12-23 07:12:16,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2020-12-23 07:12:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2020-12-23 07:12:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2020-12-23 07:12:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 836 transitions. [2020-12-23 07:12:16,474 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 836 transitions. Word has length 617 [2020-12-23 07:12:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:12:16,474 INFO L481 AbstractCegarLoop]: Abstraction has 822 states and 836 transitions. [2020-12-23 07:12:16,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-23 07:12:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 836 transitions. [2020-12-23 07:12:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2020-12-23 07:12:16,477 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:12:16,478 INFO L422 BasicCegarLoop]: trace histogram [200, 200, 200, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:12:16,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-12-23 07:12:16,684 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:12:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:12:16,685 INFO L82 PathProgramCache]: Analyzing trace with hash -758293429, now seen corresponding path program 9 times [2020-12-23 07:12:16,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:12:16,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836032615] [2020-12-23 07:12:16,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:12:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 62060 backedges. 18 proven. 56142 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2020-12-23 07:12:17,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836032615] [2020-12-23 07:12:17,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079174752] [2020-12-23 07:12:17,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:18,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2020-12-23 07:12:18,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:12:18,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-23 07:12:18,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:12:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 62060 backedges. 18 proven. 56142 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2020-12-23 07:12:19,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:12:19,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2020-12-23 07:12:19,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988345212] [2020-12-23 07:12:19,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-23 07:12:19,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:12:19,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-23 07:12:19,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=355, Unknown=0, NotChecked=0, Total=600 [2020-12-23 07:12:19,913 INFO L87 Difference]: Start difference. First operand 822 states and 836 transitions. Second operand 25 states. [2020-12-23 07:12:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:12:20,124 INFO L93 Difference]: Finished difference Result 960 states and 978 transitions. [2020-12-23 07:12:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 07:12:20,125 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 685 [2020-12-23 07:12:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:12:20,128 INFO L225 Difference]: With dead ends: 960 [2020-12-23 07:12:20,128 INFO L226 Difference]: Without dead ends: 890 [2020-12-23 07:12:20,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=245, Invalid=355, Unknown=0, NotChecked=0, Total=600 [2020-12-23 07:12:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2020-12-23 07:12:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2020-12-23 07:12:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2020-12-23 07:12:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 905 transitions. [2020-12-23 07:12:20,189 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 905 transitions. Word has length 685 [2020-12-23 07:12:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:12:20,189 INFO L481 AbstractCegarLoop]: Abstraction has 890 states and 905 transitions. [2020-12-23 07:12:20,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-23 07:12:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 905 transitions. [2020-12-23 07:12:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2020-12-23 07:12:20,193 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:12:20,194 INFO L422 BasicCegarLoop]: trace histogram [220, 220, 220, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:12:20,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2020-12-23 07:12:20,395 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:12:20,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:12:20,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1515005809, now seen corresponding path program 10 times [2020-12-23 07:12:20,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:12:20,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793487832] [2020-12-23 07:12:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:12:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 75130 backedges. 20 proven. 68620 refuted. 0 times theorem prover too weak. 6490 trivial. 0 not checked. [2020-12-23 07:12:21,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793487832] [2020-12-23 07:12:21,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891892505] [2020-12-23 07:12:21,711 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:21,974 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-23 07:12:21,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:12:21,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 34 conjunts are in the unsatisfiable core [2020-12-23 07:12:21,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:12:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 75130 backedges. 552 proven. 68678 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2020-12-23 07:12:25,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:12:25,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 35] total 48 [2020-12-23 07:12:25,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789712378] [2020-12-23 07:12:25,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 48 states [2020-12-23 07:12:25,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:12:25,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2020-12-23 07:12:25,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=1717, Unknown=0, NotChecked=0, Total=2256 [2020-12-23 07:12:25,066 INFO L87 Difference]: Start difference. First operand 890 states and 905 transitions. Second operand 48 states. [2020-12-23 07:12:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:12:26,086 INFO L93 Difference]: Finished difference Result 1029 states and 1048 transitions. [2020-12-23 07:12:26,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-23 07:12:26,087 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 753 [2020-12-23 07:12:26,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:12:26,090 INFO L225 Difference]: With dead ends: 1029 [2020-12-23 07:12:26,090 INFO L226 Difference]: Without dead ends: 959 [2020-12-23 07:12:26,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1499, Invalid=3057, Unknown=0, NotChecked=0, Total=4556 [2020-12-23 07:12:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-12-23 07:12:26,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 958. [2020-12-23 07:12:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2020-12-23 07:12:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 974 transitions. [2020-12-23 07:12:26,141 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 974 transitions. Word has length 753 [2020-12-23 07:12:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:12:26,141 INFO L481 AbstractCegarLoop]: Abstraction has 958 states and 974 transitions. [2020-12-23 07:12:26,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2020-12-23 07:12:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 974 transitions. [2020-12-23 07:12:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2020-12-23 07:12:26,147 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:12:26,147 INFO L422 BasicCegarLoop]: trace histogram [240, 240, 240, 12, 12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:12:26,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-12-23 07:12:26,363 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:12:26,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:12:26,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1900311251, now seen corresponding path program 11 times [2020-12-23 07:12:26,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:12:26,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821792181] [2020-12-23 07:12:26,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:12:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 89448 backedges. 22 proven. 82346 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2020-12-23 07:12:27,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821792181] [2020-12-23 07:12:27,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654269877] [2020-12-23 07:12:27,631 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:28,314 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 110 check-sat command(s) [2020-12-23 07:12:28,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:12:28,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-23 07:12:28,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:12:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 89448 backedges. 554 proven. 82404 refuted. 0 times theorem prover too weak. 6490 trivial. 0 not checked. [2020-12-23 07:12:31,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:12:31,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 36] total 50 [2020-12-23 07:12:31,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430278907] [2020-12-23 07:12:31,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-12-23 07:12:31,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:12:31,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-12-23 07:12:31,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1914, Unknown=0, NotChecked=0, Total=2450 [2020-12-23 07:12:31,617 INFO L87 Difference]: Start difference. First operand 958 states and 974 transitions. Second operand 50 states. [2020-12-23 07:12:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:12:34,229 INFO L93 Difference]: Finished difference Result 1097 states and 1117 transitions. [2020-12-23 07:12:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2020-12-23 07:12:34,231 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 821 [2020-12-23 07:12:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:12:34,234 INFO L225 Difference]: With dead ends: 1097 [2020-12-23 07:12:34,234 INFO L226 Difference]: Without dead ends: 1027 [2020-12-23 07:12:34,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 787 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3142 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4046, Invalid=7944, Unknown=0, NotChecked=0, Total=11990 [2020-12-23 07:12:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2020-12-23 07:12:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1026. [2020-12-23 07:12:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2020-12-23 07:12:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1043 transitions. [2020-12-23 07:12:34,287 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1043 transitions. Word has length 821 [2020-12-23 07:12:34,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:12:34,287 INFO L481 AbstractCegarLoop]: Abstraction has 1026 states and 1043 transitions. [2020-12-23 07:12:34,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2020-12-23 07:12:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1043 transitions. [2020-12-23 07:12:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 890 [2020-12-23 07:12:34,295 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:12:34,295 INFO L422 BasicCegarLoop]: trace histogram [260, 260, 260, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:12:34,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2020-12-23 07:12:34,506 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:12:34,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:12:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash 777202455, now seen corresponding path program 12 times [2020-12-23 07:12:34,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:12:34,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171258444] [2020-12-23 07:12:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:12:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 105014 backedges. 24 proven. 97320 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2020-12-23 07:12:36,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171258444] [2020-12-23 07:12:36,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625262189] [2020-12-23 07:12:36,330 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:37,126 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 131 check-sat command(s) [2020-12-23 07:12:37,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:12:37,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-23 07:12:37,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:12:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 105014 backedges. 24 proven. 97320 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2020-12-23 07:12:39,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:12:39,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2020-12-23 07:12:39,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920492390] [2020-12-23 07:12:39,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-12-23 07:12:39,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:12:39,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-12-23 07:12:39,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=556, Unknown=0, NotChecked=0, Total=930 [2020-12-23 07:12:39,859 INFO L87 Difference]: Start difference. First operand 1026 states and 1043 transitions. Second operand 31 states. [2020-12-23 07:12:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:12:40,149 INFO L93 Difference]: Finished difference Result 1164 states and 1185 transitions. [2020-12-23 07:12:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 07:12:40,150 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 889 [2020-12-23 07:12:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:12:40,153 INFO L225 Difference]: With dead ends: 1164 [2020-12-23 07:12:40,153 INFO L226 Difference]: Without dead ends: 1094 [2020-12-23 07:12:40,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 875 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=556, Unknown=0, NotChecked=0, Total=930 [2020-12-23 07:12:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2020-12-23 07:12:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1094. [2020-12-23 07:12:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2020-12-23 07:12:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1112 transitions. [2020-12-23 07:12:40,200 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1112 transitions. Word has length 889 [2020-12-23 07:12:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:12:40,201 INFO L481 AbstractCegarLoop]: Abstraction has 1094 states and 1112 transitions. [2020-12-23 07:12:40,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-12-23 07:12:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1112 transitions. [2020-12-23 07:12:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2020-12-23 07:12:40,206 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:12:40,207 INFO L422 BasicCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:12:40,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:40,408 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:12:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:12:40,409 INFO L82 PathProgramCache]: Analyzing trace with hash -47185573, now seen corresponding path program 13 times [2020-12-23 07:12:40,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:12:40,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160213562] [2020-12-23 07:12:40,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:12:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 121828 backedges. 26 proven. 113542 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2020-12-23 07:12:42,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160213562] [2020-12-23 07:12:42,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424154993] [2020-12-23 07:12:42,287 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:42,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 1489 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 07:12:42,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:12:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 121828 backedges. 26 proven. 113542 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2020-12-23 07:12:45,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:12:45,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2020-12-23 07:12:45,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352921353] [2020-12-23 07:12:45,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-23 07:12:45,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:12:45,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-23 07:12:45,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=633, Unknown=0, NotChecked=0, Total=1056 [2020-12-23 07:12:45,722 INFO L87 Difference]: Start difference. First operand 1094 states and 1112 transitions. Second operand 33 states. [2020-12-23 07:12:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:12:46,026 INFO L93 Difference]: Finished difference Result 1232 states and 1254 transitions. [2020-12-23 07:12:46,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 07:12:46,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 957 [2020-12-23 07:12:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:12:46,030 INFO L225 Difference]: With dead ends: 1232 [2020-12-23 07:12:46,030 INFO L226 Difference]: Without dead ends: 1162 [2020-12-23 07:12:46,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 973 GetRequests, 942 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=633, Unknown=0, NotChecked=0, Total=1056 [2020-12-23 07:12:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-12-23 07:12:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2020-12-23 07:12:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2020-12-23 07:12:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1181 transitions. [2020-12-23 07:12:46,080 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1181 transitions. Word has length 957 [2020-12-23 07:12:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:12:46,081 INFO L481 AbstractCegarLoop]: Abstraction has 1162 states and 1181 transitions. [2020-12-23 07:12:46,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-23 07:12:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1181 transitions. [2020-12-23 07:12:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1026 [2020-12-23 07:12:46,087 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:12:46,088 INFO L422 BasicCegarLoop]: trace histogram [300, 300, 300, 15, 15, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:12:46,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2020-12-23 07:12:46,288 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:12:46,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:12:46,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1705768351, now seen corresponding path program 14 times [2020-12-23 07:12:46,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:12:46,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973359521] [2020-12-23 07:12:46,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:12:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 139890 backedges. 28 proven. 131012 refuted. 0 times theorem prover too weak. 8850 trivial. 0 not checked. [2020-12-23 07:12:48,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973359521] [2020-12-23 07:12:48,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840342240] [2020-12-23 07:12:48,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:48,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:12:48,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:12:48,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 1591 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-23 07:12:48,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:12:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 139890 backedges. 28 proven. 131012 refuted. 0 times theorem prover too weak. 8850 trivial. 0 not checked. [2020-12-23 07:12:52,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:12:52,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2020-12-23 07:12:52,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041010289] [2020-12-23 07:12:52,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-23 07:12:52,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:12:52,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-23 07:12:52,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2020-12-23 07:12:52,056 INFO L87 Difference]: Start difference. First operand 1162 states and 1181 transitions. Second operand 35 states. [2020-12-23 07:12:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:12:52,417 INFO L93 Difference]: Finished difference Result 1300 states and 1323 transitions. [2020-12-23 07:12:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 07:12:52,418 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1025 [2020-12-23 07:12:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:12:52,421 INFO L225 Difference]: With dead ends: 1300 [2020-12-23 07:12:52,421 INFO L226 Difference]: Without dead ends: 1230 [2020-12-23 07:12:52,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1042 GetRequests, 1009 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2020-12-23 07:12:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-12-23 07:12:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2020-12-23 07:12:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2020-12-23 07:12:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1250 transitions. [2020-12-23 07:12:52,471 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1250 transitions. Word has length 1025 [2020-12-23 07:12:52,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:12:52,472 INFO L481 AbstractCegarLoop]: Abstraction has 1230 states and 1250 transitions. [2020-12-23 07:12:52,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-23 07:12:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1250 transitions. [2020-12-23 07:12:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2020-12-23 07:12:52,479 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:12:52,480 INFO L422 BasicCegarLoop]: trace histogram [320, 320, 320, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:12:52,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-12-23 07:12:52,681 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:12:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:12:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1760032797, now seen corresponding path program 15 times [2020-12-23 07:12:52,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:12:52,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200074651] [2020-12-23 07:12:52,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:12:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:12:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 159200 backedges. 30 proven. 149730 refuted. 0 times theorem prover too weak. 9440 trivial. 0 not checked. [2020-12-23 07:12:55,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200074651] [2020-12-23 07:12:55,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988026972] [2020-12-23 07:12:55,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:12:56,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 134 check-sat command(s) [2020-12-23 07:12:56,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:12:56,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 07:12:56,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:12:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 159200 backedges. 30 proven. 149730 refuted. 0 times theorem prover too weak. 9440 trivial. 0 not checked. [2020-12-23 07:12:59,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:12:59,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2020-12-23 07:12:59,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996298739] [2020-12-23 07:12:59,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-12-23 07:12:59,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:12:59,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-12-23 07:12:59,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=802, Unknown=0, NotChecked=0, Total=1332 [2020-12-23 07:12:59,940 INFO L87 Difference]: Start difference. First operand 1230 states and 1250 transitions. Second operand 37 states. [2020-12-23 07:13:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:13:00,331 INFO L93 Difference]: Finished difference Result 1368 states and 1392 transitions. [2020-12-23 07:13:00,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 07:13:00,332 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1093 [2020-12-23 07:13:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:13:00,335 INFO L225 Difference]: With dead ends: 1368 [2020-12-23 07:13:00,335 INFO L226 Difference]: Without dead ends: 1298 [2020-12-23 07:13:00,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1111 GetRequests, 1076 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=530, Invalid=802, Unknown=0, NotChecked=0, Total=1332 [2020-12-23 07:13:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2020-12-23 07:13:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2020-12-23 07:13:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298 states. [2020-12-23 07:13:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1319 transitions. [2020-12-23 07:13:00,390 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1319 transitions. Word has length 1093 [2020-12-23 07:13:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:13:00,390 INFO L481 AbstractCegarLoop]: Abstraction has 1298 states and 1319 transitions. [2020-12-23 07:13:00,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-12-23 07:13:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1319 transitions. [2020-12-23 07:13:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1162 [2020-12-23 07:13:00,399 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:13:00,399 INFO L422 BasicCegarLoop]: trace histogram [340, 340, 340, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:13:00,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:13:00,600 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:13:00,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:13:00,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1471858649, now seen corresponding path program 16 times [2020-12-23 07:13:00,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:13:00,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304460911] [2020-12-23 07:13:00,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:13:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:13:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 179758 backedges. 32 proven. 169696 refuted. 0 times theorem prover too weak. 10030 trivial. 0 not checked. [2020-12-23 07:13:03,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304460911] [2020-12-23 07:13:03,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694723716] [2020-12-23 07:13:03,023 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:13:03,437 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-23 07:13:03,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:13:03,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 1754 conjuncts, 40 conjunts are in the unsatisfiable core [2020-12-23 07:13:03,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:13:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 179758 backedges. 564 proven. 169754 refuted. 0 times theorem prover too weak. 9440 trivial. 0 not checked. [2020-12-23 07:13:08,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:13:08,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 41] total 60 [2020-12-23 07:13:08,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017701774] [2020-12-23 07:13:08,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 60 states [2020-12-23 07:13:08,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:13:08,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2020-12-23 07:13:08,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=842, Invalid=2698, Unknown=0, NotChecked=0, Total=3540 [2020-12-23 07:13:08,861 INFO L87 Difference]: Start difference. First operand 1298 states and 1319 transitions. Second operand 60 states. [2020-12-23 07:13:10,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:13:10,028 INFO L93 Difference]: Finished difference Result 1437 states and 1462 transitions. [2020-12-23 07:13:10,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-12-23 07:13:10,029 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1161 [2020-12-23 07:13:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:13:10,032 INFO L225 Difference]: With dead ends: 1437 [2020-12-23 07:13:10,032 INFO L226 Difference]: Without dead ends: 1367 [2020-12-23 07:13:10,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1122 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2042, Invalid=4278, Unknown=0, NotChecked=0, Total=6320 [2020-12-23 07:13:10,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-12-23 07:13:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1366. [2020-12-23 07:13:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2020-12-23 07:13:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1388 transitions. [2020-12-23 07:13:10,091 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1388 transitions. Word has length 1161 [2020-12-23 07:13:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:13:10,092 INFO L481 AbstractCegarLoop]: Abstraction has 1366 states and 1388 transitions. [2020-12-23 07:13:10,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2020-12-23 07:13:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1388 transitions. [2020-12-23 07:13:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2020-12-23 07:13:10,103 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:13:10,104 INFO L422 BasicCegarLoop]: trace histogram [360, 360, 360, 18, 18, 18, 18, 18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:13:10,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-12-23 07:13:10,305 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:13:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:13:10,306 INFO L82 PathProgramCache]: Analyzing trace with hash -679180693, now seen corresponding path program 17 times [2020-12-23 07:13:10,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:13:10,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433961941] [2020-12-23 07:13:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:13:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:13:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 201564 backedges. 34 proven. 190910 refuted. 0 times theorem prover too weak. 10620 trivial. 0 not checked. [2020-12-23 07:13:13,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433961941] [2020-12-23 07:13:13,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709548232] [2020-12-23 07:13:13,367 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:13:14,988 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 156 check-sat command(s) [2020-12-23 07:13:14,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:13:14,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 43 conjunts are in the unsatisfiable core [2020-12-23 07:13:15,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:13:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 201564 backedges. 604 proven. 190930 refuted. 0 times theorem prover too weak. 10030 trivial. 0 not checked. [2020-12-23 07:13:20,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:13:20,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 43] total 63 [2020-12-23 07:13:20,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219802908] [2020-12-23 07:13:20,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 63 states [2020-12-23 07:13:20,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:13:20,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2020-12-23 07:13:20,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=891, Invalid=3015, Unknown=0, NotChecked=0, Total=3906 [2020-12-23 07:13:20,660 INFO L87 Difference]: Start difference. First operand 1366 states and 1388 transitions. Second operand 63 states. [2020-12-23 07:13:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:13:23,514 INFO L93 Difference]: Finished difference Result 1505 states and 1531 transitions. [2020-12-23 07:13:23,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2020-12-23 07:13:23,515 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1229 [2020-12-23 07:13:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:13:23,518 INFO L225 Difference]: With dead ends: 1505 [2020-12-23 07:13:23,519 INFO L226 Difference]: Without dead ends: 1435 [2020-12-23 07:13:23,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1311 GetRequests, 1188 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4019 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5366, Invalid=10134, Unknown=0, NotChecked=0, Total=15500 [2020-12-23 07:13:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-12-23 07:13:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1434. [2020-12-23 07:13:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2020-12-23 07:13:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1457 transitions. [2020-12-23 07:13:23,600 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1457 transitions. Word has length 1229 [2020-12-23 07:13:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:13:23,601 INFO L481 AbstractCegarLoop]: Abstraction has 1434 states and 1457 transitions. [2020-12-23 07:13:23,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2020-12-23 07:13:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1457 transitions. [2020-12-23 07:13:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2020-12-23 07:13:23,610 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:13:23,611 INFO L422 BasicCegarLoop]: trace histogram [380, 380, 380, 19, 19, 19, 19, 19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:13:23,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:13:23,812 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:13:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:13:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash -895028561, now seen corresponding path program 18 times [2020-12-23 07:13:23,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:13:23,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911751717] [2020-12-23 07:13:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:13:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:13:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 224618 backedges. 36 proven. 213372 refuted. 0 times theorem prover too weak. 11210 trivial. 0 not checked. [2020-12-23 07:13:26,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911751717] [2020-12-23 07:13:26,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291022772] [2020-12-23 07:13:26,653 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:13:28,128 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2020-12-23 07:13:28,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:13:28,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 1535 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-23 07:13:28,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:13:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 224618 backedges. 36 proven. 213372 refuted. 0 times theorem prover too weak. 11210 trivial. 0 not checked. [2020-12-23 07:13:33,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 07:13:33,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2020-12-23 07:13:33,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665527779] [2020-12-23 07:13:33,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-12-23 07:13:33,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:13:33,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-12-23 07:13:33,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1093, Unknown=0, NotChecked=0, Total=1806 [2020-12-23 07:13:33,216 INFO L87 Difference]: Start difference. First operand 1434 states and 1457 transitions. Second operand 43 states. [2020-12-23 07:13:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:13:33,648 INFO L93 Difference]: Finished difference Result 1572 states and 1599 transitions. [2020-12-23 07:13:33,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 07:13:33,649 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1297 [2020-12-23 07:13:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:13:33,653 INFO L225 Difference]: With dead ends: 1572 [2020-12-23 07:13:33,653 INFO L226 Difference]: Without dead ends: 1502 [2020-12-23 07:13:33,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1318 GetRequests, 1277 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=713, Invalid=1093, Unknown=0, NotChecked=0, Total=1806 [2020-12-23 07:13:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2020-12-23 07:13:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2020-12-23 07:13:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2020-12-23 07:13:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1526 transitions. [2020-12-23 07:13:33,738 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1526 transitions. Word has length 1297 [2020-12-23 07:13:33,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:13:33,739 INFO L481 AbstractCegarLoop]: Abstraction has 1502 states and 1526 transitions. [2020-12-23 07:13:33,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2020-12-23 07:13:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1526 transitions. [2020-12-23 07:13:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1366 [2020-12-23 07:13:33,749 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:13:33,749 INFO L422 BasicCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:13:33,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2020-12-23 07:13:33,950 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:13:33,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:13:33,951 INFO L82 PathProgramCache]: Analyzing trace with hash -822248205, now seen corresponding path program 19 times [2020-12-23 07:13:33,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:13:33,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792875594] [2020-12-23 07:13:33,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:13:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 07:13:34,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 07:13:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 07:13:34,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 07:13:34,995 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 07:13:34,995 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 07:13:34,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-12-23 07:13:35,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 07:13:35 BoogieIcfgContainer [2020-12-23 07:13:35,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 07:13:35,473 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 07:13:35,473 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 07:13:35,473 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 07:13:35,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:10:36" (3/4) ... [2020-12-23 07:13:35,476 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 07:13:35,948 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops-crafted-1/nested_delay_notd2.c-witness.graphml [2020-12-23 07:13:35,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 07:13:35,951 INFO L168 Benchmark]: Toolchain (without parser) took 180683.57 ms. Allocated memory was 151.0 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 125.5 MB in the beginning and 835.9 MB in the end (delta: -710.4 MB). Peak memory consumption was 541.6 MB. Max. memory is 8.0 GB. [2020-12-23 07:13:35,951 INFO L168 Benchmark]: CDTParser took 0.60 ms. Allocated memory is still 151.0 MB. Free memory is still 123.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 07:13:35,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.31 ms. Allocated memory is still 151.0 MB. Free memory was 125.4 MB in the beginning and 115.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-12-23 07:13:35,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.23 ms. Allocated memory is still 151.0 MB. Free memory was 115.4 MB in the beginning and 114.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-23 07:13:35,953 INFO L168 Benchmark]: Boogie Preprocessor took 60.56 ms. Allocated memory is still 151.0 MB. Free memory was 113.8 MB in the beginning and 112.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-23 07:13:35,953 INFO L168 Benchmark]: RCFGBuilder took 635.71 ms. Allocated memory is still 151.0 MB. Free memory was 112.8 MB in the beginning and 132.5 MB in the end (delta: -19.7 MB). Peak memory consumption was 17.1 MB. Max. memory is 8.0 GB. [2020-12-23 07:13:35,954 INFO L168 Benchmark]: TraceAbstraction took 179146.25 ms. Allocated memory was 151.0 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 132.0 MB in the beginning and 922.9 MB in the end (delta: -791.0 MB). Peak memory consumption was 460.5 MB. Max. memory is 8.0 GB. [2020-12-23 07:13:35,954 INFO L168 Benchmark]: Witness Printer took 475.88 ms. Allocated memory is still 1.4 GB. Free memory was 922.9 MB in the beginning and 835.9 MB in the end (delta: 87.0 MB). Peak memory consumption was 86.0 MB. Max. memory is 8.0 GB. [2020-12-23 07:13:35,957 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.60 ms. Allocated memory is still 151.0 MB. Free memory is still 123.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 298.31 ms. Allocated memory is still 151.0 MB. Free memory was 125.4 MB in the beginning and 115.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 56.23 ms. Allocated memory is still 151.0 MB. Free memory was 115.4 MB in the beginning and 114.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 60.56 ms. Allocated memory is still 151.0 MB. Free memory was 113.8 MB in the beginning and 112.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 635.71 ms. Allocated memory is still 151.0 MB. Free memory was 112.8 MB in the beginning and 132.5 MB in the end (delta: -19.7 MB). Peak memory consumption was 17.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 179146.25 ms. Allocated memory was 151.0 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 132.0 MB in the beginning and 922.9 MB in the end (delta: -791.0 MB). Peak memory consumption was 460.5 MB. Max. memory is 8.0 GB. * Witness Printer took 475.88 ms. Allocated memory is still 1.4 GB. Free memory was 922.9 MB in the beginning and 835.9 MB in the end (delta: 87.0 MB). Peak memory consumption was 86.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L9] int last ; [L18] int SIZE = 20; VAL [last=0, SIZE=20] [L20] last = __VERIFIER_nondet_int() [L6] COND FALSE !(!cond) VAL [last=22, SIZE=20] [L22] int a=0,b=0,c=0,st=0,d=0; VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [last=22, SIZE=20] [L11] COND TRUE !(cond) VAL [last=22, SIZE=20] [L12] reach_error() VAL [last=22, SIZE=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 178.6s, OverallIterations: 55, TraceHistogramMax: 400, AutomataDifference: 61.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 756 SDtfs, 10877 SDslu, 4300 SDs, 0 SdLazy, 20764 SolverSat, 1785 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16882 GetRequests, 14567 SyntacticMatches, 2 SemanticMatches, 2313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61298 ImplicationChecksByTransitivity, 62.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1714occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 54 MinimizatonAttempts, 6839 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.6s SsaConstructionTime, 10.2s SatisfiabilityAnalysisTime, 73.5s InterpolantComputationTime, 31971 NumberOfCodeBlocks, 30611 NumberOfCodeBlocksAsserted, 1089 NumberOfCheckSat, 30506 ConstructedInterpolants, 0 QuantifiedInterpolants, 140896458 SizeOfPredicates, 136 NumberOfNonLiveVariables, 23583 ConjunctsInSsa, 803 ConjunctsInUnsatCore, 100 InterpolantComputations, 12 PerfectInterpolantSequences, 253138/3128819 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 incorrect! Received shutdown request...