/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:47:48,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:47:48,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:47:48,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:47:48,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:47:48,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:47:48,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:47:48,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:47:48,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:47:48,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:47:48,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:47:48,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:47:48,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:47:48,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:47:48,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:47:48,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:47:48,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:47:48,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:47:48,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:47:48,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:47:48,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:47:48,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:47:48,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:47:48,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:47:48,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:47:48,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:47:48,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:47:48,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:47:48,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:47:48,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:47:48,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:47:48,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:47:48,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:47:48,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:47:48,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:47:48,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:47:48,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:47:48,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:47:48,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:47:48,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:47:48,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:47:48,435 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:47:48,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:47:48,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:47:48,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:47:48,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:47:48,450 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:47:48,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:47:48,450 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:47:48,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:47:48,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:47:48,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:47:48,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:47:48,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:47:48,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:47:48,452 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:47:48,452 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:47:48,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:47:48,452 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:47:48,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:47:48,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:47:48,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:47:48,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:47:48,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:47:48,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:47:48,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:47:48,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:47:48,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:47:48,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:47:48,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:47:48,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:47:48,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:47:48,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:47:48,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:47:48,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:47:48,801 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:47:48,802 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:47:48,803 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-1.c [2019-11-23 22:47:48,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc328c7f/1c3b8378766a4e4fb6ae3ee311b53454/FLAGc6a567689 [2019-11-23 22:47:49,395 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:47:49,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-1.c [2019-11-23 22:47:49,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc328c7f/1c3b8378766a4e4fb6ae3ee311b53454/FLAGc6a567689 [2019-11-23 22:47:49,713 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc328c7f/1c3b8378766a4e4fb6ae3ee311b53454 [2019-11-23 22:47:49,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:47:49,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:47:49,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:49,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:47:49,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:47:49,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:49" (1/1) ... [2019-11-23 22:47:49,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b03bd35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:49, skipping insertion in model container [2019-11-23 22:47:49,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:49" (1/1) ... [2019-11-23 22:47:49,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:47:49,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:47:50,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:50,076 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:47:50,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:50,295 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:47:50,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:50 WrapperNode [2019-11-23 22:47:50,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:50,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:47:50,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:47:50,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:47:50,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:50" (1/1) ... [2019-11-23 22:47:50,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:50" (1/1) ... [2019-11-23 22:47:50,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:47:50,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:47:50,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:47:50,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:47:50,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:50" (1/1) ... [2019-11-23 22:47:50,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:50" (1/1) ... [2019-11-23 22:47:50,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:50" (1/1) ... [2019-11-23 22:47:50,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:50" (1/1) ... [2019-11-23 22:47:50,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:50" (1/1) ... [2019-11-23 22:47:50,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:50" (1/1) ... [2019-11-23 22:47:50,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:50" (1/1) ... [2019-11-23 22:47:50,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:47:50,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:47:50,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:47:50,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:47:50,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:47:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:47:50,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:47:50,615 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:47:51,297 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-23 22:47:51,298 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-23 22:47:51,299 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:47:51,299 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:47:51,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:51 BoogieIcfgContainer [2019-11-23 22:47:51,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:47:51,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:47:51,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:47:51,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:47:51,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:47:49" (1/3) ... [2019-11-23 22:47:51,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4301d733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:51, skipping insertion in model container [2019-11-23 22:47:51,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:50" (2/3) ... [2019-11-23 22:47:51,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4301d733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:51, skipping insertion in model container [2019-11-23 22:47:51,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:51" (3/3) ... [2019-11-23 22:47:51,311 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-1.c [2019-11-23 22:47:51,320 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:47:51,328 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:47:51,339 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:47:51,366 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:47:51,366 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:47:51,367 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:47:51,367 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:47:51,367 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:47:51,367 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:47:51,367 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:47:51,368 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:47:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-11-23 22:47:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 22:47:51,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:51,396 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:51,397 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126500, now seen corresponding path program 1 times [2019-11-23 22:47:51,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:51,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081772364] [2019-11-23 22:47:51,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:47:51,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081772364] [2019-11-23 22:47:51,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:51,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:51,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303612184] [2019-11-23 22:47:51,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:51,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:51,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:51,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:51,687 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2019-11-23 22:47:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:52,041 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-11-23 22:47:52,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:52,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-23 22:47:52,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:52,059 INFO L225 Difference]: With dead ends: 332 [2019-11-23 22:47:52,059 INFO L226 Difference]: Without dead ends: 177 [2019-11-23 22:47:52,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-23 22:47:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2019-11-23 22:47:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-23 22:47:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2019-11-23 22:47:52,123 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2019-11-23 22:47:52,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:52,124 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2019-11-23 22:47:52,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2019-11-23 22:47:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 22:47:52,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:52,127 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:52,127 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:52,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:52,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296701, now seen corresponding path program 1 times [2019-11-23 22:47:52,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:52,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670603538] [2019-11-23 22:47:52,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:47:52,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670603538] [2019-11-23 22:47:52,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:52,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:52,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906370250] [2019-11-23 22:47:52,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:52,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:52,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:52,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:52,220 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2019-11-23 22:47:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:52,472 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2019-11-23 22:47:52,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:52,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-23 22:47:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:52,476 INFO L225 Difference]: With dead ends: 384 [2019-11-23 22:47:52,476 INFO L226 Difference]: Without dead ends: 218 [2019-11-23 22:47:52,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:52,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-23 22:47:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2019-11-23 22:47:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-23 22:47:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2019-11-23 22:47:52,494 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2019-11-23 22:47:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:52,495 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2019-11-23 22:47:52,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2019-11-23 22:47:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:47:52,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:52,504 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:52,504 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:52,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:52,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1767942993, now seen corresponding path program 1 times [2019-11-23 22:47:52,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:52,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71218577] [2019-11-23 22:47:52,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:47:52,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71218577] [2019-11-23 22:47:52,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:52,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:52,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166919645] [2019-11-23 22:47:52,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:52,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:52,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:52,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:52,631 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2019-11-23 22:47:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:52,831 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2019-11-23 22:47:52,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:52,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:47:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:52,835 INFO L225 Difference]: With dead ends: 448 [2019-11-23 22:47:52,836 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 22:47:52,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 22:47:52,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 22:47:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 22:47:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2019-11-23 22:47:52,878 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2019-11-23 22:47:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:52,879 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2019-11-23 22:47:52,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2019-11-23 22:47:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:47:52,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:52,891 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-23 22:47:52,892 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:52,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:52,892 INFO L82 PathProgramCache]: Analyzing trace with hash -409474745, now seen corresponding path program 1 times [2019-11-23 22:47:52,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:52,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919272174] [2019-11-23 22:47:52,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:47:53,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919272174] [2019-11-23 22:47:53,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:53,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:53,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240580498] [2019-11-23 22:47:53,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:53,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:53,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:53,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:53,019 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2019-11-23 22:47:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:53,202 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2019-11-23 22:47:53,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:53,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:47:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:53,206 INFO L225 Difference]: With dead ends: 525 [2019-11-23 22:47:53,206 INFO L226 Difference]: Without dead ends: 289 [2019-11-23 22:47:53,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-23 22:47:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-11-23 22:47:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-23 22:47:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2019-11-23 22:47:53,220 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2019-11-23 22:47:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:53,221 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2019-11-23 22:47:53,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2019-11-23 22:47:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:47:53,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:53,223 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:53,223 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:53,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:53,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1510819865, now seen corresponding path program 1 times [2019-11-23 22:47:53,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:53,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944360288] [2019-11-23 22:47:53,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:47:53,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944360288] [2019-11-23 22:47:53,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:53,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:53,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54713770] [2019-11-23 22:47:53,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:53,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:53,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:53,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:53,298 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2019-11-23 22:47:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:53,436 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2019-11-23 22:47:53,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:53,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:47:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:53,440 INFO L225 Difference]: With dead ends: 580 [2019-11-23 22:47:53,440 INFO L226 Difference]: Without dead ends: 302 [2019-11-23 22:47:53,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:53,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-23 22:47:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-11-23 22:47:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-23 22:47:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2019-11-23 22:47:53,452 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2019-11-23 22:47:53,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:53,453 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2019-11-23 22:47:53,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2019-11-23 22:47:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:47:53,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:53,455 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-23 22:47:53,455 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:53,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:53,455 INFO L82 PathProgramCache]: Analyzing trace with hash 556901760, now seen corresponding path program 1 times [2019-11-23 22:47:53,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:53,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669977902] [2019-11-23 22:47:53,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:47:53,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669977902] [2019-11-23 22:47:53,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:53,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:53,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180977522] [2019-11-23 22:47:53,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:53,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:53,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:53,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:53,516 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2019-11-23 22:47:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:53,682 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2019-11-23 22:47:53,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:53,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:47:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:53,685 INFO L225 Difference]: With dead ends: 597 [2019-11-23 22:47:53,685 INFO L226 Difference]: Without dead ends: 302 [2019-11-23 22:47:53,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-23 22:47:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-23 22:47:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-23 22:47:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2019-11-23 22:47:53,696 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2019-11-23 22:47:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:53,697 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2019-11-23 22:47:53,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2019-11-23 22:47:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 22:47:53,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:53,699 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:53,699 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash 134586867, now seen corresponding path program 1 times [2019-11-23 22:47:53,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:53,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024544160] [2019-11-23 22:47:53,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:47:53,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024544160] [2019-11-23 22:47:53,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:53,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:53,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376468928] [2019-11-23 22:47:53,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:53,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:53,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:53,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:53,752 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2019-11-23 22:47:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:53,888 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2019-11-23 22:47:53,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:53,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-23 22:47:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:53,891 INFO L225 Difference]: With dead ends: 591 [2019-11-23 22:47:53,891 INFO L226 Difference]: Without dead ends: 300 [2019-11-23 22:47:53,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-23 22:47:53,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-23 22:47:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-23 22:47:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-11-23 22:47:53,905 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2019-11-23 22:47:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:53,908 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-11-23 22:47:53,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-11-23 22:47:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:47:53,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:53,910 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:53,910 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:53,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:53,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1345174066, now seen corresponding path program 1 times [2019-11-23 22:47:53,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:53,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939049422] [2019-11-23 22:47:53,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-23 22:47:53,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939049422] [2019-11-23 22:47:53,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:53,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:53,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356812717] [2019-11-23 22:47:53,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:53,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:53,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:53,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:53,978 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2019-11-23 22:47:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:54,088 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2019-11-23 22:47:54,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:54,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 22:47:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:54,091 INFO L225 Difference]: With dead ends: 598 [2019-11-23 22:47:54,091 INFO L226 Difference]: Without dead ends: 307 [2019-11-23 22:47:54,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-23 22:47:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-11-23 22:47:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-23 22:47:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2019-11-23 22:47:54,104 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2019-11-23 22:47:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:54,105 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2019-11-23 22:47:54,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2019-11-23 22:47:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:47:54,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:54,107 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1] [2019-11-23 22:47:54,107 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:54,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:54,107 INFO L82 PathProgramCache]: Analyzing trace with hash 414047818, now seen corresponding path program 1 times [2019-11-23 22:47:54,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:54,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012434447] [2019-11-23 22:47:54,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:47:54,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012434447] [2019-11-23 22:47:54,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:54,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:54,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039372400] [2019-11-23 22:47:54,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:54,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:54,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:54,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:54,179 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2019-11-23 22:47:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:54,326 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2019-11-23 22:47:54,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:54,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 22:47:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:54,329 INFO L225 Difference]: With dead ends: 638 [2019-11-23 22:47:54,329 INFO L226 Difference]: Without dead ends: 338 [2019-11-23 22:47:54,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-23 22:47:54,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-23 22:47:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-23 22:47:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2019-11-23 22:47:54,340 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2019-11-23 22:47:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:54,341 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2019-11-23 22:47:54,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2019-11-23 22:47:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:47:54,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:54,343 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-11-23 22:47:54,343 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:54,343 INFO L82 PathProgramCache]: Analyzing trace with hash -728621130, now seen corresponding path program 1 times [2019-11-23 22:47:54,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:54,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803386563] [2019-11-23 22:47:54,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:47:54,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803386563] [2019-11-23 22:47:54,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:54,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:54,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667033802] [2019-11-23 22:47:54,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:54,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:54,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:54,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:54,388 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2019-11-23 22:47:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:54,539 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2019-11-23 22:47:54,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:54,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:47:54,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:54,542 INFO L225 Difference]: With dead ends: 667 [2019-11-23 22:47:54,542 INFO L226 Difference]: Without dead ends: 338 [2019-11-23 22:47:54,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-23 22:47:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-23 22:47:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-23 22:47:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-11-23 22:47:54,556 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2019-11-23 22:47:54,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:54,558 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-11-23 22:47:54,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-11-23 22:47:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:47:54,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:54,560 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:54,561 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:54,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1946943846, now seen corresponding path program 1 times [2019-11-23 22:47:54,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:54,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802517960] [2019-11-23 22:47:54,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:47:54,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802517960] [2019-11-23 22:47:54,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:54,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:54,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96935755] [2019-11-23 22:47:54,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:54,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:54,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:54,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:54,618 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2019-11-23 22:47:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:54,788 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2019-11-23 22:47:54,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:54,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-23 22:47:54,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:54,792 INFO L225 Difference]: With dead ends: 700 [2019-11-23 22:47:54,793 INFO L226 Difference]: Without dead ends: 371 [2019-11-23 22:47:54,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-23 22:47:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-23 22:47:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-23 22:47:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2019-11-23 22:47:54,808 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2019-11-23 22:47:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:54,808 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2019-11-23 22:47:54,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2019-11-23 22:47:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 22:47:54,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:54,811 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:54,812 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1829577626, now seen corresponding path program 1 times [2019-11-23 22:47:54,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:54,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439364916] [2019-11-23 22:47:54,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:47:54,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439364916] [2019-11-23 22:47:54,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:54,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:54,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233133960] [2019-11-23 22:47:54,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:54,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:54,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:54,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:54,868 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2019-11-23 22:47:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:55,015 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2019-11-23 22:47:55,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:55,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 22:47:55,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:55,018 INFO L225 Difference]: With dead ends: 727 [2019-11-23 22:47:55,018 INFO L226 Difference]: Without dead ends: 371 [2019-11-23 22:47:55,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-23 22:47:55,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-23 22:47:55,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-23 22:47:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2019-11-23 22:47:55,037 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2019-11-23 22:47:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:55,037 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2019-11-23 22:47:55,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2019-11-23 22:47:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:47:55,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:55,039 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:55,040 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:55,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:55,040 INFO L82 PathProgramCache]: Analyzing trace with hash -932592104, now seen corresponding path program 1 times [2019-11-23 22:47:55,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:55,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509750622] [2019-11-23 22:47:55,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 22:47:55,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509750622] [2019-11-23 22:47:55,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:55,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:55,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710154604] [2019-11-23 22:47:55,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:55,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:55,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:55,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:55,081 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2019-11-23 22:47:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:55,268 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2019-11-23 22:47:55,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:55,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 22:47:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:55,272 INFO L225 Difference]: With dead ends: 744 [2019-11-23 22:47:55,272 INFO L226 Difference]: Without dead ends: 388 [2019-11-23 22:47:55,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-23 22:47:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-23 22:47:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-23 22:47:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2019-11-23 22:47:55,289 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2019-11-23 22:47:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:55,289 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2019-11-23 22:47:55,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2019-11-23 22:47:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 22:47:55,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:55,291 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:55,291 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1760203780, now seen corresponding path program 1 times [2019-11-23 22:47:55,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:55,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371029832] [2019-11-23 22:47:55,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 22:47:55,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371029832] [2019-11-23 22:47:55,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:55,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:55,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207159170] [2019-11-23 22:47:55,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:55,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:55,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:55,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:55,338 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2019-11-23 22:47:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:55,474 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2019-11-23 22:47:55,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:55,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 22:47:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:55,477 INFO L225 Difference]: With dead ends: 765 [2019-11-23 22:47:55,478 INFO L226 Difference]: Without dead ends: 388 [2019-11-23 22:47:55,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-23 22:47:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-23 22:47:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-23 22:47:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2019-11-23 22:47:55,494 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2019-11-23 22:47:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:55,494 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2019-11-23 22:47:55,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2019-11-23 22:47:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 22:47:55,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:55,497 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:55,497 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:55,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:55,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2108241292, now seen corresponding path program 1 times [2019-11-23 22:47:55,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:55,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243839617] [2019-11-23 22:47:55,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 22:47:55,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243839617] [2019-11-23 22:47:55,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:55,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:55,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065738278] [2019-11-23 22:47:55,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:55,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:55,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:55,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:55,548 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2019-11-23 22:47:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:55,600 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2019-11-23 22:47:55,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:55,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-23 22:47:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:55,605 INFO L225 Difference]: With dead ends: 1092 [2019-11-23 22:47:55,605 INFO L226 Difference]: Without dead ends: 715 [2019-11-23 22:47:55,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-23 22:47:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-11-23 22:47:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-23 22:47:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2019-11-23 22:47:55,635 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2019-11-23 22:47:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:55,635 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2019-11-23 22:47:55,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2019-11-23 22:47:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 22:47:55,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:55,638 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:55,638 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:55,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:55,639 INFO L82 PathProgramCache]: Analyzing trace with hash -58853450, now seen corresponding path program 1 times [2019-11-23 22:47:55,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:55,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630557148] [2019-11-23 22:47:55,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:47:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:47:55,757 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 22:47:55,759 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 22:47:55,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:47:55 BoogieIcfgContainer [2019-11-23 22:47:55,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:47:55,843 INFO L168 Benchmark]: Toolchain (without parser) took 6119.18 ms. Allocated memory was 142.6 MB in the beginning and 297.3 MB in the end (delta: 154.7 MB). Free memory was 100.1 MB in the beginning and 121.0 MB in the end (delta: -20.9 MB). Peak memory consumption was 133.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:55,844 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 22:47:55,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 571.33 ms. Allocated memory was 142.6 MB in the beginning and 201.3 MB in the end (delta: 58.7 MB). Free memory was 99.9 MB in the beginning and 176.2 MB in the end (delta: -76.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:55,845 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.43 ms. Allocated memory is still 201.3 MB. Free memory was 176.2 MB in the beginning and 173.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:55,846 INFO L168 Benchmark]: Boogie Preprocessor took 39.49 ms. Allocated memory is still 201.3 MB. Free memory was 173.0 MB in the beginning and 170.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:55,846 INFO L168 Benchmark]: RCFGBuilder took 885.91 ms. Allocated memory is still 201.3 MB. Free memory was 170.9 MB in the beginning and 119.6 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:55,847 INFO L168 Benchmark]: TraceAbstraction took 4538.32 ms. Allocated memory was 201.3 MB in the beginning and 297.3 MB in the end (delta: 95.9 MB). Free memory was 118.9 MB in the beginning and 121.0 MB in the end (delta: -2.1 MB). Peak memory consumption was 93.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:55,851 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 571.33 ms. Allocated memory was 142.6 MB in the beginning and 201.3 MB in the end (delta: 58.7 MB). Free memory was 99.9 MB in the beginning and 176.2 MB in the end (delta: -76.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.43 ms. Allocated memory is still 201.3 MB. Free memory was 176.2 MB in the beginning and 173.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.49 ms. Allocated memory is still 201.3 MB. Free memory was 173.0 MB in the beginning and 170.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 885.91 ms. Allocated memory is still 201.3 MB. Free memory was 170.9 MB in the beginning and 119.6 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4538.32 ms. Allocated memory was 201.3 MB in the beginning and 297.3 MB in the end (delta: 95.9 MB). Free memory was 118.9 MB in the beginning and 121.0 MB in the end (delta: -2.1 MB). Peak memory consumption was 93.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 611]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L616] int s ; [L617] int tmp ; [L621] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L40] int s__session__cipher ; [L41] int buf = __VERIFIER_nondet_int() ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp = __VERIFIER_nondet_long() ; [L45] int cb ; [L46] long num1 ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 ; [L55] int tmp___4 ; [L56] int tmp___5 ; [L57] int tmp___6 ; [L58] int tmp___7 ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 ; [L61] int tmp___10 ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] Time = tmp [L76] cb = 0 [L77] ret = -1 [L78] skip = 0 [L79] got_new_session = 0 [L80] COND TRUE s__info_callback != 0 [L81] cb = s__info_callback [L87] s__in_handshake ++ [L88] COND FALSE !(tmp___1 + 12288) [L93] COND FALSE !(s__cert == 0) [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND TRUE s__state == 8464 [L268] s__shutdown = 0 [L269] ret = __VERIFIER_nondet_int() [L270] COND TRUE blastFlag == 0 [L271] blastFlag = 1 [L273] COND FALSE !(ret <= 0) [L276] got_new_session = 1 [L277] s__state = 8496 [L278] s__init_num = 0 [L583] COND FALSE !(! s__s3__tmp__reuse_message) [L600] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND TRUE s__state == 8496 [L282] ret = __VERIFIER_nondet_int() [L283] COND TRUE blastFlag == 1 [L284] blastFlag = 2 [L286] COND FALSE !(ret <= 0) [L289] COND TRUE \read(s__hit) [L290] s__state = 8656 [L294] s__init_num = 0 [L583] COND FALSE !(! s__s3__tmp__reuse_message) [L600] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND FALSE !(s__state == 8512) [L142] COND FALSE !(s__state == 8513) [L145] COND FALSE !(s__state == 8528) [L148] COND FALSE !(s__state == 8529) [L151] COND FALSE !(s__state == 8544) [L154] COND FALSE !(s__state == 8545) [L157] COND FALSE !(s__state == 8560) [L160] COND FALSE !(s__state == 8561) [L163] COND FALSE !(s__state == 8448) [L166] COND FALSE !(s__state == 8576) [L169] COND FALSE !(s__state == 8577) [L172] COND FALSE !(s__state == 8592) [L175] COND FALSE !(s__state == 8593) [L178] COND FALSE !(s__state == 8608) [L181] COND FALSE !(s__state == 8609) [L184] COND FALSE !(s__state == 8640) [L187] COND FALSE !(s__state == 8641) [L190] COND TRUE s__state == 8656 [L488] s__session__cipher = s__s3__tmp__new_cipher [L489] tmp___9 = __VERIFIER_nondet_int() [L490] COND FALSE !(! tmp___9) [L494] ret = __VERIFIER_nondet_int() [L495] COND TRUE blastFlag == 2 [L496] blastFlag = 3 [L498] COND FALSE !(ret <= 0) [L501] s__state = 8672 [L502] s__init_num = 0 [L503] tmp___10 = __VERIFIER_nondet_int() [L504] COND FALSE !(! tmp___10) [L583] COND FALSE !(! s__s3__tmp__reuse_message) [L600] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND FALSE !(s__state == 8512) [L142] COND FALSE !(s__state == 8513) [L145] COND FALSE !(s__state == 8528) [L148] COND FALSE !(s__state == 8529) [L151] COND FALSE !(s__state == 8544) [L154] COND FALSE !(s__state == 8545) [L157] COND FALSE !(s__state == 8560) [L160] COND FALSE !(s__state == 8561) [L163] COND FALSE !(s__state == 8448) [L166] COND FALSE !(s__state == 8576) [L169] COND FALSE !(s__state == 8577) [L172] COND FALSE !(s__state == 8592) [L175] COND FALSE !(s__state == 8593) [L178] COND FALSE !(s__state == 8608) [L181] COND FALSE !(s__state == 8609) [L184] COND FALSE !(s__state == 8640) [L187] COND FALSE !(s__state == 8641) [L190] COND FALSE !(s__state == 8656) [L193] COND FALSE !(s__state == 8657) [L196] COND TRUE s__state == 8672 [L511] ret = __VERIFIER_nondet_int() [L512] COND FALSE !(blastFlag == 4) [L515] COND TRUE blastFlag == 3 [L611] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.4s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2210 SDtfs, 2216 SDslu, 420 SDs, 0 SdLazy, 1340 SolverSat, 604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=715occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1456 NumberOfCodeBlocks, 1456 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1320 ConstructedInterpolants, 0 QuantifiedInterpolants, 218070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 736/736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...