./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_12_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_12_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 944a0f8e72be5c35a0f511b0309102d972799eb1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:50,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:07:50,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:07:50,928 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:07:50,929 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:07:50,930 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:07:50,934 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:07:50,936 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:07:50,940 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:07:50,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:07:50,944 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:07:50,945 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:07:50,946 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:07:50,949 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:07:50,956 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:07:50,956 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:07:50,958 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:07:50,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:07:50,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:07:50,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:07:50,969 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:07:50,972 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:07:50,975 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:07:50,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:07:50,977 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:07:50,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:07:50,979 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:07:50,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:07:50,982 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:07:50,984 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:07:50,986 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:07:50,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:07:50,987 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:07:50,987 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:07:50,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:07:50,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:07:50,991 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:51,016 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:07:51,017 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:07:51,019 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:07:51,019 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:07:51,019 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:07:51,020 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:07:51,020 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:07:51,021 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:07:51,021 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:07:51,021 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:07:51,021 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:07:51,021 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:07:51,022 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:07:51,022 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:07:51,022 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:07:51,023 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:07:51,023 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:07:51,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:07:51,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:07:51,023 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:07:51,024 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:07:51,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:07:51,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:07:51,024 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:07:51,024 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:07:51,024 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:07:51,027 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:07:51,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:07:51,027 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 -> 944a0f8e72be5c35a0f511b0309102d972799eb1 [2018-12-30 16:07:51,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:07:51,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:07:51,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:07:51,096 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:07:51,096 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:07:51,097 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_12_false-unreach-call_false-termination.cil.c [2018-12-30 16:07:51,158 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d21d69c/87e3d79f5e1444b69771d6f36fb183a3/FLAG9b1da9023 [2018-12-30 16:07:51,619 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:07:51,620 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_12_false-unreach-call_false-termination.cil.c [2018-12-30 16:07:51,632 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d21d69c/87e3d79f5e1444b69771d6f36fb183a3/FLAG9b1da9023 [2018-12-30 16:07:51,952 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d21d69c/87e3d79f5e1444b69771d6f36fb183a3 [2018-12-30 16:07:51,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:07:51,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:07:51,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:07:51,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:07:51,963 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:07:51,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:07:51" (1/1) ... [2018-12-30 16:07:51,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12db68d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:51, skipping insertion in model container [2018-12-30 16:07:51,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:07:51" (1/1) ... [2018-12-30 16:07:51,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:07:52,031 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:07:52,397 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:07:52,407 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:07:52,532 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:07:52,551 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:07:52,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:52 WrapperNode [2018-12-30 16:07:52,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:07:52,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:07:52,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:07:52,554 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:07:52,661 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:52" (1/1) ... [2018-12-30 16:07:52,677 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:52" (1/1) ... [2018-12-30 16:07:52,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:07:52,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:07:52,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:07:52,745 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:07:52,758 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:52" (1/1) ... [2018-12-30 16:07:52,759 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:52" (1/1) ... [2018-12-30 16:07:52,763 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:52" (1/1) ... [2018-12-30 16:07:52,768 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:52" (1/1) ... [2018-12-30 16:07:52,784 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:52" (1/1) ... [2018-12-30 16:07:52,797 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:52" (1/1) ... [2018-12-30 16:07:52,799 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:52" (1/1) ... [2018-12-30 16:07:52,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:07:52,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:07:52,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:07:52,815 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:07:52,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:52" (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:52,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:07:52,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:07:53,012 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:07:53,013 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:07:54,306 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:07:54,307 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:07:54,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:07:54 BoogieIcfgContainer [2018-12-30 16:07:54,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:07:54,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:07:54,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:07:54,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:07:54,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:07:51" (1/3) ... [2018-12-30 16:07:54,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66509934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:07:54, skipping insertion in model container [2018-12-30 16:07:54,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:07:52" (2/3) ... [2018-12-30 16:07:54,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66509934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:07:54, skipping insertion in model container [2018-12-30 16:07:54,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:07:54" (3/3) ... [2018-12-30 16:07:54,315 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_12_false-unreach-call_false-termination.cil.c [2018-12-30 16:07:54,325 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:07:54,334 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:07:54,352 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:07:54,389 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:07:54,390 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:07:54,390 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:07:54,390 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:07:54,390 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:07:54,391 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:07:54,391 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:07:54,391 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:07:54,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:07:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2018-12-30 16:07:54,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:07:54,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:54,422 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:07:54,424 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:54,434 INFO L82 PathProgramCache]: Analyzing trace with hash 837253908, now seen corresponding path program 1 times [2018-12-30 16:07:54,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:54,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:54,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:54,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:54,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:54,668 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:54,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:54,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:07:54,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:07:54,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:07:54,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:07:54,692 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 3 states. [2018-12-30 16:07:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:07:55,464 INFO L93 Difference]: Finished difference Result 352 states and 612 transitions. [2018-12-30 16:07:55,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:07:55,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:07:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:07:55,482 INFO L225 Difference]: With dead ends: 352 [2018-12-30 16:07:55,482 INFO L226 Difference]: Without dead ends: 173 [2018-12-30 16:07:55,487 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:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-30 16:07:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-12-30 16:07:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-30 16:07:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2018-12-30 16:07:55,545 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 27 [2018-12-30 16:07:55,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:07:55,545 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2018-12-30 16:07:55,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:07:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2018-12-30 16:07:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 16:07:55,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:55,548 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:07:55,548 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:55,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1153856875, now seen corresponding path program 1 times [2018-12-30 16:07:55,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:55,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:55,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:55,635 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:55,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:55,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:07:55,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:07:55,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:07:55,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:07:55,638 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 3 states. [2018-12-30 16:07:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:07:55,926 INFO L93 Difference]: Finished difference Result 357 states and 574 transitions. [2018-12-30 16:07:55,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:07:55,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-30 16:07:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:07:55,931 INFO L225 Difference]: With dead ends: 357 [2018-12-30 16:07:55,931 INFO L226 Difference]: Without dead ends: 193 [2018-12-30 16:07:55,933 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:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-30 16:07:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-30 16:07:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-30 16:07:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2018-12-30 16:07:55,952 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 28 [2018-12-30 16:07:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:07:55,952 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2018-12-30 16:07:55,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:07:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2018-12-30 16:07:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 16:07:55,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:55,954 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:07:55,955 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:55,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1283716064, now seen corresponding path program 1 times [2018-12-30 16:07:55,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:55,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:55,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:56,034 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:56,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:56,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:07:56,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:07:56,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:07:56,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:07:56,036 INFO L87 Difference]: Start difference. First operand 193 states and 306 transitions. Second operand 3 states. [2018-12-30 16:07:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:07:56,308 INFO L93 Difference]: Finished difference Result 387 states and 615 transitions. [2018-12-30 16:07:56,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:07:56,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-30 16:07:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:07:56,313 INFO L225 Difference]: With dead ends: 387 [2018-12-30 16:07:56,313 INFO L226 Difference]: Without dead ends: 201 [2018-12-30 16:07:56,315 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:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-30 16:07:56,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-12-30 16:07:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-30 16:07:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2018-12-30 16:07:56,343 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 28 [2018-12-30 16:07:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:07:56,343 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2018-12-30 16:07:56,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:07:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2018-12-30 16:07:56,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 16:07:56,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:56,345 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:07:56,345 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:56,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1700322528, now seen corresponding path program 1 times [2018-12-30 16:07:56,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:56,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:56,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:56,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:56,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:56,456 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:56,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:56,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:07:56,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:07:56,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:07:56,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:07:56,458 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand 3 states. [2018-12-30 16:07:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:07:56,949 INFO L93 Difference]: Finished difference Result 392 states and 625 transitions. [2018-12-30 16:07:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:07:56,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-30 16:07:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:07:56,952 INFO L225 Difference]: With dead ends: 392 [2018-12-30 16:07:56,953 INFO L226 Difference]: Without dead ends: 200 [2018-12-30 16:07:56,953 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:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-30 16:07:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-12-30 16:07:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-30 16:07:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2018-12-30 16:07:56,967 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 28 [2018-12-30 16:07:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:07:56,967 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2018-12-30 16:07:56,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:07:56,967 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2018-12-30 16:07:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 16:07:56,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:56,969 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:07:56,969 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:56,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:56,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1839049416, now seen corresponding path program 1 times [2018-12-30 16:07:56,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:56,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:56,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:56,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:56,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:57,019 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,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:57,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:07:57,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:07:57,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:07:57,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:07:57,021 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand 3 states. [2018-12-30 16:07:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:07:57,245 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2018-12-30 16:07:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:07:57,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-30 16:07:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:07:57,249 INFO L225 Difference]: With dead ends: 403 [2018-12-30 16:07:57,249 INFO L226 Difference]: Without dead ends: 210 [2018-12-30 16:07:57,250 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:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-30 16:07:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2018-12-30 16:07:57,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-30 16:07:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 316 transitions. [2018-12-30 16:07:57,261 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 316 transitions. Word has length 29 [2018-12-30 16:07:57,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:07:57,262 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 316 transitions. [2018-12-30 16:07:57,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:07:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 316 transitions. [2018-12-30 16:07:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-30 16:07:57,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:57,264 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] [2018-12-30 16:07:57,264 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:57,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:57,264 INFO L82 PathProgramCache]: Analyzing trace with hash 208599556, now seen corresponding path program 1 times [2018-12-30 16:07:57,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:57,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:57,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:57,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:57,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:57,347 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,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:57,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:07:57,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:07:57,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:07:57,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:07:57,349 INFO L87 Difference]: Start difference. First operand 200 states and 316 transitions. Second operand 3 states. [2018-12-30 16:07:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:07:57,817 INFO L93 Difference]: Finished difference Result 403 states and 633 transitions. [2018-12-30 16:07:57,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:07:57,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-30 16:07:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:07:57,821 INFO L225 Difference]: With dead ends: 403 [2018-12-30 16:07:57,821 INFO L226 Difference]: Without dead ends: 210 [2018-12-30 16:07:57,822 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:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-30 16:07:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2018-12-30 16:07:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-30 16:07:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 314 transitions. [2018-12-30 16:07:57,830 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 314 transitions. Word has length 30 [2018-12-30 16:07:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:07:57,831 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 314 transitions. [2018-12-30 16:07:57,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:07:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 314 transitions. [2018-12-30 16:07:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-30 16:07:57,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:57,832 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] [2018-12-30 16:07:57,833 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:57,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:57,833 INFO L82 PathProgramCache]: Analyzing trace with hash 317962813, now seen corresponding path program 1 times [2018-12-30 16:07:57,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:57,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:57,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:57,905 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,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:57,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:07:57,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:07:57,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:07:57,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:07:57,910 INFO L87 Difference]: Start difference. First operand 200 states and 314 transitions. Second operand 3 states. [2018-12-30 16:07:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:07:58,166 INFO L93 Difference]: Finished difference Result 403 states and 629 transitions. [2018-12-30 16:07:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:07:58,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-30 16:07:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:07:58,170 INFO L225 Difference]: With dead ends: 403 [2018-12-30 16:07:58,170 INFO L226 Difference]: Without dead ends: 210 [2018-12-30 16:07:58,171 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,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-30 16:07:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2018-12-30 16:07:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-30 16:07:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 312 transitions. [2018-12-30 16:07:58,181 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 312 transitions. Word has length 31 [2018-12-30 16:07:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:07:58,181 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 312 transitions. [2018-12-30 16:07:58,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:07:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 312 transitions. [2018-12-30 16:07:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-30 16:07:58,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:58,183 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] [2018-12-30 16:07:58,183 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:58,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1377718110, now seen corresponding path program 1 times [2018-12-30 16:07:58,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:58,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:58,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:58,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:58,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:58,299 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,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:58,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:07:58,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:07:58,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:07:58,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:07:58,302 INFO L87 Difference]: Start difference. First operand 200 states and 312 transitions. Second operand 4 states. [2018-12-30 16:07:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:07:58,875 INFO L93 Difference]: Finished difference Result 599 states and 929 transitions. [2018-12-30 16:07:58,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:07:58,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-30 16:07:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:07:58,878 INFO L225 Difference]: With dead ends: 599 [2018-12-30 16:07:58,879 INFO L226 Difference]: Without dead ends: 406 [2018-12-30 16:07:58,879 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:07:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-12-30 16:07:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 382. [2018-12-30 16:07:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-30 16:07:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 594 transitions. [2018-12-30 16:07:58,899 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 594 transitions. Word has length 31 [2018-12-30 16:07:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:07:58,899 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 594 transitions. [2018-12-30 16:07:58,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:07:58,900 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 594 transitions. [2018-12-30 16:07:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-30 16:07:58,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:07:58,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:07:58,901 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:07:58,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:07:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2127610357, now seen corresponding path program 1 times [2018-12-30 16:07:58,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:07:58,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:07:58,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:58,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:07:58,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:07:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:07:58,985 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,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:07:58,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:07:58,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:07:58,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:07:58,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:07:58,988 INFO L87 Difference]: Start difference. First operand 382 states and 594 transitions. Second operand 3 states. [2018-12-30 16:08:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:00,642 INFO L93 Difference]: Finished difference Result 841 states and 1323 transitions. [2018-12-30 16:08:00,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:00,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-30 16:08:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:00,650 INFO L225 Difference]: With dead ends: 841 [2018-12-30 16:08:00,651 INFO L226 Difference]: Without dead ends: 466 [2018-12-30 16:08:00,652 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,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-12-30 16:08:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 448. [2018-12-30 16:08:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-12-30 16:08:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 709 transitions. [2018-12-30 16:08:00,680 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 709 transitions. Word has length 43 [2018-12-30 16:08:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:00,680 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 709 transitions. [2018-12-30 16:08:00,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 709 transitions. [2018-12-30 16:08:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-30 16:08:00,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:00,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:00,682 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:00,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:00,682 INFO L82 PathProgramCache]: Analyzing trace with hash -918181316, now seen corresponding path program 1 times [2018-12-30 16:08:00,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:00,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:00,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:00,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:00,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:00,778 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,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:00,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:00,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:00,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:00,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:00,781 INFO L87 Difference]: Start difference. First operand 448 states and 709 transitions. Second operand 3 states. [2018-12-30 16:08:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:01,685 INFO L93 Difference]: Finished difference Result 930 states and 1481 transitions. [2018-12-30 16:08:01,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:01,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-30 16:08:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:01,690 INFO L225 Difference]: With dead ends: 930 [2018-12-30 16:08:01,690 INFO L226 Difference]: Without dead ends: 489 [2018-12-30 16:08:01,691 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,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-12-30 16:08:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 471. [2018-12-30 16:08:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-12-30 16:08:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 752 transitions. [2018-12-30 16:08:01,714 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 752 transitions. Word has length 44 [2018-12-30 16:08:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:01,715 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 752 transitions. [2018-12-30 16:08:01,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 752 transitions. [2018-12-30 16:08:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-30 16:08:01,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:01,717 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:01,717 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:01,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1360549312, now seen corresponding path program 1 times [2018-12-30 16:08:01,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:01,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:01,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:01,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:01,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-30 16:08:01,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:01,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:01,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:01,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:01,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:01,798 INFO L87 Difference]: Start difference. First operand 471 states and 752 transitions. Second operand 3 states. [2018-12-30 16:08:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:02,223 INFO L93 Difference]: Finished difference Result 987 states and 1577 transitions. [2018-12-30 16:08:02,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:02,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-30 16:08:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:02,229 INFO L225 Difference]: With dead ends: 987 [2018-12-30 16:08:02,229 INFO L226 Difference]: Without dead ends: 523 [2018-12-30 16:08:02,230 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:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-12-30 16:08:02,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2018-12-30 16:08:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-12-30 16:08:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 803 transitions. [2018-12-30 16:08:02,252 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 803 transitions. Word has length 55 [2018-12-30 16:08:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:02,252 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 803 transitions. [2018-12-30 16:08:02,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 803 transitions. [2018-12-30 16:08:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-30 16:08:02,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:02,257 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:02,257 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:02,258 INFO L82 PathProgramCache]: Analyzing trace with hash -938767092, now seen corresponding path program 1 times [2018-12-30 16:08:02,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:02,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:02,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:02,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-30 16:08:02,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:02,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:02,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:02,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:02,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:02,348 INFO L87 Difference]: Start difference. First operand 505 states and 803 transitions. Second operand 3 states. [2018-12-30 16:08:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:02,745 INFO L93 Difference]: Finished difference Result 1021 states and 1625 transitions. [2018-12-30 16:08:02,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:02,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-30 16:08:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:02,748 INFO L225 Difference]: With dead ends: 1021 [2018-12-30 16:08:02,748 INFO L226 Difference]: Without dead ends: 523 [2018-12-30 16:08:02,749 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:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-12-30 16:08:02,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2018-12-30 16:08:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-12-30 16:08:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 800 transitions. [2018-12-30 16:08:02,769 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 800 transitions. Word has length 56 [2018-12-30 16:08:02,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:02,769 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 800 transitions. [2018-12-30 16:08:02,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 800 transitions. [2018-12-30 16:08:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-30 16:08:02,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:02,770 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:02,770 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:02,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:02,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1817934782, now seen corresponding path program 1 times [2018-12-30 16:08:02,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:02,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:02,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:02,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:02,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-30 16:08:02,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:02,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:02,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:02,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:02,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:02,852 INFO L87 Difference]: Start difference. First operand 505 states and 800 transitions. Second operand 3 states. [2018-12-30 16:08:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:03,632 INFO L93 Difference]: Finished difference Result 1068 states and 1696 transitions. [2018-12-30 16:08:03,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:03,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-30 16:08:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:03,639 INFO L225 Difference]: With dead ends: 1068 [2018-12-30 16:08:03,639 INFO L226 Difference]: Without dead ends: 570 [2018-12-30 16:08:03,640 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,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-12-30 16:08:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2018-12-30 16:08:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-12-30 16:08:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 897 transitions. [2018-12-30 16:08:03,660 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 897 transitions. Word has length 56 [2018-12-30 16:08:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:03,660 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 897 transitions. [2018-12-30 16:08:03,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 897 transitions. [2018-12-30 16:08:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-30 16:08:03,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:03,662 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, 1, 1, 1, 1, 1] [2018-12-30 16:08:03,662 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:03,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1041214451, now seen corresponding path program 1 times [2018-12-30 16:08:03,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:03,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:03,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:03,758 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:03,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:03,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:03,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:03,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:03,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:03,760 INFO L87 Difference]: Start difference. First operand 568 states and 897 transitions. Second operand 3 states. [2018-12-30 16:08:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:04,130 INFO L93 Difference]: Finished difference Result 1178 states and 1858 transitions. [2018-12-30 16:08:04,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:04,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-12-30 16:08:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:04,137 INFO L225 Difference]: With dead ends: 1178 [2018-12-30 16:08:04,138 INFO L226 Difference]: Without dead ends: 617 [2018-12-30 16:08:04,139 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,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-12-30 16:08:04,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2018-12-30 16:08:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-12-30 16:08:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 961 transitions. [2018-12-30 16:08:04,165 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 961 transitions. Word has length 78 [2018-12-30 16:08:04,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:04,165 INFO L480 AbstractCegarLoop]: Abstraction has 611 states and 961 transitions. [2018-12-30 16:08:04,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 961 transitions. [2018-12-30 16:08:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-30 16:08:04,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:04,169 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, 1, 1, 1, 1, 1] [2018-12-30 16:08:04,169 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:04,169 INFO L82 PathProgramCache]: Analyzing trace with hash 45471174, now seen corresponding path program 1 times [2018-12-30 16:08:04,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:04,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:04,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:04,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:04,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:04,259 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:04,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:04,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:04,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:04,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:04,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:04,261 INFO L87 Difference]: Start difference. First operand 611 states and 961 transitions. Second operand 3 states. [2018-12-30 16:08:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:04,538 INFO L93 Difference]: Finished difference Result 1221 states and 1919 transitions. [2018-12-30 16:08:04,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:04,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-12-30 16:08:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:04,544 INFO L225 Difference]: With dead ends: 1221 [2018-12-30 16:08:04,544 INFO L226 Difference]: Without dead ends: 617 [2018-12-30 16:08:04,546 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,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-12-30 16:08:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2018-12-30 16:08:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-12-30 16:08:04,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 958 transitions. [2018-12-30 16:08:04,578 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 958 transitions. Word has length 79 [2018-12-30 16:08:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:04,579 INFO L480 AbstractCegarLoop]: Abstraction has 611 states and 958 transitions. [2018-12-30 16:08:04,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:04,579 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 958 transitions. [2018-12-30 16:08:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:08:04,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:04,583 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:04,584 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:04,584 INFO L82 PathProgramCache]: Analyzing trace with hash -998330754, now seen corresponding path program 1 times [2018-12-30 16:08:04,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:04,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:04,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:04,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:04,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-30 16:08:04,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:04,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:04,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:04,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:04,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:04,684 INFO L87 Difference]: Start difference. First operand 611 states and 958 transitions. Second operand 3 states. [2018-12-30 16:08:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:05,079 INFO L93 Difference]: Finished difference Result 1217 states and 1907 transitions. [2018-12-30 16:08:05,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:05,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:08:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:05,084 INFO L225 Difference]: With dead ends: 1217 [2018-12-30 16:08:05,084 INFO L226 Difference]: Without dead ends: 613 [2018-12-30 16:08:05,085 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,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-12-30 16:08:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2018-12-30 16:08:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-12-30 16:08:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 953 transitions. [2018-12-30 16:08:05,105 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 953 transitions. Word has length 84 [2018-12-30 16:08:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:05,106 INFO L480 AbstractCegarLoop]: Abstraction has 611 states and 953 transitions. [2018-12-30 16:08:05,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 953 transitions. [2018-12-30 16:08:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-30 16:08:05,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:05,107 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:05,108 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash -92645170, now seen corresponding path program 1 times [2018-12-30 16:08:05,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:05,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:05,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:05,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:05,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-30 16:08:05,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:05,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:05,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:05,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:05,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:05,196 INFO L87 Difference]: Start difference. First operand 611 states and 953 transitions. Second operand 3 states. [2018-12-30 16:08:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:05,418 INFO L93 Difference]: Finished difference Result 1275 states and 1990 transitions. [2018-12-30 16:08:05,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:05,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-30 16:08:05,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:05,423 INFO L225 Difference]: With dead ends: 1275 [2018-12-30 16:08:05,423 INFO L226 Difference]: Without dead ends: 671 [2018-12-30 16:08:05,425 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,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-12-30 16:08:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2018-12-30 16:08:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-12-30 16:08:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 996 transitions. [2018-12-30 16:08:05,447 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 996 transitions. Word has length 92 [2018-12-30 16:08:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:05,447 INFO L480 AbstractCegarLoop]: Abstraction has 643 states and 996 transitions. [2018-12-30 16:08:05,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 996 transitions. [2018-12-30 16:08:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-30 16:08:05,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:05,449 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, 1, 1, 1, 1, 1, 1, 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,449 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1567438302, now seen corresponding path program 1 times [2018-12-30 16:08:05,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:05,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:05,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:05,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:05,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-30 16:08:05,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:05,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:05,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:05,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:05,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:05,529 INFO L87 Difference]: Start difference. First operand 643 states and 996 transitions. Second operand 3 states. [2018-12-30 16:08:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:05,741 INFO L93 Difference]: Finished difference Result 1307 states and 2027 transitions. [2018-12-30 16:08:05,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:05,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-12-30 16:08:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:05,744 INFO L225 Difference]: With dead ends: 1307 [2018-12-30 16:08:05,744 INFO L226 Difference]: Without dead ends: 671 [2018-12-30 16:08:05,748 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,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-12-30 16:08:05,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2018-12-30 16:08:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-12-30 16:08:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 990 transitions. [2018-12-30 16:08:05,772 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 990 transitions. Word has length 93 [2018-12-30 16:08:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:05,772 INFO L480 AbstractCegarLoop]: Abstraction has 643 states and 990 transitions. [2018-12-30 16:08:05,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 990 transitions. [2018-12-30 16:08:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-30 16:08:05,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:05,775 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2018-12-30 16:08:05,775 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:05,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:05,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1415900119, now seen corresponding path program 1 times [2018-12-30 16:08:05,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:05,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:05,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:05,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:05,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-30 16:08:05,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:05,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:05,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:05,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:05,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:05,866 INFO L87 Difference]: Start difference. First operand 643 states and 990 transitions. Second operand 3 states. [2018-12-30 16:08:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:06,549 INFO L93 Difference]: Finished difference Result 1343 states and 2067 transitions. [2018-12-30 16:08:06,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:06,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-30 16:08:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:06,553 INFO L225 Difference]: With dead ends: 1343 [2018-12-30 16:08:06,553 INFO L226 Difference]: Without dead ends: 707 [2018-12-30 16:08:06,554 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,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-12-30 16:08:06,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 695. [2018-12-30 16:08:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-12-30 16:08:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1066 transitions. [2018-12-30 16:08:06,577 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1066 transitions. Word has length 99 [2018-12-30 16:08:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:06,577 INFO L480 AbstractCegarLoop]: Abstraction has 695 states and 1066 transitions. [2018-12-30 16:08:06,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1066 transitions. [2018-12-30 16:08:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-30 16:08:06,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:06,579 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2018-12-30 16:08:06,579 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:06,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:06,580 INFO L82 PathProgramCache]: Analyzing trace with hash 128670256, now seen corresponding path program 1 times [2018-12-30 16:08:06,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:06,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:06,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-30 16:08:06,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:06,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:06,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:06,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:06,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:06,660 INFO L87 Difference]: Start difference. First operand 695 states and 1066 transitions. Second operand 3 states. [2018-12-30 16:08:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:06,875 INFO L93 Difference]: Finished difference Result 1400 states and 2149 transitions. [2018-12-30 16:08:06,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:06,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-30 16:08:06,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:06,880 INFO L225 Difference]: With dead ends: 1400 [2018-12-30 16:08:06,881 INFO L226 Difference]: Without dead ends: 708 [2018-12-30 16:08:06,882 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,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-12-30 16:08:06,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2018-12-30 16:08:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-12-30 16:08:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2018-12-30 16:08:06,907 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2018-12-30 16:08:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:06,907 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2018-12-30 16:08:06,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2018-12-30 16:08:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-30 16:08:06,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:06,911 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:06,911 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:06,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1243086285, now seen corresponding path program 1 times [2018-12-30 16:08:06,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:06,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:06,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:06,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:06,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-30 16:08:07,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:07,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:07,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:07,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:07,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:07,018 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand 3 states. [2018-12-30 16:08:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:07,422 INFO L93 Difference]: Finished difference Result 1432 states and 2191 transitions. [2018-12-30 16:08:07,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:07,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-12-30 16:08:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:07,427 INFO L225 Difference]: With dead ends: 1432 [2018-12-30 16:08:07,428 INFO L226 Difference]: Without dead ends: 743 [2018-12-30 16:08:07,429 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,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-30 16:08:07,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2018-12-30 16:08:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-12-30 16:08:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1122 transitions. [2018-12-30 16:08:07,453 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1122 transitions. Word has length 111 [2018-12-30 16:08:07,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:07,453 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 1122 transitions. [2018-12-30 16:08:07,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1122 transitions. [2018-12-30 16:08:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-30 16:08:07,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:07,457 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-30 16:08:07,457 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:07,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2098703404, now seen corresponding path program 1 times [2018-12-30 16:08:07,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:07,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:07,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:07,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:07,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-30 16:08:07,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:07,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:07,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:07,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:07,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:07,539 INFO L87 Difference]: Start difference. First operand 737 states and 1122 transitions. Second operand 3 states. [2018-12-30 16:08:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:07,716 INFO L93 Difference]: Finished difference Result 1473 states and 2241 transitions. [2018-12-30 16:08:07,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:07,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-12-30 16:08:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:07,722 INFO L225 Difference]: With dead ends: 1473 [2018-12-30 16:08:07,722 INFO L226 Difference]: Without dead ends: 743 [2018-12-30 16:08:07,723 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,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-30 16:08:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2018-12-30 16:08:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-12-30 16:08:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1117 transitions. [2018-12-30 16:08:07,746 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1117 transitions. Word has length 112 [2018-12-30 16:08:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:07,746 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 1117 transitions. [2018-12-30 16:08:07,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1117 transitions. [2018-12-30 16:08:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-30 16:08:07,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:07,751 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-30 16:08:07,751 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash -742521014, now seen corresponding path program 1 times [2018-12-30 16:08:07,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:07,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:07,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:07,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:07,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-30 16:08:07,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:07,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:07,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:07,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:07,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:07,845 INFO L87 Difference]: Start difference. First operand 737 states and 1117 transitions. Second operand 3 states. [2018-12-30 16:08:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:08,591 INFO L93 Difference]: Finished difference Result 1509 states and 2284 transitions. [2018-12-30 16:08:08,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:08,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-12-30 16:08:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:08,597 INFO L225 Difference]: With dead ends: 1509 [2018-12-30 16:08:08,597 INFO L226 Difference]: Without dead ends: 779 [2018-12-30 16:08:08,598 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,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-12-30 16:08:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2018-12-30 16:08:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-12-30 16:08:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1155 transitions. [2018-12-30 16:08:08,629 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1155 transitions. Word has length 114 [2018-12-30 16:08:08,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:08,630 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1155 transitions. [2018-12-30 16:08:08,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1155 transitions. [2018-12-30 16:08:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-30 16:08:08,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:08,635 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-30 16:08:08,635 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:08,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:08,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1633130946, now seen corresponding path program 1 times [2018-12-30 16:08:08,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:08,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:08,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:08,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-30 16:08:08,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:08,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:08,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:08,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:08,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:08,745 INFO L87 Difference]: Start difference. First operand 769 states and 1155 transitions. Second operand 3 states. [2018-12-30 16:08:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:09,528 INFO L93 Difference]: Finished difference Result 1541 states and 2313 transitions. [2018-12-30 16:08:09,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:09,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-12-30 16:08:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:09,533 INFO L225 Difference]: With dead ends: 1541 [2018-12-30 16:08:09,533 INFO L226 Difference]: Without dead ends: 779 [2018-12-30 16:08:09,534 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,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-12-30 16:08:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2018-12-30 16:08:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-12-30 16:08:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1146 transitions. [2018-12-30 16:08:09,558 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1146 transitions. Word has length 115 [2018-12-30 16:08:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:09,558 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1146 transitions. [2018-12-30 16:08:09,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1146 transitions. [2018-12-30 16:08:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-30 16:08:09,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:09,562 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1] [2018-12-30 16:08:09,562 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:09,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:09,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1432440334, now seen corresponding path program 1 times [2018-12-30 16:08:09,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:09,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-12-30 16:08:09,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:09,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:09,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:09,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:09,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:09,619 INFO L87 Difference]: Start difference. First operand 769 states and 1146 transitions. Second operand 3 states. [2018-12-30 16:08:09,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:09,806 INFO L93 Difference]: Finished difference Result 1567 states and 2334 transitions. [2018-12-30 16:08:09,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:09,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-12-30 16:08:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:09,813 INFO L225 Difference]: With dead ends: 1567 [2018-12-30 16:08:09,813 INFO L226 Difference]: Without dead ends: 805 [2018-12-30 16:08:09,815 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,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-12-30 16:08:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2018-12-30 16:08:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-12-30 16:08:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1177 transitions. [2018-12-30 16:08:09,841 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1177 transitions. Word has length 136 [2018-12-30 16:08:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:09,841 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1177 transitions. [2018-12-30 16:08:09,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1177 transitions. [2018-12-30 16:08:09,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-30 16:08:09,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:09,846 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1] [2018-12-30 16:08:09,846 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:09,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:09,846 INFO L82 PathProgramCache]: Analyzing trace with hash 700393094, now seen corresponding path program 1 times [2018-12-30 16:08:09,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:09,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:09,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:09,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-12-30 16:08:09,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:09,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:09,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:09,922 INFO L87 Difference]: Start difference. First operand 797 states and 1177 transitions. Second operand 3 states. [2018-12-30 16:08:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:10,097 INFO L93 Difference]: Finished difference Result 1595 states and 2355 transitions. [2018-12-30 16:08:10,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:10,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-12-30 16:08:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:10,106 INFO L225 Difference]: With dead ends: 1595 [2018-12-30 16:08:10,106 INFO L226 Difference]: Without dead ends: 805 [2018-12-30 16:08:10,107 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,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-12-30 16:08:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2018-12-30 16:08:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-12-30 16:08:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1167 transitions. [2018-12-30 16:08:10,132 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1167 transitions. Word has length 137 [2018-12-30 16:08:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:10,132 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1167 transitions. [2018-12-30 16:08:10,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1167 transitions. [2018-12-30 16:08:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-30 16:08:10,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:10,134 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,136 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:10,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:10,136 INFO L82 PathProgramCache]: Analyzing trace with hash 26936470, now seen corresponding path program 1 times [2018-12-30 16:08:10,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:10,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:10,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-30 16:08:10,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:10,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:10,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:10,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:10,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:10,201 INFO L87 Difference]: Start difference. First operand 797 states and 1167 transitions. Second operand 3 states. [2018-12-30 16:08:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:10,374 INFO L93 Difference]: Finished difference Result 1650 states and 2409 transitions. [2018-12-30 16:08:10,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:10,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-12-30 16:08:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:10,380 INFO L225 Difference]: With dead ends: 1650 [2018-12-30 16:08:10,380 INFO L226 Difference]: Without dead ends: 860 [2018-12-30 16:08:10,381 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,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-12-30 16:08:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 846. [2018-12-30 16:08:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2018-12-30 16:08:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1228 transitions. [2018-12-30 16:08:10,401 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1228 transitions. Word has length 140 [2018-12-30 16:08:10,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:10,401 INFO L480 AbstractCegarLoop]: Abstraction has 846 states and 1228 transitions. [2018-12-30 16:08:10,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1228 transitions. [2018-12-30 16:08:10,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-30 16:08:10,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:10,403 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:10,404 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:10,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1329151537, now seen corresponding path program 1 times [2018-12-30 16:08:10,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:10,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:10,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:10,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:10,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-30 16:08:10,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:10,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:10,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:10,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:10,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:10,496 INFO L87 Difference]: Start difference. First operand 846 states and 1228 transitions. Second operand 3 states. [2018-12-30 16:08:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:11,361 INFO L93 Difference]: Finished difference Result 1699 states and 2467 transitions. [2018-12-30 16:08:11,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:11,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2018-12-30 16:08:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:11,367 INFO L225 Difference]: With dead ends: 1699 [2018-12-30 16:08:11,367 INFO L226 Difference]: Without dead ends: 844 [2018-12-30 16:08:11,369 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,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-12-30 16:08:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 830. [2018-12-30 16:08:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-12-30 16:08:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1205 transitions. [2018-12-30 16:08:11,395 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1205 transitions. Word has length 141 [2018-12-30 16:08:11,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:11,396 INFO L480 AbstractCegarLoop]: Abstraction has 830 states and 1205 transitions. [2018-12-30 16:08:11,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1205 transitions. [2018-12-30 16:08:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-30 16:08:11,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:11,399 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-30 16:08:11,400 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:11,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1387042847, now seen corresponding path program 1 times [2018-12-30 16:08:11,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:11,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:11,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:11,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-30 16:08:11,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:11,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:11,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:11,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:11,489 INFO L87 Difference]: Start difference. First operand 830 states and 1205 transitions. Second operand 3 states. [2018-12-30 16:08:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:11,681 INFO L93 Difference]: Finished difference Result 1665 states and 2417 transitions. [2018-12-30 16:08:11,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:11,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2018-12-30 16:08:11,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:11,685 INFO L225 Difference]: With dead ends: 1665 [2018-12-30 16:08:11,686 INFO L226 Difference]: Without dead ends: 842 [2018-12-30 16:08:11,687 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,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-12-30 16:08:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 830. [2018-12-30 16:08:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-12-30 16:08:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2018-12-30 16:08:11,729 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 145 [2018-12-30 16:08:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:11,730 INFO L480 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2018-12-30 16:08:11,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2018-12-30 16:08:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-30 16:08:11,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:11,733 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-30 16:08:11,733 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:11,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:11,733 INFO L82 PathProgramCache]: Analyzing trace with hash 146712776, now seen corresponding path program 1 times [2018-12-30 16:08:11,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:11,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-30 16:08:11,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:11,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:11,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:11,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:11,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:11,813 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 3 states. [2018-12-30 16:08:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:11,976 INFO L93 Difference]: Finished difference Result 1665 states and 2403 transitions. [2018-12-30 16:08:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:11,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-12-30 16:08:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:11,980 INFO L225 Difference]: With dead ends: 1665 [2018-12-30 16:08:11,981 INFO L226 Difference]: Without dead ends: 825 [2018-12-30 16:08:11,982 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,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2018-12-30 16:08:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 813. [2018-12-30 16:08:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2018-12-30 16:08:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1169 transitions. [2018-12-30 16:08:12,004 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1169 transitions. Word has length 146 [2018-12-30 16:08:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:12,005 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 1169 transitions. [2018-12-30 16:08:12,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1169 transitions. [2018-12-30 16:08:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-30 16:08:12,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:12,006 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:12,006 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:12,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:12,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1643771369, now seen corresponding path program 1 times [2018-12-30 16:08:12,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:12,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:12,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:12,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:12,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-30 16:08:12,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:12,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:12,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:12,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:12,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:12,101 INFO L87 Difference]: Start difference. First operand 813 states and 1169 transitions. Second operand 3 states. [2018-12-30 16:08:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:12,244 INFO L93 Difference]: Finished difference Result 2411 states and 3459 transitions. [2018-12-30 16:08:12,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:12,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2018-12-30 16:08:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:12,254 INFO L225 Difference]: With dead ends: 2411 [2018-12-30 16:08:12,254 INFO L226 Difference]: Without dead ends: 1605 [2018-12-30 16:08:12,257 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,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2018-12-30 16:08:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 815. [2018-12-30 16:08:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-12-30 16:08:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1171 transitions. [2018-12-30 16:08:12,303 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1171 transitions. Word has length 153 [2018-12-30 16:08:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:12,303 INFO L480 AbstractCegarLoop]: Abstraction has 815 states and 1171 transitions. [2018-12-30 16:08:12,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1171 transitions. [2018-12-30 16:08:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-30 16:08:12,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:12,308 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:12,308 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:12,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1697255769, now seen corresponding path program 1 times [2018-12-30 16:08:12,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:12,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:12,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-30 16:08:12,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:12,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:12,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:12,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:12,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:12,399 INFO L87 Difference]: Start difference. First operand 815 states and 1171 transitions. Second operand 3 states. [2018-12-30 16:08:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:12,627 INFO L93 Difference]: Finished difference Result 2410 states and 3455 transitions. [2018-12-30 16:08:12,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:12,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2018-12-30 16:08:12,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:12,636 INFO L225 Difference]: With dead ends: 2410 [2018-12-30 16:08:12,637 INFO L226 Difference]: Without dead ends: 1602 [2018-12-30 16:08:12,639 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,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2018-12-30 16:08:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1600. [2018-12-30 16:08:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-12-30 16:08:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2291 transitions. [2018-12-30 16:08:12,720 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2291 transitions. Word has length 153 [2018-12-30 16:08:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:12,720 INFO L480 AbstractCegarLoop]: Abstraction has 1600 states and 2291 transitions. [2018-12-30 16:08:12,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2291 transitions. [2018-12-30 16:08:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-30 16:08:12,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:12,722 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:12,722 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1707419253, now seen corresponding path program 1 times [2018-12-30 16:08:12,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:12,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:12,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:12,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:12,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:12,936 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-12-30 16:08:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-30 16:08:12,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:12,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:12,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:12,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:12,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:12,953 INFO L87 Difference]: Start difference. First operand 1600 states and 2291 transitions. Second operand 3 states. [2018-12-30 16:08:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:13,193 INFO L93 Difference]: Finished difference Result 4746 states and 6779 transitions. [2018-12-30 16:08:13,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:13,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2018-12-30 16:08:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:13,211 INFO L225 Difference]: With dead ends: 4746 [2018-12-30 16:08:13,211 INFO L226 Difference]: Without dead ends: 3153 [2018-12-30 16:08:13,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2018-12-30 16:08:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 1600. [2018-12-30 16:08:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-12-30 16:08:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2287 transitions. [2018-12-30 16:08:13,330 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2287 transitions. Word has length 155 [2018-12-30 16:08:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:13,330 INFO L480 AbstractCegarLoop]: Abstraction has 1600 states and 2287 transitions. [2018-12-30 16:08:13,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2287 transitions. [2018-12-30 16:08:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-30 16:08:13,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:13,332 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:13,332 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:13,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:13,337 INFO L82 PathProgramCache]: Analyzing trace with hash 306587411, now seen corresponding path program 1 times [2018-12-30 16:08:13,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:13,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:13,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:13,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:13,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-30 16:08:13,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:13,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:13,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:13,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:13,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:13,442 INFO L87 Difference]: Start difference. First operand 1600 states and 2287 transitions. Second operand 3 states. [2018-12-30 16:08:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:14,508 INFO L93 Difference]: Finished difference Result 4786 states and 6839 transitions. [2018-12-30 16:08:14,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:14,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2018-12-30 16:08:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:14,533 INFO L225 Difference]: With dead ends: 4786 [2018-12-30 16:08:14,534 INFO L226 Difference]: Without dead ends: 3193 [2018-12-30 16:08:14,536 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:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2018-12-30 16:08:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3191. [2018-12-30 16:08:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3191 states. [2018-12-30 16:08:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4487 transitions. [2018-12-30 16:08:14,703 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4487 transitions. Word has length 156 [2018-12-30 16:08:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:14,704 INFO L480 AbstractCegarLoop]: Abstraction has 3191 states and 4487 transitions. [2018-12-30 16:08:14,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4487 transitions. [2018-12-30 16:08:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-30 16:08:14,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:14,706 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:14,706 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:14,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1260527569, now seen corresponding path program 1 times [2018-12-30 16:08:14,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:14,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:14,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:14,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:14,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:08:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:08:14,828 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 16:08:14,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:08:14 BoogieIcfgContainer [2018-12-30 16:08:14,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:08:14,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:08:14,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:08:14,919 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:08:14,921 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:54" (3/4) ... [2018-12-30 16:08:14,924 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-30 16:08:15,067 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:08:15,069 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:08:15,070 INFO L168 Benchmark]: Toolchain (without parser) took 23113.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.6 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -267.4 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:15,070 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:08:15,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 594.50 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:15,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 190.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:15,075 INFO L168 Benchmark]: Boogie Preprocessor took 70.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:08:15,075 INFO L168 Benchmark]: RCFGBuilder took 1492.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:15,075 INFO L168 Benchmark]: TraceAbstraction took 20610.09 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -217.1 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:15,075 INFO L168 Benchmark]: Witness Printer took 149.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:15,081 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 594.50 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 190.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1492.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20610.09 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -217.1 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Witness Printer took 149.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 698]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L703] int s ; [L704] int tmp ; [L708] s = 8464 [L13] int s__info_callback = __VERIFIER_nondet_int() ; [L14] int s__in_handshake = __VERIFIER_nondet_int() ; [L15] int s__state ; [L16] int s__new_session ; [L17] int s__server ; [L18] int s__version = __VERIFIER_nondet_int() ; [L19] int s__type ; [L20] int s__init_num ; [L21] int s__hit = __VERIFIER_nondet_int() ; [L22] int s__rwstate ; [L23] int s__init_buf___0 ; [L24] int s__debug = __VERIFIER_nondet_int() ; [L25] int s__shutdown ; [L26] int s__cert = __VERIFIER_nondet_int() ; [L27] int s__options = __VERIFIER_nondet_int() ; [L28] int s__verify_mode = __VERIFIER_nondet_int() ; [L29] int s__session__peer = __VERIFIER_nondet_int() ; [L30] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L31] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__cert_request ; [L36] int s__s3__tmp__reuse_message ; [L37] int s__s3__tmp__use_rsa_tmp ; [L38] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher__algorithms ; [L40] int s__s3__tmp__next_state___0 ; [L41] int s__s3__tmp__new_cipher__algo_strength ; [L42] int s__session__cipher ; [L43] int buf ; [L44] unsigned long l ; [L45] unsigned long Time ; [L46] unsigned long tmp ; [L47] int cb ; [L48] long num1 = __VERIFIER_nondet_long() ; [L49] int ret ; [L50] int new_state ; [L51] int state ; [L52] int skip ; [L53] int got_new_session ; [L54] int tmp___1 = __VERIFIER_nondet_int() ; [L55] int tmp___2 = __VERIFIER_nondet_int() ; [L56] int tmp___3 = __VERIFIER_nondet_int() ; [L57] int tmp___4 = __VERIFIER_nondet_int() ; [L58] int tmp___5 = __VERIFIER_nondet_int() ; [L59] int tmp___6 = __VERIFIER_nondet_int() ; [L60] int tmp___7 ; [L61] long tmp___8 = __VERIFIER_nondet_long() ; [L62] int tmp___9 = __VERIFIER_nondet_int() ; [L63] int tmp___10 = __VERIFIER_nondet_int() ; [L64] int blastFlag ; [L65] int __cil_tmp55 ; [L66] unsigned long __cil_tmp56 ; [L67] unsigned long __cil_tmp57 ; [L68] unsigned long __cil_tmp58 ; [L69] unsigned long __cil_tmp59 ; [L70] int __cil_tmp60 ; [L71] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L75] s__state = initial_state [L76] blastFlag = 0 [L77] tmp = __VERIFIER_nondet_int() [L78] Time = tmp [L79] cb = 0 [L80] ret = -1 [L81] skip = 0 [L82] got_new_session = 0 [L83] COND TRUE s__info_callback != 0 [L84] cb = s__info_callback [L90] s__in_handshake ++ [L91] COND FALSE !(tmp___1 + 12288) [L96] COND FALSE !(s__cert == 0) [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND TRUE s__state == 8464 [L273] s__shutdown = 0 [L274] ret = __VERIFIER_nondet_int() [L275] COND TRUE blastFlag == 0 [L276] blastFlag = 1 [L278] COND FALSE !(ret <= 0) [L281] got_new_session = 1 [L282] s__state = 8496 [L283] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND TRUE s__state == 8496 [L287] ret = __VERIFIER_nondet_int() [L288] COND TRUE blastFlag == 1 [L289] blastFlag = 2 [L291] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 8512 [L299] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND TRUE s__state == 8512 [L304] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L305] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L306] COND TRUE __cil_tmp56 + 256UL [L307] __cil_tmp56 = 256345 [L308] skip = 1 [L319] s__state = 8528 [L320] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND TRUE s__state == 8528 [L324] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L325] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L327] __cil_tmp57 = (unsigned long )s__options [L328] COND TRUE __cil_tmp57 + 2097152UL [L329] s__s3__tmp__use_rsa_tmp = 1 [L334] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L362] ret = __VERIFIER_nondet_int() [L363] COND FALSE !(blastFlag == 3) [L366] COND FALSE !(ret <= 0) [L383] s__state = 8544 [L384] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND TRUE s__state == 8544 [L388] COND TRUE s__verify_mode + 1 [L389] COND TRUE s__session__peer != 0 [L390] COND TRUE s__verify_mode + 4 [L391] s__verify_mode = 123 [L392] skip = 1 [L393] s__s3__tmp__cert_request = 0 [L394] s__state = 8560 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND FALSE !(s__state == 8544) [L157] COND FALSE !(s__state == 8545) [L160] COND TRUE s__state == 8560 [L438] ret = __VERIFIER_nondet_int() [L439] COND FALSE !(ret <= 0) [L442] s__s3__tmp__next_state___0 = 8576 [L443] s__state = 8448 [L444] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND TRUE ! s__s3__tmp__reuse_message [L654] COND TRUE ! skip [L655] COND TRUE state == 8560 [L656] COND TRUE s__state == 8448 [L657] COND TRUE s__verify_mode != -1 [L658] COND TRUE s__verify_mode != -2 [L659] COND TRUE __cil_tmp61 != 9021 [L660] COND TRUE __cil_tmp58 != 4294967294 [L661] COND TRUE blastFlag != 4 [L662] COND TRUE tmp___7 != 1024 [L698] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 168 locations, 1 error locations. UNSAFE Result, 20.5s OverallTime, 35 OverallIterations, 6 TraceHistogramMax, 15.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7083 SDtfs, 6887 SDslu, 1778 SDs, 0 SdLazy, 2873 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3191occurred in iteration=34, 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: 1.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 3181 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2991 ConstructedInterpolants, 0 QuantifiedInterpolants, 567746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...