./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 28d8096126b63ab25306739ff4b0685d3f7b94a5 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:22:52,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:22:52,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:22:52,569 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:22:52,569 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:22:52,570 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:22:52,572 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:22:52,574 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:22:52,575 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:22:52,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:22:52,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:22:52,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:22:52,578 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:22:52,579 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:22:52,581 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:22:52,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:22:52,584 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:22:52,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:22:52,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:22:52,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:22:52,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:22:52,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:22:52,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:22:52,596 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:22:52,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:22:52,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:22:52,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:22:52,599 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:22:52,600 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:22:52,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:22:52,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:22:52,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:22:52,603 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:22:52,603 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:22:52,604 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:22:52,605 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:22:52,606 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:22:52,629 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:22:52,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:22:52,632 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:22:52,632 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:22:52,632 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:22:52,632 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:22:52,633 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:22:52,634 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:22:52,634 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:22:52,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:22:52,635 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:22:52,635 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:22:52,635 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:22:52,635 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:22:52,635 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:22:52,636 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:22:52,637 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:22:52,637 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:22:52,638 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:22:52,638 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:22:52,638 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:22:52,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:22:52,639 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:22:52,639 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:22:52,639 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:22:52,639 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:22:52,639 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:22:52,639 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:22:52,640 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 28d8096126b63ab25306739ff4b0685d3f7b94a5 [2019-01-11 21:22:52,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:22:52,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:22:52,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:22:52,711 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:22:52,712 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:22:52,712 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1_false-unreach-call_false-termination.cil.c [2019-01-11 21:22:52,776 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e888e7a8a/d4ad1d447acd4643b3aebea35b91d4f2/FLAGe0ba430e8 [2019-01-11 21:22:53,204 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:22:53,205 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1_false-unreach-call_false-termination.cil.c [2019-01-11 21:22:53,217 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e888e7a8a/d4ad1d447acd4643b3aebea35b91d4f2/FLAGe0ba430e8 [2019-01-11 21:22:53,565 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e888e7a8a/d4ad1d447acd4643b3aebea35b91d4f2 [2019-01-11 21:22:53,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:22:53,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:22:53,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:22:53,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:22:53,577 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:22:53,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:22:53" (1/1) ... [2019-01-11 21:22:53,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd56725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:53, skipping insertion in model container [2019-01-11 21:22:53,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:22:53" (1/1) ... [2019-01-11 21:22:53,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:22:53,638 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:22:53,961 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:22:53,969 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:22:54,086 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:22:54,111 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:22:54,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54 WrapperNode [2019-01-11 21:22:54,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:22:54,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:22:54,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:22:54,114 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:22:54,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (1/1) ... [2019-01-11 21:22:54,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (1/1) ... [2019-01-11 21:22:54,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:22:54,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:22:54,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:22:54,304 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:22:54,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (1/1) ... [2019-01-11 21:22:54,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (1/1) ... [2019-01-11 21:22:54,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (1/1) ... [2019-01-11 21:22:54,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (1/1) ... [2019-01-11 21:22:54,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (1/1) ... [2019-01-11 21:22:54,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (1/1) ... [2019-01-11 21:22:54,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (1/1) ... [2019-01-11 21:22:54,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:22:54,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:22:54,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:22:54,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:22:54,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (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-01-11 21:22:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:22:54,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:22:54,630 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:22:55,747 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:22:55,748 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:22:55,749 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:22:55,750 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:22:55,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:22:55 BoogieIcfgContainer [2019-01-11 21:22:55,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:22:55,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:22:55,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:22:55,755 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:22:55,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:22:53" (1/3) ... [2019-01-11 21:22:55,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcf42d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:22:55, skipping insertion in model container [2019-01-11 21:22:55,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (2/3) ... [2019-01-11 21:22:55,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcf42d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:22:55, skipping insertion in model container [2019-01-11 21:22:55,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:22:55" (3/3) ... [2019-01-11 21:22:55,759 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1_false-unreach-call_false-termination.cil.c [2019-01-11 21:22:55,769 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:22:55,778 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:22:55,795 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:22:55,828 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:22:55,829 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:22:55,830 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:22:55,830 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:22:55,830 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:22:55,830 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:22:55,830 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:22:55,831 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:22:55,831 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:22:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-01-11 21:22:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 21:22:55,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:55,875 INFO L402 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-01-11 21:22:55,878 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:55,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:55,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126500, now seen corresponding path program 1 times [2019-01-11 21:22:55,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:55,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:55,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:55,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:55,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:56,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:56,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:56,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:56,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:56,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:56,158 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2019-01-11 21:22:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:57,108 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-01-11 21:22:57,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:57,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-11 21:22:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:57,125 INFO L225 Difference]: With dead ends: 332 [2019-01-11 21:22:57,126 INFO L226 Difference]: Without dead ends: 177 [2019-01-11 21:22:57,130 INFO L631 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-01-11 21:22:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-11 21:22:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2019-01-11 21:22:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-11 21:22:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2019-01-11 21:22:57,192 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2019-01-11 21:22:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:57,193 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2019-01-11 21:22:57,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2019-01-11 21:22:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-11 21:22:57,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:57,196 INFO L402 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-01-11 21:22:57,196 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:57,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:57,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296701, now seen corresponding path program 1 times [2019-01-11 21:22:57,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:57,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:57,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:57,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:57,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:57,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:57,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:57,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:57,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:57,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:57,333 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2019-01-11 21:22:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:57,753 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2019-01-11 21:22:57,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:57,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-01-11 21:22:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:57,757 INFO L225 Difference]: With dead ends: 384 [2019-01-11 21:22:57,757 INFO L226 Difference]: Without dead ends: 218 [2019-01-11 21:22:57,759 INFO L631 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-01-11 21:22:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-01-11 21:22:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2019-01-11 21:22:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-11 21:22:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2019-01-11 21:22:57,785 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2019-01-11 21:22:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:57,786 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2019-01-11 21:22:57,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:57,786 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2019-01-11 21:22:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-11 21:22:57,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:57,790 INFO L402 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-01-11 21:22:57,790 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:57,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:57,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1767942993, now seen corresponding path program 1 times [2019-01-11 21:22:57,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:57,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:57,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:57,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:57,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:57,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:57,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:57,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:57,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:57,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:57,866 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2019-01-11 21:22:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:58,221 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2019-01-11 21:22:58,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:58,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-11 21:22:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:58,225 INFO L225 Difference]: With dead ends: 448 [2019-01-11 21:22:58,226 INFO L226 Difference]: Without dead ends: 243 [2019-01-11 21:22:58,227 INFO L631 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-01-11 21:22:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-11 21:22:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-01-11 21:22:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-11 21:22:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2019-01-11 21:22:58,245 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2019-01-11 21:22:58,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:58,245 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2019-01-11 21:22:58,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2019-01-11 21:22:58,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:22:58,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:58,250 INFO L402 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-01-11 21:22:58,250 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:58,250 INFO L82 PathProgramCache]: Analyzing trace with hash -409474745, now seen corresponding path program 1 times [2019-01-11 21:22:58,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:58,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:58,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:58,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:58,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:58,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:58,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:58,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:58,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:58,371 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2019-01-11 21:22:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:58,832 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2019-01-11 21:22:58,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:58,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:22:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:58,836 INFO L225 Difference]: With dead ends: 525 [2019-01-11 21:22:58,836 INFO L226 Difference]: Without dead ends: 289 [2019-01-11 21:22:58,837 INFO L631 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-01-11 21:22:58,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-11 21:22:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-01-11 21:22:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-11 21:22:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2019-01-11 21:22:58,859 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2019-01-11 21:22:58,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:58,860 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2019-01-11 21:22:58,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2019-01-11 21:22:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-11 21:22:58,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:58,869 INFO L402 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-01-11 21:22:58,870 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:58,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:58,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1510819865, now seen corresponding path program 1 times [2019-01-11 21:22:58,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:58,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:58,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:58,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:58,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:22:58,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:58,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:58,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:58,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:58,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:58,926 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2019-01-11 21:22:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:59,164 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2019-01-11 21:22:59,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:59,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-01-11 21:22:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:59,167 INFO L225 Difference]: With dead ends: 580 [2019-01-11 21:22:59,167 INFO L226 Difference]: Without dead ends: 302 [2019-01-11 21:22:59,168 INFO L631 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-01-11 21:22:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-11 21:22:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-01-11 21:22:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-11 21:22:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2019-01-11 21:22:59,184 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2019-01-11 21:22:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:59,184 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2019-01-11 21:22:59,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2019-01-11 21:22:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-11 21:22:59,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:59,186 INFO L402 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-01-11 21:22:59,187 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash 556901760, now seen corresponding path program 1 times [2019-01-11 21:22:59,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:59,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:59,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:59,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:59,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:59,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:59,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:59,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:59,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:59,301 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2019-01-11 21:22:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:59,822 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2019-01-11 21:22:59,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:59,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-01-11 21:22:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:59,825 INFO L225 Difference]: With dead ends: 597 [2019-01-11 21:22:59,825 INFO L226 Difference]: Without dead ends: 302 [2019-01-11 21:22:59,826 INFO L631 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-01-11 21:22:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-11 21:22:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-01-11 21:22:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-11 21:22:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2019-01-11 21:22:59,838 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2019-01-11 21:22:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:59,838 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2019-01-11 21:22:59,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2019-01-11 21:22:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 21:22:59,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:59,840 INFO L402 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-01-11 21:22:59,840 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:59,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash 134586867, now seen corresponding path program 1 times [2019-01-11 21:22:59,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:59,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:59,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:59,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:59,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:22:59,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:59,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:59,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:59,934 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2019-01-11 21:23:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:00,465 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2019-01-11 21:23:00,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:00,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-01-11 21:23:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:00,468 INFO L225 Difference]: With dead ends: 591 [2019-01-11 21:23:00,468 INFO L226 Difference]: Without dead ends: 300 [2019-01-11 21:23:00,469 INFO L631 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-01-11 21:23:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-11 21:23:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-01-11 21:23:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-11 21:23:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-01-11 21:23:00,479 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2019-01-11 21:23:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:00,479 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-01-11 21:23:00,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-01-11 21:23:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 21:23:00,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:00,481 INFO L402 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-01-11 21:23:00,482 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:00,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:00,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1345174066, now seen corresponding path program 1 times [2019-01-11 21:23:00,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:00,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:00,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:00,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:00,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-01-11 21:23:00,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:00,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:00,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:00,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:00,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:00,579 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2019-01-11 21:23:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:01,191 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2019-01-11 21:23:01,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:01,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-11 21:23:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:01,194 INFO L225 Difference]: With dead ends: 598 [2019-01-11 21:23:01,194 INFO L226 Difference]: Without dead ends: 307 [2019-01-11 21:23:01,195 INFO L631 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-01-11 21:23:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-01-11 21:23:01,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-01-11 21:23:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-01-11 21:23:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2019-01-11 21:23:01,216 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2019-01-11 21:23:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:01,216 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2019-01-11 21:23:01,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2019-01-11 21:23:01,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 21:23:01,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:01,219 INFO L402 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-01-11 21:23:01,219 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:01,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:01,220 INFO L82 PathProgramCache]: Analyzing trace with hash 414047818, now seen corresponding path program 1 times [2019-01-11 21:23:01,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:01,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:01,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:01,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:01,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:01,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:01,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:01,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:01,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:01,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:01,348 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2019-01-11 21:23:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:02,623 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2019-01-11 21:23:02,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:02,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-11 21:23:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:02,628 INFO L225 Difference]: With dead ends: 638 [2019-01-11 21:23:02,628 INFO L226 Difference]: Without dead ends: 338 [2019-01-11 21:23:02,629 INFO L631 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-01-11 21:23:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-11 21:23:02,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-01-11 21:23:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-11 21:23:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2019-01-11 21:23:02,641 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2019-01-11 21:23:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:02,641 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2019-01-11 21:23:02,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2019-01-11 21:23:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 21:23:02,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:02,643 INFO L402 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-01-11 21:23:02,643 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:02,643 INFO L82 PathProgramCache]: Analyzing trace with hash -728621130, now seen corresponding path program 1 times [2019-01-11 21:23:02,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:02,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:02,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:02,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:02,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:02,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:02,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:02,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:02,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:02,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:02,729 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2019-01-11 21:23:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:03,040 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2019-01-11 21:23:03,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:03,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-11 21:23:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:03,044 INFO L225 Difference]: With dead ends: 667 [2019-01-11 21:23:03,044 INFO L226 Difference]: Without dead ends: 338 [2019-01-11 21:23:03,045 INFO L631 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-01-11 21:23:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-11 21:23:03,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-01-11 21:23:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-11 21:23:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-01-11 21:23:03,056 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2019-01-11 21:23:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:03,056 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-01-11 21:23:03,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-01-11 21:23:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-11 21:23:03,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:03,058 INFO L402 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-01-11 21:23:03,058 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:03,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1946943846, now seen corresponding path program 1 times [2019-01-11 21:23:03,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:03,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:03,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:03,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:03,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:03,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:03,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:03,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:03,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:03,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:03,122 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2019-01-11 21:23:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:03,920 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2019-01-11 21:23:03,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:03,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-11 21:23:03,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:03,925 INFO L225 Difference]: With dead ends: 700 [2019-01-11 21:23:03,926 INFO L226 Difference]: Without dead ends: 371 [2019-01-11 21:23:03,927 INFO L631 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-01-11 21:23:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-01-11 21:23:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-01-11 21:23:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-01-11 21:23:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2019-01-11 21:23:03,942 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2019-01-11 21:23:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:03,942 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2019-01-11 21:23:03,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2019-01-11 21:23:03,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-11 21:23:03,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:03,947 INFO L402 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-01-11 21:23:03,947 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:03,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:03,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1829577626, now seen corresponding path program 1 times [2019-01-11 21:23:03,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:03,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:03,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:04,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:04,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:04,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:04,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:04,038 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2019-01-11 21:23:04,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:04,780 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2019-01-11 21:23:04,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:04,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-01-11 21:23:04,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:04,784 INFO L225 Difference]: With dead ends: 727 [2019-01-11 21:23:04,785 INFO L226 Difference]: Without dead ends: 371 [2019-01-11 21:23:04,785 INFO L631 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-01-11 21:23:04,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-01-11 21:23:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-01-11 21:23:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-01-11 21:23:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2019-01-11 21:23:04,798 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2019-01-11 21:23:04,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:04,799 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2019-01-11 21:23:04,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2019-01-11 21:23:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:23:04,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:04,802 INFO L402 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-01-11 21:23:04,802 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:04,803 INFO L82 PathProgramCache]: Analyzing trace with hash -932592104, now seen corresponding path program 1 times [2019-01-11 21:23:04,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:04,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:04,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:04,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:04,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:04,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:04,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:04,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:04,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:04,875 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2019-01-11 21:23:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:05,588 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2019-01-11 21:23:05,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:05,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:23:05,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:05,592 INFO L225 Difference]: With dead ends: 744 [2019-01-11 21:23:05,593 INFO L226 Difference]: Without dead ends: 388 [2019-01-11 21:23:05,594 INFO L631 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-01-11 21:23:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-11 21:23:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-01-11 21:23:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-01-11 21:23:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2019-01-11 21:23:05,610 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2019-01-11 21:23:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:05,611 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2019-01-11 21:23:05,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2019-01-11 21:23:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 21:23:05,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:05,614 INFO L402 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-01-11 21:23:05,615 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:05,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:05,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1760203780, now seen corresponding path program 1 times [2019-01-11 21:23:05,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:05,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:05,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:05,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:05,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:05,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:05,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:05,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:05,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:05,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:05,707 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2019-01-11 21:23:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:06,132 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2019-01-11 21:23:06,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:06,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-11 21:23:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:06,136 INFO L225 Difference]: With dead ends: 765 [2019-01-11 21:23:06,136 INFO L226 Difference]: Without dead ends: 388 [2019-01-11 21:23:06,137 INFO L631 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-01-11 21:23:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-11 21:23:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-01-11 21:23:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-01-11 21:23:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2019-01-11 21:23:06,150 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2019-01-11 21:23:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:06,150 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2019-01-11 21:23:06,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2019-01-11 21:23:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 21:23:06,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:06,154 INFO L402 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-01-11 21:23:06,154 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:06,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:06,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2108241292, now seen corresponding path program 1 times [2019-01-11 21:23:06,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:06,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:06,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:06,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-11 21:23:06,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:06,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:06,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:06,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:06,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:06,247 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2019-01-11 21:23:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:06,565 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2019-01-11 21:23:06,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:06,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-11 21:23:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:06,569 INFO L225 Difference]: With dead ends: 1092 [2019-01-11 21:23:06,569 INFO L226 Difference]: Without dead ends: 715 [2019-01-11 21:23:06,570 INFO L631 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-01-11 21:23:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-01-11 21:23:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-01-11 21:23:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-01-11 21:23:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2019-01-11 21:23:06,594 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2019-01-11 21:23:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:06,597 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2019-01-11 21:23:06,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:06,597 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2019-01-11 21:23:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 21:23:06,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:06,599 INFO L402 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-01-11 21:23:06,601 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:06,602 INFO L82 PathProgramCache]: Analyzing trace with hash -58853450, now seen corresponding path program 1 times [2019-01-11 21:23:06,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:06,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:06,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:06,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:06,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:23:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:23:06,714 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:23:06,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:23:06 BoogieIcfgContainer [2019-01-11 21:23:06,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:23:06,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:23:06,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:23:06,791 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:23:06,794 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:22:55" (3/4) ... [2019-01-11 21:23:06,797 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-11 21:23:06,960 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:23:06,960 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:23:06,964 INFO L168 Benchmark]: Toolchain (without parser) took 13394.45 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 272.1 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -221.8 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:06,966 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:23:06,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.57 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:06,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 190.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:06,967 INFO L168 Benchmark]: Boogie Preprocessor took 74.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:23:06,967 INFO L168 Benchmark]: RCFGBuilder took 1372.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:06,967 INFO L168 Benchmark]: TraceAbstraction took 11038.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:06,968 INFO L168 Benchmark]: Witness Printer took 169.25 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:06,973 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 540.57 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 190.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1372.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11038.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Witness Printer took 169.25 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 612]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L617] int s ; [L618] int tmp ; [L622] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 ; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L41] int s__session__cipher ; [L42] int buf = __VERIFIER_nondet_int() ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp = __VERIFIER_nondet_long() ; [L46] int cb ; [L47] long num1 ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 ; [L56] int tmp___4 ; [L57] int tmp___5 ; [L58] int tmp___6 ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 ; [L62] int tmp___10 ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND FALSE !(tmp___1 + 12288) [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L269] s__shutdown = 0 [L270] ret = __VERIFIER_nondet_int() [L271] COND TRUE blastFlag == 0 [L272] blastFlag = 1 [L274] COND FALSE !(ret <= 0) [L277] got_new_session = 1 [L278] s__state = 8496 [L279] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L601] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L283] ret = __VERIFIER_nondet_int() [L284] COND TRUE blastFlag == 1 [L285] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L290] COND TRUE \read(s__hit) [L291] s__state = 8656 [L295] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L601] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND FALSE !(s__state == 8576) [L170] COND FALSE !(s__state == 8577) [L173] COND FALSE !(s__state == 8592) [L176] COND FALSE !(s__state == 8593) [L179] COND FALSE !(s__state == 8608) [L182] COND FALSE !(s__state == 8609) [L185] COND FALSE !(s__state == 8640) [L188] COND FALSE !(s__state == 8641) [L191] COND TRUE s__state == 8656 [L489] s__session__cipher = s__s3__tmp__new_cipher [L490] tmp___9 = __VERIFIER_nondet_int() [L491] COND FALSE !(! tmp___9) [L495] ret = __VERIFIER_nondet_int() [L496] COND TRUE blastFlag == 2 [L497] blastFlag = 3 [L499] COND FALSE !(ret <= 0) [L502] s__state = 8672 [L503] s__init_num = 0 [L504] tmp___10 = __VERIFIER_nondet_int() [L505] COND FALSE !(! tmp___10) [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L601] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND FALSE !(s__state == 8576) [L170] COND FALSE !(s__state == 8577) [L173] COND FALSE !(s__state == 8592) [L176] COND FALSE !(s__state == 8593) [L179] COND FALSE !(s__state == 8608) [L182] COND FALSE !(s__state == 8609) [L185] COND FALSE !(s__state == 8640) [L188] COND FALSE !(s__state == 8641) [L191] COND FALSE !(s__state == 8656) [L194] COND FALSE !(s__state == 8657) [L197] COND TRUE s__state == 8672 [L512] ret = __VERIFIER_nondet_int() [L513] COND FALSE !(blastFlag == 4) [L516] COND TRUE blastFlag == 3 [L612] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. UNSAFE Result, 10.9s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 8.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2210 SDtfs, 2216 SDslu, 420 SDs, 0 SdLazy, 1340 SolverSat, 604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...