./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_13_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_13_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 da95f8ee1fdff950e8bdc600c0af9fd0f48d5b20 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2018-12-30 16:07:54,056 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:07:54,060 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:07:54,073 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:07:54,073 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:07:54,074 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:07:54,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:07:54,078 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:07:54,080 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:07:54,081 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:07:54,082 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:07:54,082 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:07:54,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:07:54,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:07:54,086 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:07:54,087 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:07:54,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:07:54,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:07:54,093 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:07:54,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:07:54,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:07:54,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:07:54,100 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:07:54,100 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:07:54,100 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:07:54,102 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:07:54,103 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:07:54,104 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:07:54,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:07:54,106 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:07:54,107 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:07:54,108 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:07:54,108 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:07:54,108 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:07:54,110 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:07:54,110 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:07:54,111 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:07:54,139 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:07:54,139 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:07:54,141 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:07:54,141 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:07:54,141 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:07:54,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:07:54,142 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:07:54,142 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:07:54,142 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:07:54,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:07:54,142 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:07:54,143 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:07:54,144 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:07:54,144 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:07:54,144 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:07:54,144 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:07:54,144 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:07:54,145 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:07:54,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:07:54,146 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:07:54,146 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:07:54,146 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:07:54,146 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:07:54,146 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:07:54,147 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:07:54,148 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:07:54,148 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:07:54,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:07:54,148 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 -> da95f8ee1fdff950e8bdc600c0af9fd0f48d5b20 [2018-12-30 16:07:54,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:07:54,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:07:54,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:07:54,217 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:07:54,218 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:07:54,220 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_13_false-unreach-call_false-termination.cil.c [2018-12-30 16:07:54,292 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c409021/a4b665a4944e4aa7a32e9effd00ace4a/FLAG674494ebd [2018-12-30 16:07:54,889 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:07:54,890 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_13_false-unreach-call_false-termination.cil.c [2018-12-30 16:07:54,913 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c409021/a4b665a4944e4aa7a32e9effd00ace4a/FLAG674494ebd [2018-12-30 16:07:55,166 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c409021/a4b665a4944e4aa7a32e9effd00ace4a [2018-12-30 16:07:55,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:07:55,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:07:55,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:07:55,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:07:55,177 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:07:55,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:07:55" (1/1) ... [2018-12-30 16:07:55,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7f6200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55, skipping insertion in model container [2018-12-30 16:07:55,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:07:55" (1/1) ... [2018-12-30 16:07:55,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:07:55,248 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:07:55,544 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:07:55,550 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:07:55,622 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:07:55,645 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:07:55,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55 WrapperNode [2018-12-30 16:07:55,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:07:55,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:07:55,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:07:55,647 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:07:55,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55" (1/1) ... [2018-12-30 16:07:55,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55" (1/1) ... [2018-12-30 16:07:55,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:07:55,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:07:55,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:07:55,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:07:55,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55" (1/1) ... [2018-12-30 16:07:55,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55" (1/1) ... [2018-12-30 16:07:55,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55" (1/1) ... [2018-12-30 16:07:55,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55" (1/1) ... [2018-12-30 16:07:55,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55" (1/1) ... [2018-12-30 16:07:55,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55" (1/1) ... [2018-12-30 16:07:55,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55" (1/1) ... [2018-12-30 16:07:55,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:07:55,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:07:55,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:07:55,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:07:55,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55" (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 [2018-12-30 16:07:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:07:55,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:07:56,106 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:07:56,106 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:07:57,457 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:07:57,458 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:07:57,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:07:57 BoogieIcfgContainer [2018-12-30 16:07:57,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:07:57,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:07:57,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:07:57,462 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:07:57,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:07:55" (1/3) ... [2018-12-30 16:07:57,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de6e933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:07:57, skipping insertion in model container [2018-12-30 16:07:57,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:55" (2/3) ... [2018-12-30 16:07:57,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de6e933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:07:57, skipping insertion in model container [2018-12-30 16:07:57,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:07:57" (3/3) ... [2018-12-30 16:07:57,466 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_13_false-unreach-call_false-termination.cil.c [2018-12-30 16:07:57,477 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:07:57,493 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:07:57,513 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:07:57,559 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:07:57,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:07:57,560 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:07:57,561 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:07:57,561 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:07:57,561 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:07:57,561 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:07:57,561 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:07:57,562 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:07:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2018-12-30 16:07:57,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:07:57,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:57,594 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] [2018-12-30 16:07:57,597 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1440243157, now seen corresponding path program 1 times [2018-12-30 16:07:57,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:57,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:57,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:57,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:57,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:07:57,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:57,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:07:57,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:07:57,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:07:57,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:07:57,898 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2018-12-30 16:07:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:07:58,712 INFO L93 Difference]: Finished difference Result 324 states and 556 transitions. [2018-12-30 16:07:58,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:07:58,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:07:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:07:58,733 INFO L225 Difference]: With dead ends: 324 [2018-12-30 16:07:58,734 INFO L226 Difference]: Without dead ends: 159 [2018-12-30 16:07:58,740 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 [2018-12-30 16:07:58,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-30 16:07:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2018-12-30 16:07:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-30 16:07:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2018-12-30 16:07:58,818 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 25 [2018-12-30 16:07:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:07:58,819 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2018-12-30 16:07:58,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:07:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2018-12-30 16:07:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:07:58,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:58,824 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] [2018-12-30 16:07:58,825 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:58,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:58,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1818183234, now seen corresponding path program 1 times [2018-12-30 16:07:58,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:58,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:58,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:58,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:58,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:07:58,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:58,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:07:58,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:07:58,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:07:58,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:07:58,999 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand 3 states. [2018-12-30 16:07:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:07:59,422 INFO L93 Difference]: Finished difference Result 329 states and 518 transitions. [2018-12-30 16:07:59,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:07:59,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:07:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:07:59,426 INFO L225 Difference]: With dead ends: 329 [2018-12-30 16:07:59,426 INFO L226 Difference]: Without dead ends: 179 [2018-12-30 16:07:59,428 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 [2018-12-30 16:07:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-30 16:07:59,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-30 16:07:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-30 16:07:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2018-12-30 16:07:59,449 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 26 [2018-12-30 16:07:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:07:59,450 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2018-12-30 16:07:59,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:07:59,450 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2018-12-30 16:07:59,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:07:59,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:59,452 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] [2018-12-30 16:07:59,452 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:59,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:59,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1920661961, now seen corresponding path program 1 times [2018-12-30 16:07:59,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:59,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:59,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:59,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:59,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:07:59,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:59,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:07:59,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:07:59,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:07:59,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:07:59,539 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand 3 states. [2018-12-30 16:07:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:07:59,833 INFO L93 Difference]: Finished difference Result 359 states and 559 transitions. [2018-12-30 16:07:59,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:07:59,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:07:59,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:07:59,837 INFO L225 Difference]: With dead ends: 359 [2018-12-30 16:07:59,838 INFO L226 Difference]: Without dead ends: 187 [2018-12-30 16:07:59,840 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 [2018-12-30 16:07:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-30 16:07:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-12-30 16:07:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-30 16:07:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2018-12-30 16:07:59,858 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 289 transitions. Word has length 26 [2018-12-30 16:07:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:07:59,858 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 289 transitions. [2018-12-30 16:07:59,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:07:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 289 transitions. [2018-12-30 16:07:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:07:59,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:59,861 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] [2018-12-30 16:07:59,861 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash -304150793, now seen corresponding path program 1 times [2018-12-30 16:07:59,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:59,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:59,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:59,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:59,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:07:59,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:59,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:07:59,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:07:59,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:07:59,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:07:59,933 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. Second operand 3 states. [2018-12-30 16:08:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:00,323 INFO L93 Difference]: Finished difference Result 364 states and 569 transitions. [2018-12-30 16:08:00,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:00,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:08:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:00,325 INFO L225 Difference]: With dead ends: 364 [2018-12-30 16:08:00,326 INFO L226 Difference]: Without dead ends: 186 [2018-12-30 16:08:00,327 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 [2018-12-30 16:08:00,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-30 16:08:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-30 16:08:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-30 16:08:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2018-12-30 16:08:00,341 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 290 transitions. Word has length 26 [2018-12-30 16:08:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:00,342 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 290 transitions. [2018-12-30 16:08:00,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2018-12-30 16:08:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:08:00,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:00,344 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] [2018-12-30 16:08:00,344 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:00,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:00,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2065347919, now seen corresponding path program 1 times [2018-12-30 16:08:00,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:00,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:00,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:00,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:00,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:00,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:00,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:00,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:00,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:00,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:00,408 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand 3 states. [2018-12-30 16:08:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:00,618 INFO L93 Difference]: Finished difference Result 375 states and 581 transitions. [2018-12-30 16:08:00,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:00,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:08:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:00,621 INFO L225 Difference]: With dead ends: 375 [2018-12-30 16:08:00,621 INFO L226 Difference]: Without dead ends: 196 [2018-12-30 16:08:00,622 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 [2018-12-30 16:08:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-30 16:08:00,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2018-12-30 16:08:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-30 16:08:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2018-12-30 16:08:00,636 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 27 [2018-12-30 16:08:00,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:00,636 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2018-12-30 16:08:00,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:00,636 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2018-12-30 16:08:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 16:08:00,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:00,638 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] [2018-12-30 16:08:00,638 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:00,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:00,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1768037659, now seen corresponding path program 1 times [2018-12-30 16:08:00,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:00,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:00,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:00,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:00,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:00,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:00,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:00,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:00,700 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand 3 states. [2018-12-30 16:08:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:01,123 INFO L93 Difference]: Finished difference Result 375 states and 577 transitions. [2018-12-30 16:08:01,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:01,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-30 16:08:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:01,127 INFO L225 Difference]: With dead ends: 375 [2018-12-30 16:08:01,127 INFO L226 Difference]: Without dead ends: 196 [2018-12-30 16:08:01,128 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 [2018-12-30 16:08:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-30 16:08:01,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2018-12-30 16:08:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-30 16:08:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 286 transitions. [2018-12-30 16:08:01,145 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 286 transitions. Word has length 28 [2018-12-30 16:08:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:01,145 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 286 transitions. [2018-12-30 16:08:01,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 286 transitions. [2018-12-30 16:08:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 16:08:01,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:01,147 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] [2018-12-30 16:08:01,147 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:01,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:01,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1213962132, now seen corresponding path program 1 times [2018-12-30 16:08:01,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:01,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:01,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:01,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:01,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:01,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:01,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:01,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:01,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:01,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:01,239 INFO L87 Difference]: Start difference. First operand 186 states and 286 transitions. Second operand 3 states. [2018-12-30 16:08:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:01,567 INFO L93 Difference]: Finished difference Result 375 states and 573 transitions. [2018-12-30 16:08:01,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:01,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-30 16:08:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:01,570 INFO L225 Difference]: With dead ends: 375 [2018-12-30 16:08:01,570 INFO L226 Difference]: Without dead ends: 196 [2018-12-30 16:08:01,571 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 [2018-12-30 16:08:01,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-30 16:08:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2018-12-30 16:08:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-30 16:08:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 284 transitions. [2018-12-30 16:08:01,581 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 284 transitions. Word has length 29 [2018-12-30 16:08:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:01,581 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 284 transitions. [2018-12-30 16:08:01,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 284 transitions. [2018-12-30 16:08:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 16:08:01,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:01,583 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] [2018-12-30 16:08:01,583 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:01,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:01,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1639645429, now seen corresponding path program 1 times [2018-12-30 16:08:01,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:01,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:01,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:01,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:01,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:01,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:01,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:01,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:08:01,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:08:01,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:08:01,708 INFO L87 Difference]: Start difference. First operand 186 states and 284 transitions. Second operand 4 states. [2018-12-30 16:08:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:02,163 INFO L93 Difference]: Finished difference Result 571 states and 870 transitions. [2018-12-30 16:08:02,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:08:02,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-12-30 16:08:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:02,167 INFO L225 Difference]: With dead ends: 571 [2018-12-30 16:08:02,167 INFO L226 Difference]: Without dead ends: 392 [2018-12-30 16:08:02,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:08:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-12-30 16:08:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 356. [2018-12-30 16:08:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-30 16:08:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 542 transitions. [2018-12-30 16:08:02,186 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 542 transitions. Word has length 29 [2018-12-30 16:08:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:02,186 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 542 transitions. [2018-12-30 16:08:02,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:08:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 542 transitions. [2018-12-30 16:08:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-30 16:08:02,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:02,187 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] [2018-12-30 16:08:02,188 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:02,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:02,188 INFO L82 PathProgramCache]: Analyzing trace with hash -356314719, now seen corresponding path program 1 times [2018-12-30 16:08:02,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:02,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:02,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:02,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:02,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:02,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:02,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:02,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:02,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:02,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:02,251 INFO L87 Difference]: Start difference. First operand 356 states and 542 transitions. Second operand 3 states. [2018-12-30 16:08:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:03,156 INFO L93 Difference]: Finished difference Result 780 states and 1196 transitions. [2018-12-30 16:08:03,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:03,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-30 16:08:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:03,164 INFO L225 Difference]: With dead ends: 780 [2018-12-30 16:08:03,165 INFO L226 Difference]: Without dead ends: 431 [2018-12-30 16:08:03,166 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 [2018-12-30 16:08:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-30 16:08:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2018-12-30 16:08:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-30 16:08:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 629 transitions. [2018-12-30 16:08:03,192 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 629 transitions. Word has length 32 [2018-12-30 16:08:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:03,198 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 629 transitions. [2018-12-30 16:08:03,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 629 transitions. [2018-12-30 16:08:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-30 16:08:03,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:03,203 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] [2018-12-30 16:08:03,203 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:03,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:03,203 INFO L82 PathProgramCache]: Analyzing trace with hash 863724629, now seen corresponding path program 1 times [2018-12-30 16:08:03,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:03,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:03,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:03,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:03,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:03,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:03,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:03,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:03,315 INFO L87 Difference]: Start difference. First operand 411 states and 629 transitions. Second operand 3 states. [2018-12-30 16:08:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:04,047 INFO L93 Difference]: Finished difference Result 857 states and 1320 transitions. [2018-12-30 16:08:04,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:04,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-30 16:08:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:04,054 INFO L225 Difference]: With dead ends: 857 [2018-12-30 16:08:04,054 INFO L226 Difference]: Without dead ends: 453 [2018-12-30 16:08:04,056 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 [2018-12-30 16:08:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-30 16:08:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 433. [2018-12-30 16:08:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-12-30 16:08:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 669 transitions. [2018-12-30 16:08:04,076 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 669 transitions. Word has length 33 [2018-12-30 16:08:04,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:04,077 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 669 transitions. [2018-12-30 16:08:04,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 669 transitions. [2018-12-30 16:08:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-30 16:08:04,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:04,079 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] [2018-12-30 16:08:04,080 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:04,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131601, now seen corresponding path program 1 times [2018-12-30 16:08:04,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:04,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:04,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:04,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:04,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:04,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:04,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:04,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:04,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:04,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:04,145 INFO L87 Difference]: Start difference. First operand 433 states and 669 transitions. Second operand 3 states. [2018-12-30 16:08:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:05,609 INFO L93 Difference]: Finished difference Result 924 states and 1432 transitions. [2018-12-30 16:08:05,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:05,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-30 16:08:05,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:05,614 INFO L225 Difference]: With dead ends: 924 [2018-12-30 16:08:05,615 INFO L226 Difference]: Without dead ends: 498 [2018-12-30 16:08:05,617 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 [2018-12-30 16:08:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-12-30 16:08:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 488. [2018-12-30 16:08:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-12-30 16:08:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 759 transitions. [2018-12-30 16:08:05,644 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 759 transitions. Word has length 39 [2018-12-30 16:08:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:05,645 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 759 transitions. [2018-12-30 16:08:05,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 759 transitions. [2018-12-30 16:08:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-30 16:08:05,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:05,648 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] [2018-12-30 16:08:05,649 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:05,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430936, now seen corresponding path program 1 times [2018-12-30 16:08:05,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:05,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:05,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:05,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:05,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:05,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:05,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:05,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:05,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:05,764 INFO L87 Difference]: Start difference. First operand 488 states and 759 transitions. Second operand 3 states. [2018-12-30 16:08:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:06,512 INFO L93 Difference]: Finished difference Result 991 states and 1544 transitions. [2018-12-30 16:08:06,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:06,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-30 16:08:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:06,519 INFO L225 Difference]: With dead ends: 991 [2018-12-30 16:08:06,519 INFO L226 Difference]: Without dead ends: 510 [2018-12-30 16:08:06,520 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 [2018-12-30 16:08:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-12-30 16:08:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 500. [2018-12-30 16:08:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-12-30 16:08:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 781 transitions. [2018-12-30 16:08:06,541 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 781 transitions. Word has length 40 [2018-12-30 16:08:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:06,541 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 781 transitions. [2018-12-30 16:08:06,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 781 transitions. [2018-12-30 16:08:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-30 16:08:06,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:06,543 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-30 16:08:06,543 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:06,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:06,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1491732218, now seen corresponding path program 1 times [2018-12-30 16:08:06,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:06,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:06,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:06,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:06,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:06,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:06,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:06,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:06,643 INFO L87 Difference]: Start difference. First operand 500 states and 781 transitions. Second operand 3 states. [2018-12-30 16:08:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:07,653 INFO L93 Difference]: Finished difference Result 1007 states and 1574 transitions. [2018-12-30 16:08:07,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:07,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-30 16:08:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:07,658 INFO L225 Difference]: With dead ends: 1007 [2018-12-30 16:08:07,658 INFO L226 Difference]: Without dead ends: 514 [2018-12-30 16:08:07,660 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 [2018-12-30 16:08:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-12-30 16:08:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2018-12-30 16:08:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-12-30 16:08:07,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 777 transitions. [2018-12-30 16:08:07,680 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 777 transitions. Word has length 60 [2018-12-30 16:08:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:07,681 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 777 transitions. [2018-12-30 16:08:07,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 777 transitions. [2018-12-30 16:08:07,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-30 16:08:07,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:07,684 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-30 16:08:07,684 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:07,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:07,684 INFO L82 PathProgramCache]: Analyzing trace with hash -892846741, now seen corresponding path program 1 times [2018-12-30 16:08:07,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:07,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:07,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:07,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:07,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-30 16:08:07,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:07,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:07,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:07,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:07,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:07,739 INFO L87 Difference]: Start difference. First operand 500 states and 777 transitions. Second operand 3 states. [2018-12-30 16:08:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:08,082 INFO L93 Difference]: Finished difference Result 1035 states and 1604 transitions. [2018-12-30 16:08:08,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:08,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-12-30 16:08:08,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:08,087 INFO L225 Difference]: With dead ends: 1035 [2018-12-30 16:08:08,087 INFO L226 Difference]: Without dead ends: 542 [2018-12-30 16:08:08,088 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 [2018-12-30 16:08:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-12-30 16:08:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 532. [2018-12-30 16:08:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-12-30 16:08:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 820 transitions. [2018-12-30 16:08:08,108 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 820 transitions. Word has length 61 [2018-12-30 16:08:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:08,109 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 820 transitions. [2018-12-30 16:08:08,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 820 transitions. [2018-12-30 16:08:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-30 16:08:08,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:08,110 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-30 16:08:08,111 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:08,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:08,111 INFO L82 PathProgramCache]: Analyzing trace with hash 27094997, now seen corresponding path program 1 times [2018-12-30 16:08:08,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:08,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:08,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:08,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:08,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:08,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:08,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:08,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:08,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:08,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:08,186 INFO L87 Difference]: Start difference. First operand 532 states and 820 transitions. Second operand 3 states. [2018-12-30 16:08:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:08,533 INFO L93 Difference]: Finished difference Result 1095 states and 1685 transitions. [2018-12-30 16:08:08,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:08,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-12-30 16:08:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:08,537 INFO L225 Difference]: With dead ends: 1095 [2018-12-30 16:08:08,538 INFO L226 Difference]: Without dead ends: 570 [2018-12-30 16:08:08,540 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 [2018-12-30 16:08:08,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-12-30 16:08:08,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2018-12-30 16:08:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-30 16:08:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 873 transitions. [2018-12-30 16:08:08,571 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 873 transitions. Word has length 61 [2018-12-30 16:08:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:08,572 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 873 transitions. [2018-12-30 16:08:08,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 873 transitions. [2018-12-30 16:08:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-30 16:08:08,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:08,576 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-30 16:08:08,576 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:08,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1141694985, now seen corresponding path program 1 times [2018-12-30 16:08:08,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:08,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:08,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:08,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-30 16:08:08,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:08,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:08,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:08,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:08,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:08,668 INFO L87 Difference]: Start difference. First operand 570 states and 873 transitions. Second operand 3 states. [2018-12-30 16:08:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:09,153 INFO L93 Difference]: Finished difference Result 1143 states and 1749 transitions. [2018-12-30 16:08:09,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:09,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-30 16:08:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:09,157 INFO L225 Difference]: With dead ends: 1143 [2018-12-30 16:08:09,157 INFO L226 Difference]: Without dead ends: 580 [2018-12-30 16:08:09,160 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 [2018-12-30 16:08:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-12-30 16:08:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 570. [2018-12-30 16:08:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-30 16:08:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 868 transitions. [2018-12-30 16:08:09,185 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 868 transitions. Word has length 62 [2018-12-30 16:08:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:09,204 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 868 transitions. [2018-12-30 16:08:09,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 868 transitions. [2018-12-30 16:08:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-30 16:08:09,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:09,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:09,208 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:09,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:09,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1688729156, now seen corresponding path program 1 times [2018-12-30 16:08:09,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:09,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:09,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:09,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:09,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:09,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:09,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:09,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:09,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:09,289 INFO L87 Difference]: Start difference. First operand 570 states and 868 transitions. Second operand 3 states. [2018-12-30 16:08:09,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:09,639 INFO L93 Difference]: Finished difference Result 1180 states and 1793 transitions. [2018-12-30 16:08:09,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:09,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-30 16:08:09,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:09,643 INFO L225 Difference]: With dead ends: 1180 [2018-12-30 16:08:09,643 INFO L226 Difference]: Without dead ends: 617 [2018-12-30 16:08:09,644 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 [2018-12-30 16:08:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-12-30 16:08:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2018-12-30 16:08:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-12-30 16:08:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 929 transitions. [2018-12-30 16:08:09,666 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 929 transitions. Word has length 73 [2018-12-30 16:08:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:09,666 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 929 transitions. [2018-12-30 16:08:09,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 929 transitions. [2018-12-30 16:08:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-30 16:08:09,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:09,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:09,668 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:09,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:09,669 INFO L82 PathProgramCache]: Analyzing trace with hash -628849429, now seen corresponding path program 1 times [2018-12-30 16:08:09,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:09,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:09,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:09,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:09,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:09,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:09,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:09,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:09,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:09,727 INFO L87 Difference]: Start difference. First operand 613 states and 929 transitions. Second operand 3 states. [2018-12-30 16:08:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:09,908 INFO L93 Difference]: Finished difference Result 1223 states and 1851 transitions. [2018-12-30 16:08:09,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:09,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-30 16:08:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:09,912 INFO L225 Difference]: With dead ends: 1223 [2018-12-30 16:08:09,912 INFO L226 Difference]: Without dead ends: 617 [2018-12-30 16:08:09,913 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 [2018-12-30 16:08:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-12-30 16:08:09,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2018-12-30 16:08:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-12-30 16:08:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 926 transitions. [2018-12-30 16:08:09,935 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 926 transitions. Word has length 74 [2018-12-30 16:08:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:09,935 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 926 transitions. [2018-12-30 16:08:09,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 926 transitions. [2018-12-30 16:08:09,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-30 16:08:09,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:09,939 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-12-30 16:08:09,939 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1361446465, now seen corresponding path program 1 times [2018-12-30 16:08:09,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:09,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:09,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:09,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-30 16:08:10,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:10,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:10,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:10,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:10,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:10,010 INFO L87 Difference]: Start difference. First operand 613 states and 926 transitions. Second operand 3 states. [2018-12-30 16:08:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:10,216 INFO L93 Difference]: Finished difference Result 1255 states and 1894 transitions. [2018-12-30 16:08:10,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:10,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-30 16:08:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:10,220 INFO L225 Difference]: With dead ends: 1255 [2018-12-30 16:08:10,220 INFO L226 Difference]: Without dead ends: 649 [2018-12-30 16:08:10,221 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 [2018-12-30 16:08:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-12-30 16:08:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2018-12-30 16:08:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-12-30 16:08:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 960 transitions. [2018-12-30 16:08:10,243 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 960 transitions. Word has length 83 [2018-12-30 16:08:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:10,243 INFO L480 AbstractCegarLoop]: Abstraction has 641 states and 960 transitions. [2018-12-30 16:08:10,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 960 transitions. [2018-12-30 16:08:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:08:10,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:10,247 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-12-30 16:08:10,247 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1716915501, now seen corresponding path program 1 times [2018-12-30 16:08:10,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:10,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:10,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-30 16:08:10,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:10,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:10,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:10,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:10,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:10,322 INFO L87 Difference]: Start difference. First operand 641 states and 960 transitions. Second operand 3 states. [2018-12-30 16:08:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:10,664 INFO L93 Difference]: Finished difference Result 1283 states and 1921 transitions. [2018-12-30 16:08:10,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:10,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:08:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:10,668 INFO L225 Difference]: With dead ends: 1283 [2018-12-30 16:08:10,668 INFO L226 Difference]: Without dead ends: 649 [2018-12-30 16:08:10,670 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 [2018-12-30 16:08:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-12-30 16:08:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2018-12-30 16:08:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-12-30 16:08:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2018-12-30 16:08:10,694 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 84 [2018-12-30 16:08:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:10,694 INFO L480 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2018-12-30 16:08:10,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2018-12-30 16:08:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-30 16:08:10,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:10,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:10,698 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1450581597, now seen corresponding path program 1 times [2018-12-30 16:08:10,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:10,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:10,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:10,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:10,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-30 16:08:10,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:10,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:10,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:10,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:10,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:10,773 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand 3 states. [2018-12-30 16:08:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:10,973 INFO L93 Difference]: Finished difference Result 1315 states and 1948 transitions. [2018-12-30 16:08:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:10,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-12-30 16:08:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:10,979 INFO L225 Difference]: With dead ends: 1315 [2018-12-30 16:08:10,980 INFO L226 Difference]: Without dead ends: 681 [2018-12-30 16:08:10,981 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 [2018-12-30 16:08:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-12-30 16:08:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2018-12-30 16:08:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-12-30 16:08:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 997 transitions. [2018-12-30 16:08:11,008 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 997 transitions. Word has length 88 [2018-12-30 16:08:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:11,008 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 997 transitions. [2018-12-30 16:08:11,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 997 transitions. [2018-12-30 16:08:11,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-30 16:08:11,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:11,012 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] [2018-12-30 16:08:11,012 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash -398439497, now seen corresponding path program 1 times [2018-12-30 16:08:11,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:11,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:11,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:11,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-30 16:08:11,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:11,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:11,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:11,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:11,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:11,117 INFO L87 Difference]: Start difference. First operand 677 states and 997 transitions. Second operand 3 states. [2018-12-30 16:08:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:11,483 INFO L93 Difference]: Finished difference Result 1351 states and 1987 transitions. [2018-12-30 16:08:11,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:11,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-30 16:08:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:11,488 INFO L225 Difference]: With dead ends: 1351 [2018-12-30 16:08:11,488 INFO L226 Difference]: Without dead ends: 681 [2018-12-30 16:08:11,489 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 [2018-12-30 16:08:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-12-30 16:08:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2018-12-30 16:08:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-12-30 16:08:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 992 transitions. [2018-12-30 16:08:11,513 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 992 transitions. Word has length 89 [2018-12-30 16:08:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:11,513 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 992 transitions. [2018-12-30 16:08:11,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 992 transitions. [2018-12-30 16:08:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-30 16:08:11,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:11,517 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-12-30 16:08:11,517 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:11,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:11,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1868895208, now seen corresponding path program 1 times [2018-12-30 16:08:11,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:11,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:11,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:11,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-30 16:08:11,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:11,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:11,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:11,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:11,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:11,620 INFO L87 Difference]: Start difference. First operand 677 states and 992 transitions. Second operand 3 states. [2018-12-30 16:08:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:11,758 INFO L93 Difference]: Finished difference Result 2003 states and 2928 transitions. [2018-12-30 16:08:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:11,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-30 16:08:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:11,767 INFO L225 Difference]: With dead ends: 2003 [2018-12-30 16:08:11,767 INFO L226 Difference]: Without dead ends: 1333 [2018-12-30 16:08:11,769 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 [2018-12-30 16:08:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2018-12-30 16:08:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 679. [2018-12-30 16:08:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2018-12-30 16:08:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 994 transitions. [2018-12-30 16:08:11,811 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 994 transitions. Word has length 100 [2018-12-30 16:08:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:11,811 INFO L480 AbstractCegarLoop]: Abstraction has 679 states and 994 transitions. [2018-12-30 16:08:11,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 994 transitions. [2018-12-30 16:08:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-30 16:08:11,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:11,814 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-12-30 16:08:11,814 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash 589031530, now seen corresponding path program 1 times [2018-12-30 16:08:11,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:11,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:11,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:11,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-30 16:08:11,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:11,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:11,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:11,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:11,920 INFO L87 Difference]: Start difference. First operand 679 states and 994 transitions. Second operand 3 states. [2018-12-30 16:08:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:12,128 INFO L93 Difference]: Finished difference Result 1362 states and 1992 transitions. [2018-12-30 16:08:12,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:12,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-30 16:08:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:12,134 INFO L225 Difference]: With dead ends: 1362 [2018-12-30 16:08:12,134 INFO L226 Difference]: Without dead ends: 690 [2018-12-30 16:08:12,136 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 [2018-12-30 16:08:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-12-30 16:08:12,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 677. [2018-12-30 16:08:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-12-30 16:08:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 987 transitions. [2018-12-30 16:08:12,179 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 987 transitions. Word has length 100 [2018-12-30 16:08:12,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:12,179 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 987 transitions. [2018-12-30 16:08:12,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 987 transitions. [2018-12-30 16:08:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-30 16:08:12,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:12,184 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-12-30 16:08:12,184 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:12,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:12,185 INFO L82 PathProgramCache]: Analyzing trace with hash 303396910, now seen corresponding path program 1 times [2018-12-30 16:08:12,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:12,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:12,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:12,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:12,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-30 16:08:12,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:12,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:12,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:12,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:12,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:12,288 INFO L87 Difference]: Start difference. First operand 677 states and 987 transitions. Second operand 3 states. [2018-12-30 16:08:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:12,648 INFO L93 Difference]: Finished difference Result 2017 states and 2939 transitions. [2018-12-30 16:08:12,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:12,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-30 16:08:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:12,653 INFO L225 Difference]: With dead ends: 2017 [2018-12-30 16:08:12,653 INFO L226 Difference]: Without dead ends: 1347 [2018-12-30 16:08:12,655 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 [2018-12-30 16:08:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2018-12-30 16:08:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1345. [2018-12-30 16:08:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-12-30 16:08:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1950 transitions. [2018-12-30 16:08:12,709 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1950 transitions. Word has length 101 [2018-12-30 16:08:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:12,710 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 1950 transitions. [2018-12-30 16:08:12,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1950 transitions. [2018-12-30 16:08:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-30 16:08:12,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:12,715 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-12-30 16:08:12,715 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:12,715 INFO L82 PathProgramCache]: Analyzing trace with hash -283409104, now seen corresponding path program 1 times [2018-12-30 16:08:12,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:12,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:12,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:12,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:12,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:08:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:08:12,818 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 16:08:12,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:08:12 BoogieIcfgContainer [2018-12-30 16:08:12,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:08:12,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:08:12,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:08:12,890 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:08:12,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:07:57" (3/4) ... [2018-12-30 16:08:12,896 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-30 16:08:13,045 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:08:13,050 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:08:13,051 INFO L168 Benchmark]: Toolchain (without parser) took 17880.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -287.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:13,053 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:08:13,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.00 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:13,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:13,054 INFO L168 Benchmark]: Boogie Preprocessor took 68.12 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:13,056 INFO L168 Benchmark]: RCFGBuilder took 1583.51 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: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:13,057 INFO L168 Benchmark]: TraceAbstraction took 15430.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -186.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:08:13,057 INFO L168 Benchmark]: Witness Printer took 159.98 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: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:13,062 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 474.00 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 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 159.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.12 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1583.51 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: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15430.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -186.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 159.98 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: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 643]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L648] int s ; [L649] int tmp ; [L653] 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 ; [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 ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [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 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 = __VERIFIER_nondet_int() ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [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 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [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 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND FALSE !(! s__s3__tmp__reuse_message) [L632] 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 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 8512 [L297] s__init_num = 0 [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND FALSE !(! s__s3__tmp__reuse_message) [L632] 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 TRUE s__state == 8512 [L302] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L303] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L304] COND TRUE __cil_tmp56 + 256UL [L305] skip = 1 [L316] s__state = 8528 [L317] s__init_num = 0 [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND FALSE !(! s__s3__tmp__reuse_message) [L632] 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 TRUE s__state == 8528 [L321] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L322] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L324] __cil_tmp57 = (unsigned long )s__options [L325] COND TRUE __cil_tmp57 + 2097152UL [L326] s__s3__tmp__use_rsa_tmp = 1 [L331] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L358] ret = __VERIFIER_nondet_int() [L359] COND FALSE !(blastFlag == 6) [L362] COND FALSE !(ret <= 0) [L379] s__state = 8544 [L380] s__init_num = 0 [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND TRUE ! s__s3__tmp__reuse_message [L602] COND TRUE ! skip [L603] COND TRUE state == 8528 [L604] COND TRUE s__state == 8544 [L605] COND TRUE tmp___7 != 1024 [L606] COND TRUE tmp___7 != 512 [L607] COND TRUE __cil_tmp58 != 4294967294 [L608] COND TRUE l != 4294967266 [L643] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 154 locations, 1 error locations. UNSAFE Result, 15.3s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4244 SDtfs, 4375 SDslu, 1279 SDs, 0 SdLazy, 2053 SolverSat, 917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1345occurred in iteration=25, 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.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1371 ConstructedInterpolants, 0 QuantifiedInterpolants, 179497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 646/646 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...