/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/recursive-simple/sum_25x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:21:29,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:21:29,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:21:29,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:21:29,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:21:29,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:21:29,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:21:29,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:21:29,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:21:29,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:21:29,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:21:29,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:21:29,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:21:29,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:21:29,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:21:29,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:21:29,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:21:29,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:21:29,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:21:29,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:21:29,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:21:29,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:21:29,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:21:29,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:21:29,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:21:29,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:21:29,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:21:29,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:21:29,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:21:29,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:21:29,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:21:29,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:21:29,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:21:29,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:21:29,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:21:29,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:21:29,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:21:29,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:21:29,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:21:29,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:21:29,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:21:29,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:21:29,769 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:21:29,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:21:29,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:21:29,776 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:21:29,776 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:21:29,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:21:29,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:21:29,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:21:29,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:21:29,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:21:29,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:21:29,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:21:29,778 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:21:29,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:21:29,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:21:29,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:21:29,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:21:29,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:21:29,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:21:29,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:21:29,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:21:29,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:21:29,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:21:29,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:21:29,781 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:21:29,781 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 [2021-01-06 19:21:30,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:21:30,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:21:30,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:21:30,260 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:21:30,261 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:21:30,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2021-01-06 19:21:30,354 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/46a7cf558/b46c3ed80b66414f8de61b7c25f0ad39/FLAG379dd2db9 [2021-01-06 19:21:31,086 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:21:31,087 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2021-01-06 19:21:31,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/46a7cf558/b46c3ed80b66414f8de61b7c25f0ad39/FLAG379dd2db9 [2021-01-06 19:21:31,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/46a7cf558/b46c3ed80b66414f8de61b7c25f0ad39 [2021-01-06 19:21:31,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:21:31,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:21:31,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:21:31,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:21:31,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:21:31,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:21:31" (1/1) ... [2021-01-06 19:21:31,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f18863e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31, skipping insertion in model container [2021-01-06 19:21:31,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:21:31" (1/1) ... [2021-01-06 19:21:31,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:21:31,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:21:31,656 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/recursive-simple/sum_25x0-2.c[481,494] [2021-01-06 19:21:31,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:21:31,684 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:21:31,700 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/recursive-simple/sum_25x0-2.c[481,494] [2021-01-06 19:21:31,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:21:31,716 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:21:31,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31 WrapperNode [2021-01-06 19:21:31,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:21:31,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:21:31,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:21:31,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:21:31,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31" (1/1) ... [2021-01-06 19:21:31,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31" (1/1) ... [2021-01-06 19:21:31,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:21:31,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:21:31,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:21:31,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:21:31,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31" (1/1) ... [2021-01-06 19:21:31,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31" (1/1) ... [2021-01-06 19:21:31,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31" (1/1) ... [2021-01-06 19:21:31,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31" (1/1) ... [2021-01-06 19:21:31,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31" (1/1) ... [2021-01-06 19:21:31,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31" (1/1) ... [2021-01-06 19:21:31,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31" (1/1) ... [2021-01-06 19:21:31,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:21:31,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:21:31,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:21:31,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:21:31,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31" (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 [2021-01-06 19:21:31,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:21:31,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:21:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2021-01-06 19:21:31,883 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2021-01-06 19:21:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:21:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:21:32,133 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:21:32,134 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 19:21:32,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:21:32 BoogieIcfgContainer [2021-01-06 19:21:32,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:21:32,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:21:32,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:21:32,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:21:32,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:21:31" (1/3) ... [2021-01-06 19:21:32,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643c11aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:21:32, skipping insertion in model container [2021-01-06 19:21:32,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:31" (2/3) ... [2021-01-06 19:21:32,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643c11aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:21:32, skipping insertion in model container [2021-01-06 19:21:32,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:21:32" (3/3) ... [2021-01-06 19:21:32,146 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_25x0-2.c [2021-01-06 19:21:32,154 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:21:32,160 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:21:32,186 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:21:32,305 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:21:32,305 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:21:32,305 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:21:32,306 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:21:32,306 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:21:32,306 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:21:32,306 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:21:32,306 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:21:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2021-01-06 19:21:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-06 19:21:32,367 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:32,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:32,372 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:32,387 INFO L82 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2021-01-06 19:21:32,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:32,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155133917] [2021-01-06 19:21:32,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:32,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:21:32,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155133917] [2021-01-06 19:21:32,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:21:32,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:21:32,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224921461] [2021-01-06 19:21:32,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:21:32,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:32,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:21:32,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:21:32,852 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 5 states. [2021-01-06 19:21:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:32,977 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-01-06 19:21:32,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:21:32,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-01-06 19:21:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:32,988 INFO L225 Difference]: With dead ends: 25 [2021-01-06 19:21:32,988 INFO L226 Difference]: Without dead ends: 15 [2021-01-06 19:21:32,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:21:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-01-06 19:21:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-01-06 19:21:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-01-06 19:21:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-01-06 19:21:33,033 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2021-01-06 19:21:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:33,034 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-01-06 19:21:33,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:21:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-01-06 19:21:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 19:21:33,036 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:33,036 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:33,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:21:33,037 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:33,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:33,038 INFO L82 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2021-01-06 19:21:33,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:33,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620134840] [2021-01-06 19:21:33,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:33,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:33,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:21:33,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620134840] [2021-01-06 19:21:33,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643728568] [2021-01-06 19:21:33,141 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 [2021-01-06 19:21:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:33,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 19:21:33,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:21:33,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:33,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-01-06 19:21:33,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360066] [2021-01-06 19:21:33,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:21:33,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:33,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:21:33,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:21:33,320 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2021-01-06 19:21:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:33,372 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2021-01-06 19:21:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:21:33,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2021-01-06 19:21:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:33,375 INFO L225 Difference]: With dead ends: 22 [2021-01-06 19:21:33,375 INFO L226 Difference]: Without dead ends: 18 [2021-01-06 19:21:33,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:21:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-01-06 19:21:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-01-06 19:21:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-01-06 19:21:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2021-01-06 19:21:33,391 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2021-01-06 19:21:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:33,392 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2021-01-06 19:21:33,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:21:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2021-01-06 19:21:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 19:21:33,395 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:33,395 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:33,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-01-06 19:21:33,597 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:33,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:33,597 INFO L82 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2021-01-06 19:21:33,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:33,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630251475] [2021-01-06 19:21:33,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:33,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:33,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:33,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:21:33,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630251475] [2021-01-06 19:21:33,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901582423] [2021-01-06 19:21:33,829 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 [2021-01-06 19:21:33,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 19:21:33,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:33,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 19:21:33,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:21:33,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:33,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-01-06 19:21:33,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517590968] [2021-01-06 19:21:33,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:21:33,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:33,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:21:33,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:21:33,978 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2021-01-06 19:21:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:34,043 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2021-01-06 19:21:34,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:21:34,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2021-01-06 19:21:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:34,045 INFO L225 Difference]: With dead ends: 25 [2021-01-06 19:21:34,045 INFO L226 Difference]: Without dead ends: 21 [2021-01-06 19:21:34,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:21:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-01-06 19:21:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-01-06 19:21:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-01-06 19:21:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-01-06 19:21:34,053 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2021-01-06 19:21:34,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:34,053 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-01-06 19:21:34,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:21:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-01-06 19:21:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 19:21:34,055 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:34,055 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:34,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:34,270 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:34,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:34,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2021-01-06 19:21:34,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:34,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867987337] [2021-01-06 19:21:34,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:34,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:34,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:34,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:34,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 19:21:34,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867987337] [2021-01-06 19:21:34,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378637742] [2021-01-06 19:21:34,428 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 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 [2021-01-06 19:21:34,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-06 19:21:34,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:34,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-06 19:21:34,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 19:21:34,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:34,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-01-06 19:21:34,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111486810] [2021-01-06 19:21:34,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:21:34,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:21:34,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:21:34,594 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2021-01-06 19:21:34,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:34,666 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2021-01-06 19:21:34,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:21:34,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2021-01-06 19:21:34,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:34,668 INFO L225 Difference]: With dead ends: 28 [2021-01-06 19:21:34,668 INFO L226 Difference]: Without dead ends: 24 [2021-01-06 19:21:34,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:21:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-01-06 19:21:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-01-06 19:21:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-01-06 19:21:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-01-06 19:21:34,676 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 28 [2021-01-06 19:21:34,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:34,676 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-01-06 19:21:34,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:21:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-01-06 19:21:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 19:21:34,678 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:34,678 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:34,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:34,893 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:34,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:34,894 INFO L82 PathProgramCache]: Analyzing trace with hash 371264716, now seen corresponding path program 4 times [2021-01-06 19:21:34,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:34,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317312415] [2021-01-06 19:21:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:34,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:34,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:35,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:35,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:35,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 19:21:35,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317312415] [2021-01-06 19:21:35,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704978503] [2021-01-06 19:21:35,088 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 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 [2021-01-06 19:21:35,134 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 19:21:35,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:35,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-06 19:21:35,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 19:21:35,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:35,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-01-06 19:21:35,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302618854] [2021-01-06 19:21:35,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:21:35,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:35,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:21:35,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:21:35,228 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2021-01-06 19:21:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:35,320 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2021-01-06 19:21:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:21:35,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2021-01-06 19:21:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:35,323 INFO L225 Difference]: With dead ends: 31 [2021-01-06 19:21:35,323 INFO L226 Difference]: Without dead ends: 27 [2021-01-06 19:21:35,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:21:35,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-01-06 19:21:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-01-06 19:21:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-01-06 19:21:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-01-06 19:21:35,330 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 34 [2021-01-06 19:21:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:35,331 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-01-06 19:21:35,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:21:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-01-06 19:21:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 19:21:35,333 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:35,333 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:35,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:35,547 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:35,549 INFO L82 PathProgramCache]: Analyzing trace with hash -886339242, now seen corresponding path program 5 times [2021-01-06 19:21:35,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:35,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481397814] [2021-01-06 19:21:35,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:35,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:35,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:35,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:35,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:35,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:35,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-01-06 19:21:35,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481397814] [2021-01-06 19:21:35,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522984431] [2021-01-06 19:21:35,838 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 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 [2021-01-06 19:21:35,900 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-01-06 19:21:35,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:35,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:21:35,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-01-06 19:21:36,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:36,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-01-06 19:21:36,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104041458] [2021-01-06 19:21:36,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:21:36,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:36,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:21:36,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:21:36,025 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 11 states. [2021-01-06 19:21:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:36,138 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2021-01-06 19:21:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:21:36,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2021-01-06 19:21:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:36,139 INFO L225 Difference]: With dead ends: 34 [2021-01-06 19:21:36,139 INFO L226 Difference]: Without dead ends: 30 [2021-01-06 19:21:36,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:21:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-01-06 19:21:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-01-06 19:21:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-06 19:21:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2021-01-06 19:21:36,147 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 40 [2021-01-06 19:21:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:36,147 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2021-01-06 19:21:36,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:21:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2021-01-06 19:21:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-06 19:21:36,149 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:36,149 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:36,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-01-06 19:21:36,364 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:36,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:36,365 INFO L82 PathProgramCache]: Analyzing trace with hash -918712436, now seen corresponding path program 6 times [2021-01-06 19:21:36,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:36,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450381925] [2021-01-06 19:21:36,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:36,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:36,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:36,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:36,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:36,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:36,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:36,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-01-06 19:21:36,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450381925] [2021-01-06 19:21:36,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406715037] [2021-01-06 19:21:36,619 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 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 [2021-01-06 19:21:36,707 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-01-06 19:21:36,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:36,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-06 19:21:36,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-01-06 19:21:36,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:36,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-01-06 19:21:36,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320446069] [2021-01-06 19:21:36,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 19:21:36,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 19:21:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:21:36,835 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 12 states. [2021-01-06 19:21:36,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:36,947 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2021-01-06 19:21:36,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:21:36,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2021-01-06 19:21:36,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:36,949 INFO L225 Difference]: With dead ends: 37 [2021-01-06 19:21:36,949 INFO L226 Difference]: Without dead ends: 33 [2021-01-06 19:21:36,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:21:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-01-06 19:21:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-01-06 19:21:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2021-01-06 19:21:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-01-06 19:21:36,957 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 46 [2021-01-06 19:21:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:36,957 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-01-06 19:21:36,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 19:21:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-01-06 19:21:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 19:21:36,959 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:36,959 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:37,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:37,173 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:37,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:37,174 INFO L82 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 7 times [2021-01-06 19:21:37,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:37,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418846621] [2021-01-06 19:21:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:37,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:37,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:37,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:37,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:37,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:37,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:37,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:37,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-01-06 19:21:37,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418846621] [2021-01-06 19:21:37,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817381031] [2021-01-06 19:21:37,427 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 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 [2021-01-06 19:21:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:37,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 18 conjunts are in the unsatisfiable core [2021-01-06 19:21:37,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-01-06 19:21:37,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:37,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-01-06 19:21:37,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11119416] [2021-01-06 19:21:37,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 19:21:37,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:37,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 19:21:37,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:21:37,624 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 13 states. [2021-01-06 19:21:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:37,763 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2021-01-06 19:21:37,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 19:21:37,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2021-01-06 19:21:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:37,765 INFO L225 Difference]: With dead ends: 40 [2021-01-06 19:21:37,766 INFO L226 Difference]: Without dead ends: 36 [2021-01-06 19:21:37,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2021-01-06 19:21:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-01-06 19:21:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-01-06 19:21:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-01-06 19:21:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2021-01-06 19:21:37,773 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2021-01-06 19:21:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:37,774 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2021-01-06 19:21:37,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 19:21:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2021-01-06 19:21:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 19:21:37,775 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:37,775 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:37,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:37,991 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:37,992 INFO L82 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 8 times [2021-01-06 19:21:37,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:37,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950487734] [2021-01-06 19:21:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:38,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:38,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:38,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:38,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:38,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:38,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:38,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:38,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:38,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-01-06 19:21:38,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950487734] [2021-01-06 19:21:38,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395914977] [2021-01-06 19:21:38,305 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 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 [2021-01-06 19:21:38,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 19:21:38,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:38,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjunts are in the unsatisfiable core [2021-01-06 19:21:38,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-01-06 19:21:38,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:38,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2021-01-06 19:21:38,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776608565] [2021-01-06 19:21:38,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 19:21:38,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:38,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 19:21:38,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:21:38,520 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 14 states. [2021-01-06 19:21:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:38,677 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2021-01-06 19:21:38,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 19:21:38,677 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2021-01-06 19:21:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:38,683 INFO L225 Difference]: With dead ends: 43 [2021-01-06 19:21:38,683 INFO L226 Difference]: Without dead ends: 39 [2021-01-06 19:21:38,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2021-01-06 19:21:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-01-06 19:21:38,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-01-06 19:21:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2021-01-06 19:21:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-01-06 19:21:38,707 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 58 [2021-01-06 19:21:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:38,710 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-01-06 19:21:38,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 19:21:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-01-06 19:21:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 19:21:38,712 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:38,712 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:38,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-06 19:21:38,930 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:38,931 INFO L82 PathProgramCache]: Analyzing trace with hash -366706730, now seen corresponding path program 9 times [2021-01-06 19:21:38,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:38,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054610106] [2021-01-06 19:21:38,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:38,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-01-06 19:21:39,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054610106] [2021-01-06 19:21:39,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864521000] [2021-01-06 19:21:39,267 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 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 [2021-01-06 19:21:39,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-01-06 19:21:39,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:39,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-06 19:21:39,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-01-06 19:21:39,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:39,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2021-01-06 19:21:39,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314156562] [2021-01-06 19:21:39,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 19:21:39,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:39,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 19:21:39,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:21:39,478 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 15 states. [2021-01-06 19:21:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:39,644 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2021-01-06 19:21:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 19:21:39,645 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2021-01-06 19:21:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:39,646 INFO L225 Difference]: With dead ends: 46 [2021-01-06 19:21:39,646 INFO L226 Difference]: Without dead ends: 42 [2021-01-06 19:21:39,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=387, Unknown=0, NotChecked=0, Total=600 [2021-01-06 19:21:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-01-06 19:21:39,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-01-06 19:21:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2021-01-06 19:21:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2021-01-06 19:21:39,653 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 64 [2021-01-06 19:21:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:39,653 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2021-01-06 19:21:39,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 19:21:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2021-01-06 19:21:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:21:39,655 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:39,655 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:39,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:39,870 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:39,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1719425780, now seen corresponding path program 10 times [2021-01-06 19:21:39,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:39,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67698912] [2021-01-06 19:21:39,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:39,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:40,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:40,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:40,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:40,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:40,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:40,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:40,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:40,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-01-06 19:21:40,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67698912] [2021-01-06 19:21:40,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736911779] [2021-01-06 19:21:40,279 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 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 [2021-01-06 19:21:40,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 19:21:40,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:40,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 24 conjunts are in the unsatisfiable core [2021-01-06 19:21:40,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-01-06 19:21:40,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:40,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2021-01-06 19:21:40,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472655136] [2021-01-06 19:21:40,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 19:21:40,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:40,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 19:21:40,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2021-01-06 19:21:40,547 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 16 states. [2021-01-06 19:21:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:40,718 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2021-01-06 19:21:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 19:21:40,719 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2021-01-06 19:21:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:40,720 INFO L225 Difference]: With dead ends: 49 [2021-01-06 19:21:40,720 INFO L226 Difference]: Without dead ends: 45 [2021-01-06 19:21:40,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=250, Invalid=452, Unknown=0, NotChecked=0, Total=702 [2021-01-06 19:21:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-01-06 19:21:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-01-06 19:21:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2021-01-06 19:21:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-01-06 19:21:40,727 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 70 [2021-01-06 19:21:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:40,728 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-01-06 19:21:40,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 19:21:40,728 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-01-06 19:21:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:21:40,729 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:40,729 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:40,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:40,944 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:40,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:40,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1354232598, now seen corresponding path program 11 times [2021-01-06 19:21:40,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:40,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272069029] [2021-01-06 19:21:40,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:40,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:41,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:41,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:41,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:41,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:41,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:41,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:41,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:41,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:41,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:41,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:41,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2021-01-06 19:21:41,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272069029] [2021-01-06 19:21:41,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679900858] [2021-01-06 19:21:41,409 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 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 [2021-01-06 19:21:41,496 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2021-01-06 19:21:41,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:41,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjunts are in the unsatisfiable core [2021-01-06 19:21:41,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2021-01-06 19:21:41,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:41,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2021-01-06 19:21:41,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673925190] [2021-01-06 19:21:41,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 19:21:41,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:41,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 19:21:41,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:21:41,623 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 17 states. [2021-01-06 19:21:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:41,836 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2021-01-06 19:21:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 19:21:41,837 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2021-01-06 19:21:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:41,838 INFO L225 Difference]: With dead ends: 52 [2021-01-06 19:21:41,838 INFO L226 Difference]: Without dead ends: 48 [2021-01-06 19:21:41,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=522, Unknown=0, NotChecked=0, Total=812 [2021-01-06 19:21:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-01-06 19:21:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-01-06 19:21:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2021-01-06 19:21:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2021-01-06 19:21:41,845 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 76 [2021-01-06 19:21:41,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:41,846 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2021-01-06 19:21:41,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 19:21:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2021-01-06 19:21:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:21:41,847 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:41,847 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:42,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 19:21:42,063 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:42,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:42,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1734686668, now seen corresponding path program 12 times [2021-01-06 19:21:42,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:42,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241506868] [2021-01-06 19:21:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-01-06 19:21:42,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241506868] [2021-01-06 19:21:42,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654657331] [2021-01-06 19:21:42,604 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 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 [2021-01-06 19:21:42,706 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2021-01-06 19:21:42,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:42,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 28 conjunts are in the unsatisfiable core [2021-01-06 19:21:42,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-01-06 19:21:42,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:42,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2021-01-06 19:21:42,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477604578] [2021-01-06 19:21:42,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 19:21:42,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:42,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 19:21:42,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:21:42,861 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 18 states. [2021-01-06 19:21:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:43,072 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2021-01-06 19:21:43,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 19:21:43,073 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 82 [2021-01-06 19:21:43,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:43,074 INFO L225 Difference]: With dead ends: 55 [2021-01-06 19:21:43,074 INFO L226 Difference]: Without dead ends: 51 [2021-01-06 19:21:43,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=333, Invalid=597, Unknown=0, NotChecked=0, Total=930 [2021-01-06 19:21:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-01-06 19:21:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-01-06 19:21:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-01-06 19:21:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2021-01-06 19:21:43,082 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 82 [2021-01-06 19:21:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:43,082 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2021-01-06 19:21:43,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 19:21:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2021-01-06 19:21:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 19:21:43,083 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:43,083 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:43,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-06 19:21:43,298 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1433749930, now seen corresponding path program 13 times [2021-01-06 19:21:43,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:43,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449960261] [2021-01-06 19:21:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2021-01-06 19:21:43,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449960261] [2021-01-06 19:21:43,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878704877] [2021-01-06 19:21:43,818 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 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 [2021-01-06 19:21:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:43,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-06 19:21:43,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2021-01-06 19:21:44,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:44,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2021-01-06 19:21:44,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498291548] [2021-01-06 19:21:44,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 19:21:44,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:44,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 19:21:44,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:21:44,040 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 19 states. [2021-01-06 19:21:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:44,234 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2021-01-06 19:21:44,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 19:21:44,235 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 88 [2021-01-06 19:21:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:44,236 INFO L225 Difference]: With dead ends: 58 [2021-01-06 19:21:44,236 INFO L226 Difference]: Without dead ends: 54 [2021-01-06 19:21:44,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=379, Invalid=677, Unknown=0, NotChecked=0, Total=1056 [2021-01-06 19:21:44,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-01-06 19:21:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-01-06 19:21:44,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-01-06 19:21:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2021-01-06 19:21:44,244 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 88 [2021-01-06 19:21:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:44,245 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2021-01-06 19:21:44,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 19:21:44,245 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2021-01-06 19:21:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:21:44,246 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:44,246 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:44,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 19:21:44,460 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:44,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:44,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1321174388, now seen corresponding path program 14 times [2021-01-06 19:21:44,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:44,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822849687] [2021-01-06 19:21:44,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:44,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:45,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:45,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-01-06 19:21:45,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822849687] [2021-01-06 19:21:45,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945213550] [2021-01-06 19:21:45,146 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 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 [2021-01-06 19:21:45,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 19:21:45,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:45,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 32 conjunts are in the unsatisfiable core [2021-01-06 19:21:45,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-01-06 19:21:45,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:45,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2021-01-06 19:21:45,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713146918] [2021-01-06 19:21:45,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 19:21:45,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:45,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 19:21:45,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2021-01-06 19:21:45,389 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 20 states. [2021-01-06 19:21:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:45,655 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2021-01-06 19:21:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 19:21:45,656 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2021-01-06 19:21:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:45,657 INFO L225 Difference]: With dead ends: 61 [2021-01-06 19:21:45,657 INFO L226 Difference]: Without dead ends: 57 [2021-01-06 19:21:45,658 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=428, Invalid=762, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 19:21:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-01-06 19:21:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-01-06 19:21:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-01-06 19:21:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2021-01-06 19:21:45,664 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 94 [2021-01-06 19:21:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:45,665 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2021-01-06 19:21:45,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-06 19:21:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2021-01-06 19:21:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:21:45,666 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:45,666 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:45,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:45,881 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:45,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:45,881 INFO L82 PathProgramCache]: Analyzing trace with hash 415287702, now seen corresponding path program 15 times [2021-01-06 19:21:45,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:45,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811196949] [2021-01-06 19:21:45,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:45,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:45,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2021-01-06 19:21:46,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811196949] [2021-01-06 19:21:46,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579434784] [2021-01-06 19:21:46,612 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 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 [2021-01-06 19:21:46,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2021-01-06 19:21:46,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:46,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-06 19:21:46,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2021-01-06 19:21:46,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:46,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2021-01-06 19:21:46,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118879232] [2021-01-06 19:21:46,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-06 19:21:46,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:46,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-06 19:21:46,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2021-01-06 19:21:46,934 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 21 states. [2021-01-06 19:21:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:47,178 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2021-01-06 19:21:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 19:21:47,178 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 100 [2021-01-06 19:21:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:47,179 INFO L225 Difference]: With dead ends: 64 [2021-01-06 19:21:47,179 INFO L226 Difference]: Without dead ends: 60 [2021-01-06 19:21:47,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=480, Invalid=852, Unknown=0, NotChecked=0, Total=1332 [2021-01-06 19:21:47,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-01-06 19:21:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-01-06 19:21:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-01-06 19:21:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2021-01-06 19:21:47,186 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 100 [2021-01-06 19:21:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:47,186 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2021-01-06 19:21:47,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-06 19:21:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2021-01-06 19:21:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 19:21:47,188 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:47,188 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:47,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 19:21:47,403 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:47,404 INFO L82 PathProgramCache]: Analyzing trace with hash 317812044, now seen corresponding path program 16 times [2021-01-06 19:21:47,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:47,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211309188] [2021-01-06 19:21:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:47,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2021-01-06 19:21:48,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211309188] [2021-01-06 19:21:48,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138959869] [2021-01-06 19:21:48,123 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 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 [2021-01-06 19:21:48,211 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 19:21:48,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:48,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 36 conjunts are in the unsatisfiable core [2021-01-06 19:21:48,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2021-01-06 19:21:48,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:48,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2021-01-06 19:21:48,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516776786] [2021-01-06 19:21:48,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-06 19:21:48,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:48,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-06 19:21:48,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2021-01-06 19:21:48,363 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 22 states. [2021-01-06 19:21:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:48,612 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2021-01-06 19:21:48,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 19:21:48,613 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 106 [2021-01-06 19:21:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:48,614 INFO L225 Difference]: With dead ends: 67 [2021-01-06 19:21:48,614 INFO L226 Difference]: Without dead ends: 63 [2021-01-06 19:21:48,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=535, Invalid=947, Unknown=0, NotChecked=0, Total=1482 [2021-01-06 19:21:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-01-06 19:21:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-01-06 19:21:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-01-06 19:21:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2021-01-06 19:21:48,620 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 106 [2021-01-06 19:21:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:48,621 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2021-01-06 19:21:48,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-06 19:21:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2021-01-06 19:21:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-06 19:21:48,622 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:48,622 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:48,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 19:21:48,836 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:48,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:48,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2122437418, now seen corresponding path program 17 times [2021-01-06 19:21:48,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:48,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288222630] [2021-01-06 19:21:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:48,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:48,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:48,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2021-01-06 19:21:49,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288222630] [2021-01-06 19:21:49,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410944549] [2021-01-06 19:21:49,626 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 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 [2021-01-06 19:21:49,744 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2021-01-06 19:21:49,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:49,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 38 conjunts are in the unsatisfiable core [2021-01-06 19:21:49,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2021-01-06 19:21:49,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:49,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2021-01-06 19:21:49,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875290787] [2021-01-06 19:21:49,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-06 19:21:49,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:49,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-06 19:21:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2021-01-06 19:21:49,911 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 23 states. [2021-01-06 19:21:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:50,207 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2021-01-06 19:21:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 19:21:50,207 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 112 [2021-01-06 19:21:50,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:50,208 INFO L225 Difference]: With dead ends: 70 [2021-01-06 19:21:50,209 INFO L226 Difference]: Without dead ends: 66 [2021-01-06 19:21:50,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=593, Invalid=1047, Unknown=0, NotChecked=0, Total=1640 [2021-01-06 19:21:50,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-01-06 19:21:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-01-06 19:21:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-01-06 19:21:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2021-01-06 19:21:50,215 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 112 [2021-01-06 19:21:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:50,216 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2021-01-06 19:21:50,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-06 19:21:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2021-01-06 19:21:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 19:21:50,217 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:50,217 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:50,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 19:21:50,431 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:50,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:50,431 INFO L82 PathProgramCache]: Analyzing trace with hash 55840780, now seen corresponding path program 18 times [2021-01-06 19:21:50,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:50,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373656662] [2021-01-06 19:21:50,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:51,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:51,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:51,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:51,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:51,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2021-01-06 19:21:51,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373656662] [2021-01-06 19:21:51,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461692946] [2021-01-06 19:21:51,272 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 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 [2021-01-06 19:21:51,401 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2021-01-06 19:21:51,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:51,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 80 conjunts are in the unsatisfiable core [2021-01-06 19:21:51,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2021-01-06 19:21:53,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:53,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 43] total 63 [2021-01-06 19:21:53,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712695804] [2021-01-06 19:21:53,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-01-06 19:21:53,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:53,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-01-06 19:21:53,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=3286, Unknown=0, NotChecked=0, Total=3906 [2021-01-06 19:21:53,054 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 63 states. [2021-01-06 19:21:54,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:54,714 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2021-01-06 19:21:54,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-01-06 19:21:54,715 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 118 [2021-01-06 19:21:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:54,716 INFO L225 Difference]: With dead ends: 73 [2021-01-06 19:21:54,716 INFO L226 Difference]: Without dead ends: 69 [2021-01-06 19:21:54,720 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2162 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1855, Invalid=8245, Unknown=0, NotChecked=0, Total=10100 [2021-01-06 19:21:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-01-06 19:21:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-01-06 19:21:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-01-06 19:21:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2021-01-06 19:21:54,725 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 118 [2021-01-06 19:21:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:54,725 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2021-01-06 19:21:54,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2021-01-06 19:21:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2021-01-06 19:21:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-01-06 19:21:54,727 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:54,727 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:54,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:54,942 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:54,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:54,942 INFO L82 PathProgramCache]: Analyzing trace with hash -806952938, now seen corresponding path program 19 times [2021-01-06 19:21:54,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:54,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684800327] [2021-01-06 19:21:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:54,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-01-06 19:21:55,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684800327] [2021-01-06 19:21:55,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625293382] [2021-01-06 19:21:55,925 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 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 [2021-01-06 19:21:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 42 conjunts are in the unsatisfiable core [2021-01-06 19:21:56,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-01-06 19:21:56,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:56,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2021-01-06 19:21:56,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736047931] [2021-01-06 19:21:56,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-06 19:21:56,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:56,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-06 19:21:56,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2021-01-06 19:21:56,263 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 25 states. [2021-01-06 19:21:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:56,602 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2021-01-06 19:21:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 19:21:56,602 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 124 [2021-01-06 19:21:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:56,603 INFO L225 Difference]: With dead ends: 76 [2021-01-06 19:21:56,604 INFO L226 Difference]: Without dead ends: 72 [2021-01-06 19:21:56,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=718, Invalid=1262, Unknown=0, NotChecked=0, Total=1980 [2021-01-06 19:21:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-01-06 19:21:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-01-06 19:21:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2021-01-06 19:21:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2021-01-06 19:21:56,610 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 124 [2021-01-06 19:21:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:56,611 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2021-01-06 19:21:56,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-06 19:21:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2021-01-06 19:21:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-06 19:21:56,612 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:56,613 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:56,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:56,828 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:56,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:56,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1807457588, now seen corresponding path program 20 times [2021-01-06 19:21:56,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:56,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323982965] [2021-01-06 19:21:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2021-01-06 19:21:57,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323982965] [2021-01-06 19:21:57,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735400400] [2021-01-06 19:21:57,844 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 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 [2021-01-06 19:21:57,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 19:21:57,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:57,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 44 conjunts are in the unsatisfiable core [2021-01-06 19:21:57,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2021-01-06 19:21:58,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:58,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2021-01-06 19:21:58,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160885389] [2021-01-06 19:21:58,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-06 19:21:58,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:58,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-06 19:21:58,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2021-01-06 19:21:58,133 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 26 states. [2021-01-06 19:21:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:58,477 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2021-01-06 19:21:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-06 19:21:58,477 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2021-01-06 19:21:58,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:58,479 INFO L225 Difference]: With dead ends: 79 [2021-01-06 19:21:58,479 INFO L226 Difference]: Without dead ends: 75 [2021-01-06 19:21:58,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=785, Invalid=1377, Unknown=0, NotChecked=0, Total=2162 [2021-01-06 19:21:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-01-06 19:21:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-01-06 19:21:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2021-01-06 19:21:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2021-01-06 19:21:58,485 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 130 [2021-01-06 19:21:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:58,485 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2021-01-06 19:21:58,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-06 19:21:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2021-01-06 19:21:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-01-06 19:21:58,487 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:58,487 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:58,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-06 19:21:58,701 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:58,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash 874439510, now seen corresponding path program 21 times [2021-01-06 19:21:58,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:58,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073607867] [2021-01-06 19:21:58,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:58,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:58,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:58,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:58,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:58,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:58,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2021-01-06 19:21:59,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073607867] [2021-01-06 19:21:59,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729586308] [2021-01-06 19:21:59,736 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 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 [2021-01-06 19:21:59,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2021-01-06 19:21:59,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:59,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 46 conjunts are in the unsatisfiable core [2021-01-06 19:21:59,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2021-01-06 19:22:00,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:00,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2021-01-06 19:22:00,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955158033] [2021-01-06 19:22:00,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-06 19:22:00,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:00,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-06 19:22:00,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=419, Unknown=0, NotChecked=0, Total=702 [2021-01-06 19:22:00,071 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 27 states. [2021-01-06 19:22:00,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:00,414 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2021-01-06 19:22:00,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-06 19:22:00,415 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 136 [2021-01-06 19:22:00,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:00,417 INFO L225 Difference]: With dead ends: 82 [2021-01-06 19:22:00,417 INFO L226 Difference]: Without dead ends: 78 [2021-01-06 19:22:00,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=855, Invalid=1497, Unknown=0, NotChecked=0, Total=2352 [2021-01-06 19:22:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-01-06 19:22:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-01-06 19:22:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-01-06 19:22:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2021-01-06 19:22:00,423 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 136 [2021-01-06 19:22:00,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:00,424 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2021-01-06 19:22:00,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-06 19:22:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2021-01-06 19:22:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-01-06 19:22:00,425 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:00,426 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:00,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-01-06 19:22:00,641 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:00,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash 849241484, now seen corresponding path program 22 times [2021-01-06 19:22:00,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:00,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109829476] [2021-01-06 19:22:00,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:00,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:00,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:00,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:00,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2021-01-06 19:22:01,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109829476] [2021-01-06 19:22:01,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939425480] [2021-01-06 19:22:01,894 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 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 [2021-01-06 19:22:01,993 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 19:22:01,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:22:01,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 48 conjunts are in the unsatisfiable core [2021-01-06 19:22:01,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2021-01-06 19:22:02,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:02,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2021-01-06 19:22:02,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86785969] [2021-01-06 19:22:02,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-06 19:22:02,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:02,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-06 19:22:02,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2021-01-06 19:22:02,223 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 28 states. [2021-01-06 19:22:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:02,701 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2021-01-06 19:22:02,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-06 19:22:02,702 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 142 [2021-01-06 19:22:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:02,703 INFO L225 Difference]: With dead ends: 85 [2021-01-06 19:22:02,704 INFO L226 Difference]: Without dead ends: 81 [2021-01-06 19:22:02,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=928, Invalid=1622, Unknown=0, NotChecked=0, Total=2550 [2021-01-06 19:22:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-01-06 19:22:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-01-06 19:22:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-01-06 19:22:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2021-01-06 19:22:02,711 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 142 [2021-01-06 19:22:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:02,711 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2021-01-06 19:22:02,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-06 19:22:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2021-01-06 19:22:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-06 19:22:02,713 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:02,713 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:02,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:02,929 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:02,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:02,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1665808022, now seen corresponding path program 23 times [2021-01-06 19:22:02,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:02,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18209779] [2021-01-06 19:22:02,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2021-01-06 19:22:04,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18209779] [2021-01-06 19:22:04,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394098868] [2021-01-06 19:22:04,159 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 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 [2021-01-06 19:22:04,344 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-01-06 19:22:04,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:22:04,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 50 conjunts are in the unsatisfiable core [2021-01-06 19:22:04,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2021-01-06 19:22:04,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:04,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2021-01-06 19:22:04,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083958824] [2021-01-06 19:22:04,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-01-06 19:22:04,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:04,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-01-06 19:22:04,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=480, Unknown=0, NotChecked=0, Total=812 [2021-01-06 19:22:04,637 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 29 states. [2021-01-06 19:22:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:05,043 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2021-01-06 19:22:05,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-06 19:22:05,043 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 148 [2021-01-06 19:22:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:05,045 INFO L225 Difference]: With dead ends: 88 [2021-01-06 19:22:05,045 INFO L226 Difference]: Without dead ends: 84 [2021-01-06 19:22:05,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1004, Invalid=1752, Unknown=0, NotChecked=0, Total=2756 [2021-01-06 19:22:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-01-06 19:22:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-01-06 19:22:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-06 19:22:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2021-01-06 19:22:05,056 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 148 [2021-01-06 19:22:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:05,057 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2021-01-06 19:22:05,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2021-01-06 19:22:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2021-01-06 19:22:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-01-06 19:22:05,059 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:05,059 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:05,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-01-06 19:22:05,273 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:05,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1715345484, now seen corresponding path program 24 times [2021-01-06 19:22:05,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:05,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382043370] [2021-01-06 19:22:05,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:05,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:06,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:06,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:06,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:06,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:06,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:06,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:06,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:06,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:06,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:06,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2021-01-06 19:22:06,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382043370] [2021-01-06 19:22:06,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962176748] [2021-01-06 19:22:06,535 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 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 [2021-01-06 19:22:06,677 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2021-01-06 19:22:06,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:22:06,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 52 conjunts are in the unsatisfiable core [2021-01-06 19:22:06,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2021-01-06 19:22:06,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:06,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2021-01-06 19:22:06,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030867853] [2021-01-06 19:22:06,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-06 19:22:06,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:06,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-06 19:22:06,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2021-01-06 19:22:06,934 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 30 states. [2021-01-06 19:22:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:07,362 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2021-01-06 19:22:07,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-06 19:22:07,362 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 154 [2021-01-06 19:22:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:07,364 INFO L225 Difference]: With dead ends: 91 [2021-01-06 19:22:07,364 INFO L226 Difference]: Without dead ends: 87 [2021-01-06 19:22:07,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1083, Invalid=1887, Unknown=0, NotChecked=0, Total=2970 [2021-01-06 19:22:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-01-06 19:22:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-01-06 19:22:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-06 19:22:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2021-01-06 19:22:07,370 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 154 [2021-01-06 19:22:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:07,371 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2021-01-06 19:22:07,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-06 19:22:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2021-01-06 19:22:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:22:07,373 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:07,373 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:07,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:07,588 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:07,588 INFO L82 PathProgramCache]: Analyzing trace with hash -678635050, now seen corresponding path program 25 times [2021-01-06 19:22:07,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:07,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987152075] [2021-01-06 19:22:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:22:07,630 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:22:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:22:07,729 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:22:07,782 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 19:22:07,782 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 19:22:07,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:22:07,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 07:22:07 BoogieIcfgContainer [2021-01-06 19:22:07,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 19:22:07,885 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 19:22:07,885 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 19:22:07,885 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 19:22:07,886 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:21:32" (3/4) ... [2021-01-06 19:22:07,888 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 19:22:07,974 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/recursive-simple/sum_25x0-2.c-witness.graphml [2021-01-06 19:22:07,974 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 19:22:07,980 INFO L168 Benchmark]: Toolchain (without parser) took 36530.99 ms. Allocated memory was 160.4 MB in the beginning and 602.9 MB in the end (delta: 442.5 MB). Free memory was 136.9 MB in the beginning and 403.5 MB in the end (delta: -266.6 MB). Peak memory consumption was 176.5 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:07,980 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 160.4 MB. Free memory is still 134.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:22:07,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.52 ms. Allocated memory is still 160.4 MB. Free memory was 136.7 MB in the beginning and 127.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:07,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.81 ms. Allocated memory is still 160.4 MB. Free memory was 127.3 MB in the beginning and 126.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:07,984 INFO L168 Benchmark]: Boogie Preprocessor took 19.11 ms. Allocated memory is still 160.4 MB. Free memory was 126.0 MB in the beginning and 125.1 MB in the end (delta: 858.5 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:07,985 INFO L168 Benchmark]: RCFGBuilder took 363.21 ms. Allocated memory is still 160.4 MB. Free memory was 125.1 MB in the beginning and 113.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:07,985 INFO L168 Benchmark]: TraceAbstraction took 35746.75 ms. Allocated memory was 160.4 MB in the beginning and 602.9 MB in the end (delta: 442.5 MB). Free memory was 113.4 MB in the beginning and 411.4 MB in the end (delta: -298.0 MB). Peak memory consumption was 146.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:07,986 INFO L168 Benchmark]: Witness Printer took 89.28 ms. Allocated memory is still 602.9 MB. Free memory was 411.4 MB in the beginning and 403.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:07,988 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.24 ms. Allocated memory is still 160.4 MB. Free memory is still 134.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 270.52 ms. Allocated memory is still 160.4 MB. Free memory was 136.7 MB in the beginning and 127.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 33.81 ms. Allocated memory is still 160.4 MB. Free memory was 127.3 MB in the beginning and 126.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 19.11 ms. Allocated memory is still 160.4 MB. Free memory was 126.0 MB in the beginning and 125.1 MB in the end (delta: 858.5 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 363.21 ms. Allocated memory is still 160.4 MB. Free memory was 125.1 MB in the beginning and 113.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 35746.75 ms. Allocated memory was 160.4 MB in the beginning and 602.9 MB in the end (delta: 442.5 MB). Free memory was 113.4 MB in the beginning and 411.4 MB in the end (delta: -298.0 MB). Peak memory consumption was 146.1 MB. Max. memory is 8.0 GB. * Witness Printer took 89.28 ms. Allocated memory is still 602.9 MB. Free memory was 411.4 MB in the beginning and 403.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 25; [L15] int b = 0; [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L6] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L6] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L6] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L6] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L6] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25, m=25, n=0] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.4s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 226 SDtfs, 1093 SDslu, 1301 SDs, 0 SdLazy, 1329 SolverSat, 305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3410 GetRequests, 2628 SyntacticMatches, 0 SemanticMatches, 782 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7020 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 4250 NumberOfCodeBlocks, 4250 NumberOfCodeBlocksAsserted, 222 NumberOfCheckSat, 4041 ConstructedInterpolants, 0 QuantifiedInterpolants, 1110405 SizeOfPredicates, 351 NumberOfNonLiveVariables, 6792 ConjunctsInSsa, 736 ConjunctsInUnsatCore, 49 InterpolantComputations, 1 PerfectInterpolantSequences, 15000/30000 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...