/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/fibo_2calls_8-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:19:50,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:19:50,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:19:50,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:19:50,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:19:50,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:19:50,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:19:50,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:19:50,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:19:50,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:19:50,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:19:50,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:19:50,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:19:50,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:19:50,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:19:50,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:19:50,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:19:50,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:19:50,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:19:50,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:19:50,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:19:50,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:19:50,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:19:50,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:19:50,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:19:50,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:19:50,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:19:50,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:19:50,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:19:50,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:19:50,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:19:50,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:19:50,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:19:50,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:19:50,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:19:50,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:19:50,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:19:50,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:19:50,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:19:50,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:19:50,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:19:50,439 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:19:50,468 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:19:50,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:19:50,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:19:50,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:19:50,471 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:19:50,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:19:50,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:19:50,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:19:50,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:19:50,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:19:50,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:19:50,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:19:50,473 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:19:50,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:19:50,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:19:50,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:19:50,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:19:50,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:19:50,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:19:50,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:19:50,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:19:50,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:19:50,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:19:50,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:19:50,476 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:19:50,476 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:19:50,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:19:50,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:19:50,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:19:50,967 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:19:50,968 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:19:50,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-01-06 19:19:51,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/225bcf807/c7a8d9f287df4eeea4297cf31b43ce45/FLAGb369a1607 [2021-01-06 19:19:51,696 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:19:51,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-01-06 19:19:51,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/225bcf807/c7a8d9f287df4eeea4297cf31b43ce45/FLAGb369a1607 [2021-01-06 19:19:52,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/225bcf807/c7a8d9f287df4eeea4297cf31b43ce45 [2021-01-06 19:19:52,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:19:52,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:19:52,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:19:52,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:19:52,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:19:52,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:19:52" (1/1) ... [2021-01-06 19:19:52,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bcae14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:19:52, skipping insertion in model container [2021-01-06 19:19:52,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:19:52" (1/1) ... [2021-01-06 19:19:52,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:19:52,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:19:52,401 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/fibo_2calls_8-2.c[947,960] [2021-01-06 19:19:52,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:19:52,420 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:19:52,454 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/fibo_2calls_8-2.c[947,960] [2021-01-06 19:19:52,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:19:52,476 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:19:52,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:19:52 WrapperNode [2021-01-06 19:19:52,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:19:52,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:19:52,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:19:52,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:19:52,491 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:19:52" (1/1) ... [2021-01-06 19:19:52,504 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:19:52" (1/1) ... [2021-01-06 19:19:52,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:19:52,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:19:52,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:19:52,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:19:52,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:19:52" (1/1) ... [2021-01-06 19:19:52,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:19:52" (1/1) ... [2021-01-06 19:19:52,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:19:52" (1/1) ... [2021-01-06 19:19:52,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:19:52" (1/1) ... [2021-01-06 19:19:52,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:19:52" (1/1) ... [2021-01-06 19:19:52,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:19:52" (1/1) ... [2021-01-06 19:19:52,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:19:52" (1/1) ... [2021-01-06 19:19:52,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:19:52,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:19:52,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:19:52,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:19:52,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:19:52" (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:19:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:19:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-01-06 19:19:52,727 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-01-06 19:19:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:19:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-01-06 19:19:52,728 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-01-06 19:19:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:19:52,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:19:53,101 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:19:53,102 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 19:19:53,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:19:53 BoogieIcfgContainer [2021-01-06 19:19:53,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:19:53,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:19:53,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:19:53,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:19:53,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:19:52" (1/3) ... [2021-01-06 19:19:53,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4239344f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:19:53, skipping insertion in model container [2021-01-06 19:19:53,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:19:52" (2/3) ... [2021-01-06 19:19:53,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4239344f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:19:53, skipping insertion in model container [2021-01-06 19:19:53,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:19:53" (3/3) ... [2021-01-06 19:19:53,117 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2021-01-06 19:19:53,127 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:19:53,133 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:19:53,165 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:19:53,225 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:19:53,225 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:19:53,225 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:19:53,226 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:19:53,226 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:19:53,226 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:19:53,226 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:19:53,226 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:19:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2021-01-06 19:19:53,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-06 19:19:53,261 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:19:53,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:19:53,263 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:19:53,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:19:53,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2021-01-06 19:19:53,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:19:53,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352561240] [2021-01-06 19:19:53,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:19:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:53,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:19:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:53,617 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:19:53,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352561240] [2021-01-06 19:19:53,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:19:53,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:19:53,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78399264] [2021-01-06 19:19:53,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:19:53,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:19:53,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:19:53,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:19:53,643 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2021-01-06 19:19:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:19:53,694 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-01-06 19:19:53,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:19:53,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-01-06 19:19:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:19:53,706 INFO L225 Difference]: With dead ends: 43 [2021-01-06 19:19:53,707 INFO L226 Difference]: Without dead ends: 27 [2021-01-06 19:19:53,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:19:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-01-06 19:19:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-01-06 19:19:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-01-06 19:19:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-01-06 19:19:53,760 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2021-01-06 19:19:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:19:53,760 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-01-06 19:19:53,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:19:53,761 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-01-06 19:19:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 19:19:53,763 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:19:53,763 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:19:53,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:19:53,763 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:19:53,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:19:53,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2021-01-06 19:19:53,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:19:53,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370466040] [2021-01-06 19:19:53,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:19:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:53,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:19:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:53,831 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:19:53,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370466040] [2021-01-06 19:19:53,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:19:53,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:19:53,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577897676] [2021-01-06 19:19:53,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:19:53,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:19:53,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:19:53,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:19:53,837 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 5 states. [2021-01-06 19:19:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:19:53,859 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-01-06 19:19:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:19:53,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-01-06 19:19:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:19:53,861 INFO L225 Difference]: With dead ends: 33 [2021-01-06 19:19:53,861 INFO L226 Difference]: Without dead ends: 29 [2021-01-06 19:19:53,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:19:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-01-06 19:19:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-01-06 19:19:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-01-06 19:19:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-01-06 19:19:53,871 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2021-01-06 19:19:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:19:53,872 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-01-06 19:19:53,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:19:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-01-06 19:19:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 19:19:53,874 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:19:53,874 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:19:53,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:19:53,875 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:19:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:19:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2021-01-06 19:19:53,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:19:53,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858134211] [2021-01-06 19:19:53,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:19:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:53,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:19:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:53,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:53,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-01-06 19:19:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 19:19:54,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858134211] [2021-01-06 19:19:54,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651166631] [2021-01-06 19:19:54,001 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:19:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:54,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 19:19:54,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:19:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 19:19:54,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:19:54,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2021-01-06 19:19:54,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344576226] [2021-01-06 19:19:54,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:19:54,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:19:54,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:19:54,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:19:54,231 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 10 states. [2021-01-06 19:19:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:19:54,414 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2021-01-06 19:19:54,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:19:54,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2021-01-06 19:19:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:19:54,417 INFO L225 Difference]: With dead ends: 55 [2021-01-06 19:19:54,417 INFO L226 Difference]: Without dead ends: 31 [2021-01-06 19:19:54,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:19:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-01-06 19:19:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-01-06 19:19:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2021-01-06 19:19:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-01-06 19:19:54,427 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2021-01-06 19:19:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:19:54,427 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-01-06 19:19:54,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:19:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-01-06 19:19:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 19:19:54,429 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:19:54,430 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:19:54,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 19:19:54,645 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:19:54,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:19:54,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2021-01-06 19:19:54,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:19:54,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869382156] [2021-01-06 19:19:54,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:19:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:54,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:19:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:54,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:54,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:19:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 19:19:54,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869382156] [2021-01-06 19:19:54,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667128381] [2021-01-06 19:19:54,885 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 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:19:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:54,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 19:19:54,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:19:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 19:19:55,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:19:55,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-01-06 19:19:55,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763947016] [2021-01-06 19:19:55,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:19:55,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:19:55,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:19:55,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:19:55,067 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 10 states. [2021-01-06 19:19:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:19:55,263 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-01-06 19:19:55,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:19:55,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2021-01-06 19:19:55,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:19:55,274 INFO L225 Difference]: With dead ends: 51 [2021-01-06 19:19:55,274 INFO L226 Difference]: Without dead ends: 47 [2021-01-06 19:19:55,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:19:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-01-06 19:19:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-01-06 19:19:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2021-01-06 19:19:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2021-01-06 19:19:55,307 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2021-01-06 19:19:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:19:55,308 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2021-01-06 19:19:55,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:19:55,308 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2021-01-06 19:19:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:19:55,317 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:19:55,317 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:19:55,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:19:55,533 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:19:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:19:55,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2021-01-06 19:19:55,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:19:55,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688408636] [2021-01-06 19:19:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:19:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:55,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:19:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:55,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:55,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:55,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-01-06 19:19:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:55,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-01-06 19:19:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:19:55,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688408636] [2021-01-06 19:19:55,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974447828] [2021-01-06 19:19:55,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:19:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:55,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 19:19:55,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:19:55,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:19:55,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:19:55,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2021-01-06 19:19:55,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784874191] [2021-01-06 19:19:55,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:19:55,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:19:55,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:19:55,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:19:55,832 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand 11 states. [2021-01-06 19:19:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:19:56,147 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2021-01-06 19:19:56,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 19:19:56,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2021-01-06 19:19:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:19:56,150 INFO L225 Difference]: With dead ends: 105 [2021-01-06 19:19:56,150 INFO L226 Difference]: Without dead ends: 63 [2021-01-06 19:19:56,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:19:56,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-01-06 19:19:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-01-06 19:19:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-01-06 19:19:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2021-01-06 19:19:56,165 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2021-01-06 19:19:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:19:56,165 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2021-01-06 19:19:56,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:19:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2021-01-06 19:19:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:19:56,167 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:19:56,167 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:19:56,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:19:56,384 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:19:56,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:19:56,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2021-01-06 19:19:56,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:19:56,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183088276] [2021-01-06 19:19:56,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:19:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:56,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:19:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:56,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:56,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:56,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:19:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:56,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:19:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 19:19:56,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183088276] [2021-01-06 19:19:56,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538390900] [2021-01-06 19:19:56,568 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 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:19:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:56,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 19:19:56,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:19:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:19:56,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:19:56,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-01-06 19:19:56,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797683477] [2021-01-06 19:19:56,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 19:19:56,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:19:56,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 19:19:56,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:19:56,803 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand 14 states. [2021-01-06 19:19:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:19:57,278 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2021-01-06 19:19:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 19:19:57,280 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2021-01-06 19:19:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:19:57,283 INFO L225 Difference]: With dead ends: 177 [2021-01-06 19:19:57,283 INFO L226 Difference]: Without dead ends: 117 [2021-01-06 19:19:57,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2021-01-06 19:19:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-01-06 19:19:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2021-01-06 19:19:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2021-01-06 19:19:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2021-01-06 19:19:57,308 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2021-01-06 19:19:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:19:57,309 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2021-01-06 19:19:57,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 19:19:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2021-01-06 19:19:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 19:19:57,312 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:19:57,312 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:19:57,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:19:57,527 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:19:57,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:19:57,528 INFO L82 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2021-01-06 19:19:57,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:19:57,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804164433] [2021-01-06 19:19:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:19:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:57,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:19:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:57,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:57,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:57,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:57,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:19:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:57,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:19:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:57,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-01-06 19:19:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-06 19:19:57,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804164433] [2021-01-06 19:19:57,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439962250] [2021-01-06 19:19:57,786 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 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:19:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:57,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-06 19:19:57,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:19:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 19:19:57,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:19:57,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-01-06 19:19:57,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495875030] [2021-01-06 19:19:57,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 19:19:57,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:19:57,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 19:19:57,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:19:57,997 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand 15 states. [2021-01-06 19:19:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:19:58,541 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2021-01-06 19:19:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 19:19:58,542 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2021-01-06 19:19:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:19:58,545 INFO L225 Difference]: With dead ends: 255 [2021-01-06 19:19:58,545 INFO L226 Difference]: Without dead ends: 155 [2021-01-06 19:19:58,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-01-06 19:19:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-01-06 19:19:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-01-06 19:19:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-01-06 19:19:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2021-01-06 19:19:58,577 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2021-01-06 19:19:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:19:58,578 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2021-01-06 19:19:58,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 19:19:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2021-01-06 19:19:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 19:19:58,583 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:19:58,583 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:19:58,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-06 19:19:58,797 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:19:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:19:58,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1770426885, now seen corresponding path program 1 times [2021-01-06 19:19:58,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:19:58,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359991161] [2021-01-06 19:19:58,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:19:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:58,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:19:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:58,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:58,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:58,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:58,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:58,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:19:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:58,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:19:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:58,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:19:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:59,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-01-06 19:19:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:59,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:59,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:59,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:19:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:59,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:19:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:59,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:19:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:59,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:19:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 79 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-01-06 19:19:59,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359991161] [2021-01-06 19:19:59,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565095819] [2021-01-06 19:19:59,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:19:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:19:59,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-06 19:19:59,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:19:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-01-06 19:19:59,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:19:59,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-01-06 19:19:59,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20114198] [2021-01-06 19:19:59,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 19:19:59,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:19:59,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 19:19:59,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:19:59,460 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand 18 states. [2021-01-06 19:20:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:20:00,125 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2021-01-06 19:20:00,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-06 19:20:00,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 107 [2021-01-06 19:20:00,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:20:00,128 INFO L225 Difference]: With dead ends: 240 [2021-01-06 19:20:00,128 INFO L226 Difference]: Without dead ends: 107 [2021-01-06 19:20:00,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2021-01-06 19:20:00,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-06 19:20:00,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2021-01-06 19:20:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-06 19:20:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2021-01-06 19:20:00,146 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 107 [2021-01-06 19:20:00,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:20:00,147 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2021-01-06 19:20:00,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 19:20:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2021-01-06 19:20:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-06 19:20:00,149 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:20:00,150 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 10, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:20:00,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:20:00,364 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:20:00,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:20:00,365 INFO L82 PathProgramCache]: Analyzing trace with hash -895479255, now seen corresponding path program 1 times [2021-01-06 19:20:00,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:20:00,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623555163] [2021-01-06 19:20:00,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:20:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:20:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-01-06 19:20:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-01-06 19:20:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-01-06 19:20:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 67 proven. 169 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2021-01-06 19:20:00,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623555163] [2021-01-06 19:20:00,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818708553] [2021-01-06 19:20:00,753 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 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:20:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:00,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:20:00,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:20:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 30 proven. 250 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2021-01-06 19:20:01,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:20:01,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-01-06 19:20:01,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516123990] [2021-01-06 19:20:01,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 19:20:01,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:20:01,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 19:20:01,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:20:01,156 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand 19 states. [2021-01-06 19:20:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:20:01,833 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2021-01-06 19:20:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-06 19:20:01,834 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 161 [2021-01-06 19:20:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:20:01,836 INFO L225 Difference]: With dead ends: 214 [2021-01-06 19:20:01,837 INFO L226 Difference]: Without dead ends: 134 [2021-01-06 19:20:01,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2021-01-06 19:20:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-01-06 19:20:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2021-01-06 19:20:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2021-01-06 19:20:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2021-01-06 19:20:01,882 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 161 [2021-01-06 19:20:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:20:01,883 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2021-01-06 19:20:01,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 19:20:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2021-01-06 19:20:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-01-06 19:20:01,893 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:20:01,894 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 14, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:20:02,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:20:02,095 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:20:02,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:20:02,096 INFO L82 PathProgramCache]: Analyzing trace with hash -19152416, now seen corresponding path program 1 times [2021-01-06 19:20:02,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:20:02,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70197542] [2021-01-06 19:20:02,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:20:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:20:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:20:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-01-06 19:20:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-01-06 19:20:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 167 proven. 262 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2021-01-06 19:20:02,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70197542] [2021-01-06 19:20:02,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998054713] [2021-01-06 19:20:02,950 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 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:20:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:03,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-06 19:20:03,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:20:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 77 proven. 422 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2021-01-06 19:20:03,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:20:03,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2021-01-06 19:20:03,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207576683] [2021-01-06 19:20:03,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 19:20:03,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:20:03,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 19:20:03,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-01-06 19:20:03,442 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand 20 states. [2021-01-06 19:20:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:20:04,316 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2021-01-06 19:20:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-06 19:20:04,317 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 229 [2021-01-06 19:20:04,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:20:04,321 INFO L225 Difference]: With dead ends: 260 [2021-01-06 19:20:04,321 INFO L226 Difference]: Without dead ends: 155 [2021-01-06 19:20:04,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2021-01-06 19:20:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-01-06 19:20:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2021-01-06 19:20:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2021-01-06 19:20:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2021-01-06 19:20:04,341 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 229 [2021-01-06 19:20:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:20:04,341 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2021-01-06 19:20:04,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-06 19:20:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2021-01-06 19:20:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2021-01-06 19:20:04,348 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:20:04,348 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 23, 23, 21, 20, 13, 13, 13, 13, 13, 13, 13, 11, 11, 11, 11, 11, 11, 11, 10, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:20:04,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 19:20:04,561 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:20:04,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:20:04,562 INFO L82 PathProgramCache]: Analyzing trace with hash 805981402, now seen corresponding path program 2 times [2021-01-06 19:20:04,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:20:04,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642338171] [2021-01-06 19:20:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:20:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:04,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:20:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:04,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:04,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:04,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:04,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:04,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:20:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-01-06 19:20:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-01-06 19:20:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-01-06 19:20:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:20:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-01-06 19:20:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3244 backedges. 226 proven. 522 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2021-01-06 19:20:05,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642338171] [2021-01-06 19:20:05,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486438718] [2021-01-06 19:20:05,560 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 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:20:05,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 19:20:05,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:20:05,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:20:05,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:20:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3244 backedges. 174 proven. 534 refuted. 0 times theorem prover too weak. 2536 trivial. 0 not checked. [2021-01-06 19:20:06,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:20:06,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2021-01-06 19:20:06,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853004247] [2021-01-06 19:20:06,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 19:20:06,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:20:06,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 19:20:06,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:20:06,228 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand 19 states. [2021-01-06 19:20:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:20:06,987 INFO L93 Difference]: Finished difference Result 323 states and 534 transitions. [2021-01-06 19:20:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-06 19:20:06,988 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 339 [2021-01-06 19:20:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:20:06,992 INFO L225 Difference]: With dead ends: 323 [2021-01-06 19:20:06,993 INFO L226 Difference]: Without dead ends: 188 [2021-01-06 19:20:06,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-01-06 19:20:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-06 19:20:07,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 145. [2021-01-06 19:20:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2021-01-06 19:20:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2021-01-06 19:20:07,014 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 339 [2021-01-06 19:20:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:20:07,014 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2021-01-06 19:20:07,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 19:20:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2021-01-06 19:20:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2021-01-06 19:20:07,025 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:20:07,025 INFO L422 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 7, 5, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:20:07,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:20:07,240 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:20:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:20:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1313339515, now seen corresponding path program 3 times [2021-01-06 19:20:07,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:20:07,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869726664] [2021-01-06 19:20:07,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:20:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:20:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:20:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:07,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-01-06 19:20:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:20:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2021-01-06 19:20:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-01-06 19:20:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:20:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-01-06 19:20:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5377 backedges. 548 proven. 844 refuted. 0 times theorem prover too weak. 3985 trivial. 0 not checked. [2021-01-06 19:20:08,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869726664] [2021-01-06 19:20:08,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627629132] [2021-01-06 19:20:08,694 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 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:20:08,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-01-06 19:20:08,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:20:08,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-06 19:20:08,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:20:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5377 backedges. 1100 proven. 84 refuted. 0 times theorem prover too weak. 4193 trivial. 0 not checked. [2021-01-06 19:20:09,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:20:09,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 33 [2021-01-06 19:20:09,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502724158] [2021-01-06 19:20:09,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-06 19:20:09,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:20:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-06 19:20:09,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2021-01-06 19:20:09,543 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand 33 states. [2021-01-06 19:20:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:20:10,844 INFO L93 Difference]: Finished difference Result 339 states and 575 transitions. [2021-01-06 19:20:10,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-01-06 19:20:10,845 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 433 [2021-01-06 19:20:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:20:10,849 INFO L225 Difference]: With dead ends: 339 [2021-01-06 19:20:10,849 INFO L226 Difference]: Without dead ends: 201 [2021-01-06 19:20:10,852 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 548 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=2043, Unknown=0, NotChecked=0, Total=2352 [2021-01-06 19:20:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-01-06 19:20:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 187. [2021-01-06 19:20:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-01-06 19:20:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 266 transitions. [2021-01-06 19:20:10,867 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 266 transitions. Word has length 433 [2021-01-06 19:20:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:20:10,868 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 266 transitions. [2021-01-06 19:20:10,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-06 19:20:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 266 transitions. [2021-01-06 19:20:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-01-06 19:20:10,872 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:20:10,873 INFO L422 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 31, 31, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 12, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:20:11,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:20:11,085 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:20:11,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:20:11,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1128768692, now seen corresponding path program 4 times [2021-01-06 19:20:11,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:20:11,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172944308] [2021-01-06 19:20:11,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:20:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:20:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:20:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-01-06 19:20:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:11,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-01-06 19:20:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:20:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-01-06 19:20:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-01-06 19:20:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:20:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-01-06 19:20:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:12,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 545 proven. 1546 refuted. 0 times theorem prover too weak. 5983 trivial. 0 not checked. [2021-01-06 19:20:13,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172944308] [2021-01-06 19:20:13,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95466028] [2021-01-06 19:20:13,156 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 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:20:13,335 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 19:20:13,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:20:13,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 18 conjunts are in the unsatisfiable core [2021-01-06 19:20:13,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:20:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 664 proven. 866 refuted. 0 times theorem prover too weak. 6544 trivial. 0 not checked. [2021-01-06 19:20:14,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:20:14,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13] total 32 [2021-01-06 19:20:14,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610724034] [2021-01-06 19:20:14,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-01-06 19:20:14,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:20:14,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-01-06 19:20:14,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2021-01-06 19:20:14,061 INFO L87 Difference]: Start difference. First operand 187 states and 266 transitions. Second operand 32 states. [2021-01-06 19:20:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:20:15,890 INFO L93 Difference]: Finished difference Result 447 states and 759 transitions. [2021-01-06 19:20:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-01-06 19:20:15,891 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 528 [2021-01-06 19:20:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:20:15,902 INFO L225 Difference]: With dead ends: 447 [2021-01-06 19:20:15,902 INFO L226 Difference]: Without dead ends: 237 [2021-01-06 19:20:15,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 676 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=467, Invalid=3073, Unknown=0, NotChecked=0, Total=3540 [2021-01-06 19:20:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-01-06 19:20:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 195. [2021-01-06 19:20:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2021-01-06 19:20:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 268 transitions. [2021-01-06 19:20:15,944 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 268 transitions. Word has length 528 [2021-01-06 19:20:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:20:15,947 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 268 transitions. [2021-01-06 19:20:15,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2021-01-06 19:20:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 268 transitions. [2021-01-06 19:20:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2021-01-06 19:20:15,952 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:20:15,952 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 23, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:20:16,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-06 19:20:16,166 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:20:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:20:16,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1959194284, now seen corresponding path program 5 times [2021-01-06 19:20:16,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:20:16,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869320242] [2021-01-06 19:20:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:20:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:20:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:20:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-01-06 19:20:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-01-06 19:20:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:20:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:16,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-01-06 19:20:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:20:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:20:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:20:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:20:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:20:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:20:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 726 proven. 662 refuted. 0 times theorem prover too weak. 2982 trivial. 0 not checked. [2021-01-06 19:20:17,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869320242] [2021-01-06 19:20:17,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105076164] [2021-01-06 19:20:17,547 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 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:20:17,719 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2021-01-06 19:20:17,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:20:17,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-06 19:20:17,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:20:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 911 proven. 475 refuted. 0 times theorem prover too weak. 2984 trivial. 0 not checked. [2021-01-06 19:20:18,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:20:18,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17] total 34 [2021-01-06 19:20:18,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606181504] [2021-01-06 19:20:18,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-01-06 19:20:18,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:20:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-01-06 19:20:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 19:20:18,361 INFO L87 Difference]: Start difference. First operand 195 states and 268 transitions. Second operand 34 states. [2021-01-06 19:20:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:20:19,852 INFO L93 Difference]: Finished difference Result 428 states and 622 transitions. [2021-01-06 19:20:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-01-06 19:20:19,858 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 392 [2021-01-06 19:20:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:20:19,865 INFO L225 Difference]: With dead ends: 428 [2021-01-06 19:20:19,867 INFO L226 Difference]: Without dead ends: 238 [2021-01-06 19:20:19,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=389, Invalid=2691, Unknown=0, NotChecked=0, Total=3080 [2021-01-06 19:20:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-01-06 19:20:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 216. [2021-01-06 19:20:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-01-06 19:20:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 291 transitions. [2021-01-06 19:20:19,892 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 291 transitions. Word has length 392 [2021-01-06 19:20:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:20:19,893 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 291 transitions. [2021-01-06 19:20:19,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-01-06 19:20:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 291 transitions. [2021-01-06 19:20:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-01-06 19:20:19,898 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:20:19,898 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:20:20,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 19:20:20,113 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:20:20,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:20:20,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 6 times [2021-01-06 19:20:20,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:20:20,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178228209] [2021-01-06 19:20:20,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:20:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:20:20,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:20:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:20:20,279 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:20:20,423 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 19:20:20,423 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 19:20:20,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:20:20,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 07:20:20 BoogieIcfgContainer [2021-01-06 19:20:20,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 19:20:20,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 19:20:20,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 19:20:20,605 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 19:20:20,605 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:19:53" (3/4) ... [2021-01-06 19:20:20,607 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 19:20:20,782 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8-2.c-witness.graphml [2021-01-06 19:20:20,782 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 19:20:20,784 INFO L168 Benchmark]: Toolchain (without parser) took 28694.90 ms. Allocated memory was 156.2 MB in the beginning and 702.5 MB in the end (delta: 546.3 MB). Free memory was 130.9 MB in the beginning and 458.7 MB in the end (delta: -327.8 MB). Peak memory consumption was 219.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:20:20,784 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 156.2 MB. Free memory is still 128.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:20:20,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.18 ms. Allocated memory is still 156.2 MB. Free memory was 130.7 MB in the beginning and 121.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-06 19:20:20,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.72 ms. Allocated memory is still 156.2 MB. Free memory was 121.2 MB in the beginning and 119.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 19:20:20,785 INFO L168 Benchmark]: Boogie Preprocessor took 56.75 ms. Allocated memory is still 156.2 MB. Free memory was 119.8 MB in the beginning and 118.9 MB in the end (delta: 918.5 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 19:20:20,786 INFO L168 Benchmark]: RCFGBuilder took 516.86 ms. Allocated memory is still 156.2 MB. Free memory was 118.8 MB in the beginning and 105.8 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-01-06 19:20:20,786 INFO L168 Benchmark]: TraceAbstraction took 27496.94 ms. Allocated memory was 156.2 MB in the beginning and 702.5 MB in the end (delta: 546.3 MB). Free memory was 105.3 MB in the beginning and 479.3 MB in the end (delta: -373.9 MB). Peak memory consumption was 173.0 MB. Max. memory is 8.0 GB. [2021-01-06 19:20:20,787 INFO L168 Benchmark]: Witness Printer took 177.86 ms. Allocated memory is still 702.5 MB. Free memory was 479.3 MB in the beginning and 458.7 MB in the end (delta: 20.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2021-01-06 19:20:20,789 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.21 ms. Allocated memory is still 156.2 MB. Free memory is still 128.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 382.18 ms. Allocated memory is still 156.2 MB. Free memory was 130.7 MB in the beginning and 121.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 47.72 ms. Allocated memory is still 156.2 MB. Free memory was 121.2 MB in the beginning and 119.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 56.75 ms. Allocated memory is still 156.2 MB. Free memory was 119.8 MB in the beginning and 118.9 MB in the end (delta: 918.5 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 516.86 ms. Allocated memory is still 156.2 MB. Free memory was 118.8 MB in the beginning and 105.8 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 27496.94 ms. Allocated memory was 156.2 MB in the beginning and 702.5 MB in the end (delta: 546.3 MB). Free memory was 105.3 MB in the beginning and 479.3 MB in the end (delta: -373.9 MB). Peak memory consumption was 173.0 MB. Max. memory is 8.0 GB. * Witness Printer took 177.86 ms. Allocated memory is still 702.5 MB. Free memory was 479.3 MB in the beginning and 458.7 MB in the end (delta: 20.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 21 [L41] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.2s, OverallIterations: 15, TraceHistogramMax: 39, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 460 SDtfs, 1092 SDslu, 3594 SDs, 0 SdLazy, 6864 SolverSat, 1399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3377 GetRequests, 3006 SyntacticMatches, 2 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3533 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 240 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 5201 NumberOfCodeBlocks, 4805 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 4715 ConstructedInterpolants, 0 QuantifiedInterpolants, 2263009 SizeOfPredicates, 75 NumberOfNonLiveVariables, 4602 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 40182/47080 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...