./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 678e0110
Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.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 5377418547a5706dafa6030007433e8164dafce8
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE
--- Real Ultimate output ---
This is Ultimate 0.1.24-678e011
[2019-11-19 20:51:33,881 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-11-19 20:51:33,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-11-19 20:51:33,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-11-19 20:51:33,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-11-19 20:51:33,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-11-19 20:51:33,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-11-19 20:51:33,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-11-19 20:51:33,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-11-19 20:51:33,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-11-19 20:51:33,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-11-19 20:51:33,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-11-19 20:51:33,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-11-19 20:51:33,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-11-19 20:51:33,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-11-19 20:51:33,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-11-19 20:51:33,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-11-19 20:51:33,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-11-19 20:51:33,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-11-19 20:51:33,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-11-19 20:51:33,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-11-19 20:51:33,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-11-19 20:51:33,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-11-19 20:51:33,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-11-19 20:51:33,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-11-19 20:51:33,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-11-19 20:51:33,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-11-19 20:51:33,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-11-19 20:51:33,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-11-19 20:51:33,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-11-19 20:51:33,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-11-19 20:51:33,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-11-19 20:51:33,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-11-19 20:51:33,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-11-19 20:51:33,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-11-19 20:51:33,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-11-19 20:51:33,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-11-19 20:51:33,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-11-19 20:51:33,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-11-19 20:51:33,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-11-19 20:51:33,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-11-19 20:51:33,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2019-11-19 20:51:33,957 INFO L113 SettingsManager]: Loading preferences was successful
[2019-11-19 20:51:33,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-11-19 20:51:33,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-11-19 20:51:33,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-11-19 20:51:33,962 INFO L138 SettingsManager]: * Use SBE=true
[2019-11-19 20:51:33,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-11-19 20:51:33,962 INFO L138 SettingsManager]: * sizeof long=4
[2019-11-19 20:51:33,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-11-19 20:51:33,962 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-11-19 20:51:33,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-11-19 20:51:33,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-11-19 20:51:33,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-11-19 20:51:33,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-11-19 20:51:33,964 INFO L138 SettingsManager]: * sizeof long double=12
[2019-11-19 20:51:33,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-11-19 20:51:33,964 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-11-19 20:51:33,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-11-19 20:51:33,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-11-19 20:51:33,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-11-19 20:51:33,966 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-11-19 20:51:33,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-11-19 20:51:33,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-19 20:51:33,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-11-19 20:51:33,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-11-19 20:51:33,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-11-19 20:51:33,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-11-19 20:51:33,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-11-19 20:51:33,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-11-19 20:51:33,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
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 -> 5377418547a5706dafa6030007433e8164dafce8
[2019-11-19 20:51:34,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-11-19 20:51:34,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-11-19 20:51:34,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-11-19 20:51:34,268 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-11-19 20:51:34,269 INFO L275 PluginConnector]: CDTParser initialized
[2019-11-19 20:51:34,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c
[2019-11-19 20:51:34,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1537c74/552fe66f4dcc4b6384291606bbb0df24/FLAG42de65276
[2019-11-19 20:51:34,810 INFO L306 CDTParser]: Found 1 translation units.
[2019-11-19 20:51:34,811 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c
[2019-11-19 20:51:34,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1537c74/552fe66f4dcc4b6384291606bbb0df24/FLAG42de65276
[2019-11-19 20:51:35,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1537c74/552fe66f4dcc4b6384291606bbb0df24
[2019-11-19 20:51:35,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-11-19 20:51:35,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2019-11-19 20:51:35,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-11-19 20:51:35,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-11-19 20:51:35,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-11-19 20:51:35,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:35" (1/1) ...
[2019-11-19 20:51:35,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4957fc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35, skipping insertion in model container
[2019-11-19 20:51:35,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:35" (1/1) ...
[2019-11-19 20:51:35,167 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-11-19 20:51:35,213 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-11-19 20:51:35,438 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-11-19 20:51:35,442 INFO L188 MainTranslator]: Completed pre-run
[2019-11-19 20:51:35,561 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-11-19 20:51:35,580 INFO L192 MainTranslator]: Completed translation
[2019-11-19 20:51:35,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35 WrapperNode
[2019-11-19 20:51:35,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-11-19 20:51:35,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-11-19 20:51:35,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-11-19 20:51:35,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2019-11-19 20:51:35,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35" (1/1) ...
[2019-11-19 20:51:35,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35" (1/1) ...
[2019-11-19 20:51:35,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-11-19 20:51:35,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-11-19 20:51:35,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-11-19 20:51:35,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-11-19 20:51:35,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35" (1/1) ...
[2019-11-19 20:51:35,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35" (1/1) ...
[2019-11-19 20:51:35,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35" (1/1) ...
[2019-11-19 20:51:35,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35" (1/1) ...
[2019-11-19 20:51:35,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35" (1/1) ...
[2019-11-19 20:51:35,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35" (1/1) ...
[2019-11-19 20:51:35,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35" (1/1) ...
[2019-11-19 20:51:35,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-11-19 20:51:35,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-11-19 20:51:35,677 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-11-19 20:51:35,677 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-11-19 20:51:35,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-19 20:51:35,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-11-19 20:51:35,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-11-19 20:51:35,850 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2019-11-19 20:51:36,427 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false;
[2019-11-19 20:51:36,428 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false;
[2019-11-19 20:51:36,430 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-11-19 20:51:36,431 INFO L285 CfgBuilder]: Removed 7 assume(true) statements.
[2019-11-19 20:51:36,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:36 BoogieIcfgContainer
[2019-11-19 20:51:36,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-11-19 20:51:36,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-11-19 20:51:36,437 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-11-19 20:51:36,440 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-11-19 20:51:36,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:51:35" (1/3) ...
[2019-11-19 20:51:36,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6135b99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:36, skipping insertion in model container
[2019-11-19 20:51:36,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:35" (2/3) ...
[2019-11-19 20:51:36,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6135b99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:36, skipping insertion in model container
[2019-11-19 20:51:36,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:36" (3/3) ...
[2019-11-19 20:51:36,445 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c
[2019-11-19 20:51:36,455 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-11-19 20:51:36,463 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-11-19 20:51:36,474 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-11-19 20:51:36,512 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-11-19 20:51:36,513 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-11-19 20:51:36,513 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-11-19 20:51:36,513 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-11-19 20:51:36,513 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-11-19 20:51:36,513 INFO L378 AbstractCegarLoop]: Difference is false
[2019-11-19 20:51:36,514 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-11-19 20:51:36,514 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-11-19 20:51:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states.
[2019-11-19 20:51:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2019-11-19 20:51:36,539 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:36,540 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:36,540 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:36,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:36,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times
[2019-11-19 20:51:36,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:36,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986121330]
[2019-11-19 20:51:36,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:36,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986121330]
[2019-11-19 20:51:36,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:36,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:36,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267633290]
[2019-11-19 20:51:36,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:36,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:36,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:36,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:36,744 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states.
[2019-11-19 20:51:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:36,980 INFO L93 Difference]: Finished difference Result 243 states and 418 transitions.
[2019-11-19 20:51:36,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:36,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2019-11-19 20:51:36,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:37,000 INFO L225 Difference]: With dead ends: 243
[2019-11-19 20:51:37,000 INFO L226 Difference]: Without dead ends: 111
[2019-11-19 20:51:37,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states.
[2019-11-19 20:51:37,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111.
[2019-11-19 20:51:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states.
[2019-11-19 20:51:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions.
[2019-11-19 20:51:37,063 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23
[2019-11-19 20:51:37,063 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:37,063 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions.
[2019-11-19 20:51:37,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions.
[2019-11-19 20:51:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2019-11-19 20:51:37,066 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:37,066 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:37,066 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:37,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:37,067 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times
[2019-11-19 20:51:37,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:37,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429194225]
[2019-11-19 20:51:37,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:37,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429194225]
[2019-11-19 20:51:37,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:37,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:37,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033712782]
[2019-11-19 20:51:37,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:37,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:37,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:37,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:37,163 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states.
[2019-11-19 20:51:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:37,347 INFO L93 Difference]: Finished difference Result 231 states and 353 transitions.
[2019-11-19 20:51:37,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:37,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35
[2019-11-19 20:51:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:37,350 INFO L225 Difference]: With dead ends: 231
[2019-11-19 20:51:37,350 INFO L226 Difference]: Without dead ends: 129
[2019-11-19 20:51:37,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2019-11-19 20:51:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126.
[2019-11-19 20:51:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states.
[2019-11-19 20:51:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions.
[2019-11-19 20:51:37,368 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35
[2019-11-19 20:51:37,368 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:37,368 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions.
[2019-11-19 20:51:37,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions.
[2019-11-19 20:51:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2019-11-19 20:51:37,371 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:37,372 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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]
[2019-11-19 20:51:37,372 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:37,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:37,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1382730084, now seen corresponding path program 1 times
[2019-11-19 20:51:37,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:37,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654166296]
[2019-11-19 20:51:37,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2019-11-19 20:51:37,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654166296]
[2019-11-19 20:51:37,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:37,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:37,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699579451]
[2019-11-19 20:51:37,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:37,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:37,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:37,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:37,492 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states.
[2019-11-19 20:51:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:37,659 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions.
[2019-11-19 20:51:37,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:37,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49
[2019-11-19 20:51:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:37,666 INFO L225 Difference]: With dead ends: 265
[2019-11-19 20:51:37,667 INFO L226 Difference]: Without dead ends: 148
[2019-11-19 20:51:37,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states.
[2019-11-19 20:51:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143.
[2019-11-19 20:51:37,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states.
[2019-11-19 20:51:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions.
[2019-11-19 20:51:37,696 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49
[2019-11-19 20:51:37,697 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:37,697 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions.
[2019-11-19 20:51:37,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:37,698 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions.
[2019-11-19 20:51:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2019-11-19 20:51:37,702 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:37,703 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:37,704 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:37,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1259053610, now seen corresponding path program 1 times
[2019-11-19 20:51:37,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:37,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563154624]
[2019-11-19 20:51:37,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2019-11-19 20:51:37,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563154624]
[2019-11-19 20:51:37,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:37,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:37,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281896794]
[2019-11-19 20:51:37,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:37,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:37,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:37,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:37,847 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states.
[2019-11-19 20:51:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:38,031 INFO L93 Difference]: Finished difference Result 327 states and 495 transitions.
[2019-11-19 20:51:38,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:38,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66
[2019-11-19 20:51:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:38,034 INFO L225 Difference]: With dead ends: 327
[2019-11-19 20:51:38,034 INFO L226 Difference]: Without dead ends: 192
[2019-11-19 20:51:38,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states.
[2019-11-19 20:51:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184.
[2019-11-19 20:51:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states.
[2019-11-19 20:51:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 260 transitions.
[2019-11-19 20:51:38,047 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 260 transitions. Word has length 66
[2019-11-19 20:51:38,047 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:38,048 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 260 transitions.
[2019-11-19 20:51:38,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 260 transitions.
[2019-11-19 20:51:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2019-11-19 20:51:38,050 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:38,050 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:38,050 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:38,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:38,051 INFO L82 PathProgramCache]: Analyzing trace with hash -546384724, now seen corresponding path program 1 times
[2019-11-19 20:51:38,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:38,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025095041]
[2019-11-19 20:51:38,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2019-11-19 20:51:38,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025095041]
[2019-11-19 20:51:38,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:38,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:38,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478979609]
[2019-11-19 20:51:38,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:38,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:38,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:38,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:38,119 INFO L87 Difference]: Start difference. First operand 184 states and 260 transitions. Second operand 3 states.
[2019-11-19 20:51:38,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:38,252 INFO L93 Difference]: Finished difference Result 382 states and 547 transitions.
[2019-11-19 20:51:38,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:38,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66
[2019-11-19 20:51:38,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:38,255 INFO L225 Difference]: With dead ends: 382
[2019-11-19 20:51:38,255 INFO L226 Difference]: Without dead ends: 207
[2019-11-19 20:51:38,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states.
[2019-11-19 20:51:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203.
[2019-11-19 20:51:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states.
[2019-11-19 20:51:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions.
[2019-11-19 20:51:38,266 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 66
[2019-11-19 20:51:38,267 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:38,267 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions.
[2019-11-19 20:51:38,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions.
[2019-11-19 20:51:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2019-11-19 20:51:38,273 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:38,273 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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]
[2019-11-19 20:51:38,273 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:38,274 INFO L82 PathProgramCache]: Analyzing trace with hash 819829122, now seen corresponding path program 1 times
[2019-11-19 20:51:38,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:38,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857761014]
[2019-11-19 20:51:38,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2019-11-19 20:51:38,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857761014]
[2019-11-19 20:51:38,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:38,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:38,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948180060]
[2019-11-19 20:51:38,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:38,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:38,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:38,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:38,343 INFO L87 Difference]: Start difference. First operand 203 states and 284 transitions. Second operand 3 states.
[2019-11-19 20:51:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:38,474 INFO L93 Difference]: Finished difference Result 421 states and 597 transitions.
[2019-11-19 20:51:38,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:38,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82
[2019-11-19 20:51:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:38,476 INFO L225 Difference]: With dead ends: 421
[2019-11-19 20:51:38,477 INFO L226 Difference]: Without dead ends: 227
[2019-11-19 20:51:38,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states.
[2019-11-19 20:51:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224.
[2019-11-19 20:51:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states.
[2019-11-19 20:51:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 310 transitions.
[2019-11-19 20:51:38,485 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 310 transitions. Word has length 82
[2019-11-19 20:51:38,486 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:38,486 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 310 transitions.
[2019-11-19 20:51:38,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 310 transitions.
[2019-11-19 20:51:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2019-11-19 20:51:38,487 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:38,488 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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]
[2019-11-19 20:51:38,488 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:38,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:38,488 INFO L82 PathProgramCache]: Analyzing trace with hash 426015802, now seen corresponding path program 1 times
[2019-11-19 20:51:38,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:38,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710947072]
[2019-11-19 20:51:38,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2019-11-19 20:51:38,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710947072]
[2019-11-19 20:51:38,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:38,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:38,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767446624]
[2019-11-19 20:51:38,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:38,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:38,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:38,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:38,580 INFO L87 Difference]: Start difference. First operand 224 states and 310 transitions. Second operand 3 states.
[2019-11-19 20:51:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:38,621 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions.
[2019-11-19 20:51:38,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:38,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102
[2019-11-19 20:51:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:38,626 INFO L225 Difference]: With dead ends: 652
[2019-11-19 20:51:38,626 INFO L226 Difference]: Without dead ends: 437
[2019-11-19 20:51:38,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states.
[2019-11-19 20:51:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437.
[2019-11-19 20:51:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states.
[2019-11-19 20:51:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 603 transitions.
[2019-11-19 20:51:38,644 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 603 transitions. Word has length 102
[2019-11-19 20:51:38,645 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:38,645 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 603 transitions.
[2019-11-19 20:51:38,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 603 transitions.
[2019-11-19 20:51:38,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2019-11-19 20:51:38,647 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:38,647 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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]
[2019-11-19 20:51:38,648 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:38,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:38,648 INFO L82 PathProgramCache]: Analyzing trace with hash -527041180, now seen corresponding path program 1 times
[2019-11-19 20:51:38,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:38,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622203719]
[2019-11-19 20:51:38,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked.
[2019-11-19 20:51:38,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622203719]
[2019-11-19 20:51:38,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:38,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:38,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936842877]
[2019-11-19 20:51:38,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:38,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:38,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:38,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:38,746 INFO L87 Difference]: Start difference. First operand 437 states and 603 transitions. Second operand 3 states.
[2019-11-19 20:51:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:38,799 INFO L93 Difference]: Finished difference Result 652 states and 900 transitions.
[2019-11-19 20:51:38,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:38,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104
[2019-11-19 20:51:38,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:38,805 INFO L225 Difference]: With dead ends: 652
[2019-11-19 20:51:38,805 INFO L226 Difference]: Without dead ends: 650
[2019-11-19 20:51:38,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states.
[2019-11-19 20:51:38,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650.
[2019-11-19 20:51:38,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states.
[2019-11-19 20:51:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 898 transitions.
[2019-11-19 20:51:38,830 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 898 transitions. Word has length 104
[2019-11-19 20:51:38,831 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:38,831 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 898 transitions.
[2019-11-19 20:51:38,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 898 transitions.
[2019-11-19 20:51:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2019-11-19 20:51:38,834 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:38,834 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 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]
[2019-11-19 20:51:38,835 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:38,835 INFO L82 PathProgramCache]: Analyzing trace with hash -892474837, now seen corresponding path program 1 times
[2019-11-19 20:51:38,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:38,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336605567]
[2019-11-19 20:51:38,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2019-11-19 20:51:38,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336605567]
[2019-11-19 20:51:38,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:38,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:38,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330010114]
[2019-11-19 20:51:38,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:38,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:38,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:38,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:38,944 INFO L87 Difference]: Start difference. First operand 650 states and 898 transitions. Second operand 3 states.
[2019-11-19 20:51:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:39,108 INFO L93 Difference]: Finished difference Result 1441 states and 2047 transitions.
[2019-11-19 20:51:39,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:39,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158
[2019-11-19 20:51:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:39,113 INFO L225 Difference]: With dead ends: 1441
[2019-11-19 20:51:39,113 INFO L226 Difference]: Without dead ends: 797
[2019-11-19 20:51:39,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states.
[2019-11-19 20:51:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 767.
[2019-11-19 20:51:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states.
[2019-11-19 20:51:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1087 transitions.
[2019-11-19 20:51:39,135 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1087 transitions. Word has length 158
[2019-11-19 20:51:39,135 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:39,135 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1087 transitions.
[2019-11-19 20:51:39,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1087 transitions.
[2019-11-19 20:51:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2019-11-19 20:51:39,139 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:39,139 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 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]
[2019-11-19 20:51:39,139 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:39,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1787424402, now seen corresponding path program 1 times
[2019-11-19 20:51:39,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:39,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322713443]
[2019-11-19 20:51:39,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2019-11-19 20:51:39,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322713443]
[2019-11-19 20:51:39,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:39,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:39,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874664363]
[2019-11-19 20:51:39,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:39,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:39,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:39,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:39,195 INFO L87 Difference]: Start difference. First operand 767 states and 1087 transitions. Second operand 3 states.
[2019-11-19 20:51:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:39,359 INFO L93 Difference]: Finished difference Result 1803 states and 2628 transitions.
[2019-11-19 20:51:39,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:39,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184
[2019-11-19 20:51:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:39,365 INFO L225 Difference]: With dead ends: 1803
[2019-11-19 20:51:39,365 INFO L226 Difference]: Without dead ends: 994
[2019-11-19 20:51:39,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states.
[2019-11-19 20:51:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 956.
[2019-11-19 20:51:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states.
[2019-11-19 20:51:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1339 transitions.
[2019-11-19 20:51:39,394 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1339 transitions. Word has length 184
[2019-11-19 20:51:39,394 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:39,394 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 1339 transitions.
[2019-11-19 20:51:39,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1339 transitions.
[2019-11-19 20:51:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2019-11-19 20:51:39,398 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:39,398 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:39,399 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:39,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash 78119093, now seen corresponding path program 1 times
[2019-11-19 20:51:39,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:39,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461249967]
[2019-11-19 20:51:39,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked.
[2019-11-19 20:51:39,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461249967]
[2019-11-19 20:51:39,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:39,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:39,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894713635]
[2019-11-19 20:51:39,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:39,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:39,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:39,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:39,470 INFO L87 Difference]: Start difference. First operand 956 states and 1339 transitions. Second operand 3 states.
[2019-11-19 20:51:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:39,647 INFO L93 Difference]: Finished difference Result 2059 states and 2905 transitions.
[2019-11-19 20:51:39,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:39,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205
[2019-11-19 20:51:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:39,653 INFO L225 Difference]: With dead ends: 2059
[2019-11-19 20:51:39,653 INFO L226 Difference]: Without dead ends: 1067
[2019-11-19 20:51:39,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:39,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states.
[2019-11-19 20:51:39,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1031.
[2019-11-19 20:51:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states.
[2019-11-19 20:51:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1435 transitions.
[2019-11-19 20:51:39,682 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1435 transitions. Word has length 205
[2019-11-19 20:51:39,682 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:39,682 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 1435 transitions.
[2019-11-19 20:51:39,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1435 transitions.
[2019-11-19 20:51:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2019-11-19 20:51:39,687 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:39,687 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1]
[2019-11-19 20:51:39,687 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:39,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:39,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2106820770, now seen corresponding path program 1 times
[2019-11-19 20:51:39,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:39,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15796782]
[2019-11-19 20:51:39,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked.
[2019-11-19 20:51:39,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15796782]
[2019-11-19 20:51:39,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:39,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:39,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427887719]
[2019-11-19 20:51:39,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:39,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:39,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:39,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:39,790 INFO L87 Difference]: Start difference. First operand 1031 states and 1435 transitions. Second operand 3 states.
[2019-11-19 20:51:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:39,984 INFO L93 Difference]: Finished difference Result 2209 states and 3094 transitions.
[2019-11-19 20:51:39,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:39,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229
[2019-11-19 20:51:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:39,991 INFO L225 Difference]: With dead ends: 2209
[2019-11-19 20:51:39,991 INFO L226 Difference]: Without dead ends: 1148
[2019-11-19 20:51:39,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states.
[2019-11-19 20:51:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1115.
[2019-11-19 20:51:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states.
[2019-11-19 20:51:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1546 transitions.
[2019-11-19 20:51:40,055 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1546 transitions. Word has length 229
[2019-11-19 20:51:40,055 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:40,055 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 1546 transitions.
[2019-11-19 20:51:40,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1546 transitions.
[2019-11-19 20:51:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2019-11-19 20:51:40,061 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:40,061 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1]
[2019-11-19 20:51:40,062 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:40,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:40,062 INFO L82 PathProgramCache]: Analyzing trace with hash 73426724, now seen corresponding path program 1 times
[2019-11-19 20:51:40,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:40,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503624557]
[2019-11-19 20:51:40,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked.
[2019-11-19 20:51:40,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503624557]
[2019-11-19 20:51:40,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:40,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:40,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927435208]
[2019-11-19 20:51:40,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:40,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:40,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:40,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:40,140 INFO L87 Difference]: Start difference. First operand 1115 states and 1546 transitions. Second operand 3 states.
[2019-11-19 20:51:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:40,306 INFO L93 Difference]: Finished difference Result 2377 states and 3319 transitions.
[2019-11-19 20:51:40,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:40,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229
[2019-11-19 20:51:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:40,313 INFO L225 Difference]: With dead ends: 2377
[2019-11-19 20:51:40,313 INFO L226 Difference]: Without dead ends: 1244
[2019-11-19 20:51:40,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states.
[2019-11-19 20:51:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1208.
[2019-11-19 20:51:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states.
[2019-11-19 20:51:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1678 transitions.
[2019-11-19 20:51:40,350 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1678 transitions. Word has length 229
[2019-11-19 20:51:40,350 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:40,350 INFO L462 AbstractCegarLoop]: Abstraction has 1208 states and 1678 transitions.
[2019-11-19 20:51:40,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1678 transitions.
[2019-11-19 20:51:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260
[2019-11-19 20:51:40,355 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:40,355 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:40,356 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:40,356 INFO L82 PathProgramCache]: Analyzing trace with hash 837799332, now seen corresponding path program 1 times
[2019-11-19 20:51:40,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:40,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967437518]
[2019-11-19 20:51:40,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked.
[2019-11-19 20:51:40,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967437518]
[2019-11-19 20:51:40,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:40,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:40,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875393109]
[2019-11-19 20:51:40,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:40,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:40,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:40,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:40,438 INFO L87 Difference]: Start difference. First operand 1208 states and 1678 transitions. Second operand 3 states.
[2019-11-19 20:51:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:40,608 INFO L93 Difference]: Finished difference Result 2560 states and 3577 transitions.
[2019-11-19 20:51:40,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:40,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259
[2019-11-19 20:51:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:40,616 INFO L225 Difference]: With dead ends: 2560
[2019-11-19 20:51:40,617 INFO L226 Difference]: Without dead ends: 1346
[2019-11-19 20:51:40,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states.
[2019-11-19 20:51:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1313.
[2019-11-19 20:51:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states.
[2019-11-19 20:51:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1834 transitions.
[2019-11-19 20:51:40,653 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1834 transitions. Word has length 259
[2019-11-19 20:51:40,653 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:40,653 INFO L462 AbstractCegarLoop]: Abstraction has 1313 states and 1834 transitions.
[2019-11-19 20:51:40,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1834 transitions.
[2019-11-19 20:51:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295
[2019-11-19 20:51:40,659 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:40,659 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:40,659 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash 298818312, now seen corresponding path program 1 times
[2019-11-19 20:51:40,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:40,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520717094]
[2019-11-19 20:51:40,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1167 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked.
[2019-11-19 20:51:40,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520717094]
[2019-11-19 20:51:40,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:40,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:40,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637515822]
[2019-11-19 20:51:40,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:40,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:40,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:40,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:40,757 INFO L87 Difference]: Start difference. First operand 1313 states and 1834 transitions. Second operand 3 states.
[2019-11-19 20:51:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:40,939 INFO L93 Difference]: Finished difference Result 2656 states and 3703 transitions.
[2019-11-19 20:51:40,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:40,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294
[2019-11-19 20:51:40,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:40,946 INFO L225 Difference]: With dead ends: 2656
[2019-11-19 20:51:40,947 INFO L226 Difference]: Without dead ends: 1343
[2019-11-19 20:51:40,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:40,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states.
[2019-11-19 20:51:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1310.
[2019-11-19 20:51:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states.
[2019-11-19 20:51:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1816 transitions.
[2019-11-19 20:51:40,992 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1816 transitions. Word has length 294
[2019-11-19 20:51:40,993 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:40,993 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1816 transitions.
[2019-11-19 20:51:40,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1816 transitions.
[2019-11-19 20:51:41,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305
[2019-11-19 20:51:41,001 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:41,001 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:41,002 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:41,002 INFO L82 PathProgramCache]: Analyzing trace with hash 430194802, now seen corresponding path program 1 times
[2019-11-19 20:51:41,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:41,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881336212]
[2019-11-19 20:51:41,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked.
[2019-11-19 20:51:41,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881336212]
[2019-11-19 20:51:41,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:41,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:41,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181735724]
[2019-11-19 20:51:41,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:41,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:41,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:41,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:41,219 INFO L87 Difference]: Start difference. First operand 1310 states and 1816 transitions. Second operand 3 states.
[2019-11-19 20:51:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:41,413 INFO L93 Difference]: Finished difference Result 2638 states and 3652 transitions.
[2019-11-19 20:51:41,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:41,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304
[2019-11-19 20:51:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:41,420 INFO L225 Difference]: With dead ends: 2638
[2019-11-19 20:51:41,420 INFO L226 Difference]: Without dead ends: 1337
[2019-11-19 20:51:41,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states.
[2019-11-19 20:51:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1310.
[2019-11-19 20:51:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states.
[2019-11-19 20:51:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1789 transitions.
[2019-11-19 20:51:41,461 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1789 transitions. Word has length 304
[2019-11-19 20:51:41,462 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:41,462 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1789 transitions.
[2019-11-19 20:51:41,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1789 transitions.
[2019-11-19 20:51:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332
[2019-11-19 20:51:41,468 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:41,469 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1]
[2019-11-19 20:51:41,469 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:41,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:41,470 INFO L82 PathProgramCache]: Analyzing trace with hash 863432469, now seen corresponding path program 1 times
[2019-11-19 20:51:41,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:41,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383261429]
[2019-11-19 20:51:41,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 729 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked.
[2019-11-19 20:51:41,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383261429]
[2019-11-19 20:51:41,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:41,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:41,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424840371]
[2019-11-19 20:51:41,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:41,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:41,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:41,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:41,587 INFO L87 Difference]: Start difference. First operand 1310 states and 1789 transitions. Second operand 3 states.
[2019-11-19 20:51:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:41,741 INFO L93 Difference]: Finished difference Result 2761 states and 3742 transitions.
[2019-11-19 20:51:41,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:41,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331
[2019-11-19 20:51:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:41,748 INFO L225 Difference]: With dead ends: 2761
[2019-11-19 20:51:41,748 INFO L226 Difference]: Without dead ends: 1460
[2019-11-19 20:51:41,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states.
[2019-11-19 20:51:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1355.
[2019-11-19 20:51:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states.
[2019-11-19 20:51:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1849 transitions.
[2019-11-19 20:51:41,787 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1849 transitions. Word has length 331
[2019-11-19 20:51:41,788 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:41,788 INFO L462 AbstractCegarLoop]: Abstraction has 1355 states and 1849 transitions.
[2019-11-19 20:51:41,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1849 transitions.
[2019-11-19 20:51:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333
[2019-11-19 20:51:41,794 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:41,795 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:41,795 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:41,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:41,795 INFO L82 PathProgramCache]: Analyzing trace with hash 762439870, now seen corresponding path program 1 times
[2019-11-19 20:51:41,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:41,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442422540]
[2019-11-19 20:51:41,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 869 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked.
[2019-11-19 20:51:42,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442422540]
[2019-11-19 20:51:42,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:42,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:42,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152159087]
[2019-11-19 20:51:42,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:42,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:42,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:42,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:42,015 INFO L87 Difference]: Start difference. First operand 1355 states and 1849 transitions. Second operand 3 states.
[2019-11-19 20:51:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:42,084 INFO L93 Difference]: Finished difference Result 3852 states and 5281 transitions.
[2019-11-19 20:51:42,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:42,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332
[2019-11-19 20:51:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:42,122 INFO L225 Difference]: With dead ends: 3852
[2019-11-19 20:51:42,122 INFO L226 Difference]: Without dead ends: 2506
[2019-11-19 20:51:42,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states.
[2019-11-19 20:51:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504.
[2019-11-19 20:51:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states.
[2019-11-19 20:51:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3435 transitions.
[2019-11-19 20:51:42,220 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3435 transitions. Word has length 332
[2019-11-19 20:51:42,221 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:42,221 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3435 transitions.
[2019-11-19 20:51:42,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3435 transitions.
[2019-11-19 20:51:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343
[2019-11-19 20:51:42,235 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:42,236 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:42,236 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:42,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1156712834, now seen corresponding path program 1 times
[2019-11-19 20:51:42,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:42,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514719091]
[2019-11-19 20:51:42,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked.
[2019-11-19 20:51:42,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514719091]
[2019-11-19 20:51:42,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962938795]
[2019-11-19 20:51:42,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:42,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjunts are in the unsatisfiable core
[2019-11-19 20:51:42,677 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2019-11-19 20:51:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked.
[2019-11-19 20:51:42,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-11-19 20:51:42,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2019-11-19 20:51:42,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35655961]
[2019-11-19 20:51:42,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:42,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:42,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:42,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:42,959 INFO L87 Difference]: Start difference. First operand 2504 states and 3435 transitions. Second operand 3 states.
[2019-11-19 20:51:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:43,037 INFO L93 Difference]: Finished difference Result 5826 states and 7988 transitions.
[2019-11-19 20:51:43,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:43,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342
[2019-11-19 20:51:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:43,053 INFO L225 Difference]: With dead ends: 5826
[2019-11-19 20:51:43,054 INFO L226 Difference]: Without dead ends: 3331
[2019-11-19 20:51:43,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:43,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states.
[2019-11-19 20:51:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3331.
[2019-11-19 20:51:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states.
[2019-11-19 20:51:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4560 transitions.
[2019-11-19 20:51:43,159 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4560 transitions. Word has length 342
[2019-11-19 20:51:43,160 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:43,160 INFO L462 AbstractCegarLoop]: Abstraction has 3331 states and 4560 transitions.
[2019-11-19 20:51:43,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4560 transitions.
[2019-11-19 20:51:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345
[2019-11-19 20:51:43,169 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:43,170 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:43,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:43,376 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:43,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:43,377 INFO L82 PathProgramCache]: Analyzing trace with hash 938688742, now seen corresponding path program 1 times
[2019-11-19 20:51:43,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:43,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726683998]
[2019-11-19 20:51:43,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked.
[2019-11-19 20:51:43,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726683998]
[2019-11-19 20:51:43,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332616384]
[2019-11-19 20:51:43,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:43,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-19 20:51:43,827 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2019-11-19 20:51:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked.
[2019-11-19 20:51:43,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-11-19 20:51:43,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4
[2019-11-19 20:51:43,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767088386]
[2019-11-19 20:51:43,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-19 20:51:43,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:43,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-19 20:51:43,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-19 20:51:43,926 INFO L87 Difference]: Start difference. First operand 3331 states and 4560 transitions. Second operand 4 states.
[2019-11-19 20:51:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:44,302 INFO L93 Difference]: Finished difference Result 6603 states and 9028 transitions.
[2019-11-19 20:51:44,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-11-19 20:51:44,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344
[2019-11-19 20:51:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:44,327 INFO L225 Difference]: With dead ends: 6603
[2019-11-19 20:51:44,327 INFO L226 Difference]: Without dead ends: 4983
[2019-11-19 20:51:44,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4983 states.
[2019-11-19 20:51:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4983 to 3683.
[2019-11-19 20:51:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states.
[2019-11-19 20:51:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4980 transitions.
[2019-11-19 20:51:44,462 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4980 transitions. Word has length 344
[2019-11-19 20:51:44,462 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:44,463 INFO L462 AbstractCegarLoop]: Abstraction has 3683 states and 4980 transitions.
[2019-11-19 20:51:44,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-19 20:51:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4980 transitions.
[2019-11-19 20:51:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371
[2019-11-19 20:51:44,472 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:44,473 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1]
[2019-11-19 20:51:44,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:44,678 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:44,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:44,679 INFO L82 PathProgramCache]: Analyzing trace with hash 741254605, now seen corresponding path program 1 times
[2019-11-19 20:51:44,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:44,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730456849]
[2019-11-19 20:51:44,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked.
[2019-11-19 20:51:44,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730456849]
[2019-11-19 20:51:44,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860043868]
[2019-11-19 20:51:44,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:45,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-19 20:51:45,103 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2019-11-19 20:51:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked.
[2019-11-19 20:51:45,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-11-19 20:51:45,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4
[2019-11-19 20:51:45,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333181791]
[2019-11-19 20:51:45,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-19 20:51:45,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:45,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-19 20:51:45,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-19 20:51:45,303 INFO L87 Difference]: Start difference. First operand 3683 states and 4980 transitions. Second operand 4 states.
[2019-11-19 20:51:45,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:45,767 INFO L93 Difference]: Finished difference Result 8481 states and 11469 transitions.
[2019-11-19 20:51:45,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-11-19 20:51:45,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370
[2019-11-19 20:51:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:45,817 INFO L225 Difference]: With dead ends: 8481
[2019-11-19 20:51:45,817 INFO L226 Difference]: Without dead ends: 4798
[2019-11-19 20:51:45,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4798 states.
[2019-11-19 20:51:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4798 to 3841.
[2019-11-19 20:51:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states.
[2019-11-19 20:51:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5140 transitions.
[2019-11-19 20:51:46,005 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5140 transitions. Word has length 370
[2019-11-19 20:51:46,005 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:46,005 INFO L462 AbstractCegarLoop]: Abstraction has 3841 states and 5140 transitions.
[2019-11-19 20:51:46,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-19 20:51:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5140 transitions.
[2019-11-19 20:51:46,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410
[2019-11-19 20:51:46,025 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:46,025 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:46,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:46,230 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:46,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:46,231 INFO L82 PathProgramCache]: Analyzing trace with hash 232077189, now seen corresponding path program 1 times
[2019-11-19 20:51:46,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:46,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359111977]
[2019-11-19 20:51:46,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked.
[2019-11-19 20:51:46,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359111977]
[2019-11-19 20:51:46,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:46,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:46,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26973721]
[2019-11-19 20:51:46,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:46,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:46,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:46,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,449 INFO L87 Difference]: Start difference. First operand 3841 states and 5140 transitions. Second operand 3 states.
[2019-11-19 20:51:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:46,636 INFO L93 Difference]: Finished difference Result 7373 states and 9714 transitions.
[2019-11-19 20:51:46,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:46,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409
[2019-11-19 20:51:46,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:46,645 INFO L225 Difference]: With dead ends: 7373
[2019-11-19 20:51:46,646 INFO L226 Difference]: Without dead ends: 1985
[2019-11-19 20:51:46,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states.
[2019-11-19 20:51:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1893.
[2019-11-19 20:51:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states.
[2019-11-19 20:51:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2533 transitions.
[2019-11-19 20:51:46,724 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2533 transitions. Word has length 409
[2019-11-19 20:51:46,724 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:46,725 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 2533 transitions.
[2019-11-19 20:51:46,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2533 transitions.
[2019-11-19 20:51:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494
[2019-11-19 20:51:46,745 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:46,746 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:46,746 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:46,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:46,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1256651121, now seen corresponding path program 1 times
[2019-11-19 20:51:46,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:46,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701485786]
[2019-11-19 20:51:46,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 1545 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked.
[2019-11-19 20:51:47,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701485786]
[2019-11-19 20:51:47,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843167488]
[2019-11-19 20:51:47,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:47,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core
[2019-11-19 20:51:47,428 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2019-11-19 20:51:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2338 trivial. 0 not checked.
[2019-11-19 20:51:47,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-11-19 20:51:47,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2019-11-19 20:51:47,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932298046]
[2019-11-19 20:51:47,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:47,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:47,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:47,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:47,779 INFO L87 Difference]: Start difference. First operand 1893 states and 2533 transitions. Second operand 3 states.
[2019-11-19 20:51:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:48,042 INFO L93 Difference]: Finished difference Result 3956 states and 5317 transitions.
[2019-11-19 20:51:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:48,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493
[2019-11-19 20:51:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:48,049 INFO L225 Difference]: With dead ends: 3956
[2019-11-19 20:51:48,049 INFO L226 Difference]: Without dead ends: 1991
[2019-11-19 20:51:48,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states.
[2019-11-19 20:51:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1987.
[2019-11-19 20:51:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states.
[2019-11-19 20:51:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2576 transitions.
[2019-11-19 20:51:48,127 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2576 transitions. Word has length 493
[2019-11-19 20:51:48,128 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:48,128 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2576 transitions.
[2019-11-19 20:51:48,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2576 transitions.
[2019-11-19 20:51:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494
[2019-11-19 20:51:48,149 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:48,150 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:48,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:48,357 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:48,357 INFO L82 PathProgramCache]: Analyzing trace with hash 709390269, now seen corresponding path program 1 times
[2019-11-19 20:51:48,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:48,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994088693]
[2019-11-19 20:51:48,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked.
[2019-11-19 20:51:48,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994088693]
[2019-11-19 20:51:48,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000788633]
[2019-11-19 20:51:48,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:48,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-19 20:51:48,706 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2019-11-19 20:51:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked.
[2019-11-19 20:51:49,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-11-19 20:51:49,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2019-11-19 20:51:49,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085875908]
[2019-11-19 20:51:49,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:49,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:49,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:49,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:49,005 INFO L87 Difference]: Start difference. First operand 1987 states and 2576 transitions. Second operand 3 states.
[2019-11-19 20:51:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:49,030 INFO L93 Difference]: Finished difference Result 2038 states and 2641 transitions.
[2019-11-19 20:51:49,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:49,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493
[2019-11-19 20:51:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:49,034 INFO L225 Difference]: With dead ends: 2038
[2019-11-19 20:51:49,034 INFO L226 Difference]: Without dead ends: 1835
[2019-11-19 20:51:49,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:49,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states.
[2019-11-19 20:51:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1786.
[2019-11-19 20:51:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states.
[2019-11-19 20:51:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2314 transitions.
[2019-11-19 20:51:49,073 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2314 transitions. Word has length 493
[2019-11-19 20:51:49,073 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:49,074 INFO L462 AbstractCegarLoop]: Abstraction has 1786 states and 2314 transitions.
[2019-11-19 20:51:49,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2314 transitions.
[2019-11-19 20:51:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604
[2019-11-19 20:51:49,079 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:49,080 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 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, 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]
[2019-11-19 20:51:49,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:49,287 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:49,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:49,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1730430293, now seen corresponding path program 2 times
[2019-11-19 20:51:49,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:49,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088368184]
[2019-11-19 20:51:49,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked.
[2019-11-19 20:51:49,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088368184]
[2019-11-19 20:51:49,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687280629]
[2019-11-19 20:51:49,578 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:49,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2019-11-19 20:51:49,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat
[2019-11-19 20:51:49,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-19 20:51:49,744 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2019-11-19 20:51:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked.
[2019-11-19 20:51:50,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-11-19 20:51:50,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4
[2019-11-19 20:51:50,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82651875]
[2019-11-19 20:51:50,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-19 20:51:50,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:50,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-19 20:51:50,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-19 20:51:50,026 INFO L87 Difference]: Start difference. First operand 1786 states and 2314 transitions. Second operand 4 states.
[2019-11-19 20:51:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:50,176 INFO L93 Difference]: Finished difference Result 2046 states and 2645 transitions.
[2019-11-19 20:51:50,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-11-19 20:51:50,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603
[2019-11-19 20:51:50,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:50,177 INFO L225 Difference]: With dead ends: 2046
[2019-11-19 20:51:50,177 INFO L226 Difference]: Without dead ends: 0
[2019-11-19 20:51:50,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-11-19 20:51:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-11-19 20:51:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-11-19 20:51:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-11-19 20:51:50,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603
[2019-11-19 20:51:50,181 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:50,181 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-11-19 20:51:50,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-19 20:51:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-11-19 20:51:50,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-11-19 20:51:50,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:50,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-11-19 20:51:50,900 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 103
[2019-11-19 20:51:51,122 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30
[2019-11-19 20:51:51,581 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27
[2019-11-19 20:51:51,839 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7
[2019-11-19 20:51:52,652 WARN L191 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62
[2019-11-19 20:51:52,736 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed.
[2019-11-19 20:51:52,736 INFO L444 ceAbstractionStarter]: For program point L366-2(lines 366 370) no Hoare annotation was computed.
[2019-11-19 20:51:52,736 INFO L444 ceAbstractionStarter]: For program point L565(lines 565 593) no Hoare annotation was computed.
[2019-11-19 20:51:52,736 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 540) no Hoare annotation was computed.
[2019-11-19 20:51:52,737 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 551) no Hoare annotation was computed.
[2019-11-19 20:51:52,737 INFO L444 ceAbstractionStarter]: For program point L103(lines 103 562) no Hoare annotation was computed.
[2019-11-19 20:51:52,737 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 590) no Hoare annotation was computed.
[2019-11-19 20:51:52,737 INFO L444 ceAbstractionStarter]: For program point L500-1(lines 198 528) no Hoare annotation was computed.
[2019-11-19 20:51:52,737 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 340) no Hoare annotation was computed.
[2019-11-19 20:51:52,738 INFO L444 ceAbstractionStarter]: For program point L302-1(lines 302 316) no Hoare annotation was computed.
[2019-11-19 20:51:52,740 INFO L440 ceAbstractionStarter]: At program point L203(lines 100 563) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))
[2019-11-19 20:51:52,740 INFO L440 ceAbstractionStarter]: At program point L170(lines 166 541) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3)))
[2019-11-19 20:51:52,741 INFO L444 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed.
[2019-11-19 20:51:52,741 INFO L444 ceAbstractionStarter]: For program point L567(lines 567 576) no Hoare annotation was computed.
[2019-11-19 20:51:52,741 INFO L444 ceAbstractionStarter]: For program point L600-2(lines 600 604) no Hoare annotation was computed.
[2019-11-19 20:51:52,741 INFO L444 ceAbstractionStarter]: For program point L567-2(lines 566 588) no Hoare annotation was computed.
[2019-11-19 20:51:52,741 INFO L444 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed.
[2019-11-19 20:51:52,741 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 539) no Hoare annotation was computed.
[2019-11-19 20:51:52,741 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 550) no Hoare annotation was computed.
[2019-11-19 20:51:52,741 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 561) no Hoare annotation was computed.
[2019-11-19 20:51:52,741 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 573) no Hoare annotation was computed.
[2019-11-19 20:51:52,741 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 442) no Hoare annotation was computed.
[2019-11-19 20:51:52,742 INFO L440 ceAbstractionStarter]: At program point L140(lines 136 551) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse0 .cse1 .cse2)))
[2019-11-19 20:51:52,742 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed.
[2019-11-19 20:51:52,742 INFO L444 ceAbstractionStarter]: For program point L471(lines 471 475) no Hoare annotation was computed.
[2019-11-19 20:51:52,742 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed.
[2019-11-19 20:51:52,742 INFO L444 ceAbstractionStarter]: For program point L306-2(lines 304 316) no Hoare annotation was computed.
[2019-11-19 20:51:52,742 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 505 509) no Hoare annotation was computed.
[2019-11-19 20:51:52,742 INFO L444 ceAbstractionStarter]: For program point L406(lines 406 410) no Hoare annotation was computed.
[2019-11-19 20:51:52,742 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed.
[2019-11-19 20:51:52,742 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 538) no Hoare annotation was computed.
[2019-11-19 20:51:52,743 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 549) no Hoare annotation was computed.
[2019-11-19 20:51:52,743 INFO L444 ceAbstractionStarter]: For program point L208-2(lines 198 528) no Hoare annotation was computed.
[2019-11-19 20:51:52,746 INFO L444 ceAbstractionStarter]: For program point L109(lines 109 560) no Hoare annotation was computed.
[2019-11-19 20:51:52,746 INFO L440 ceAbstractionStarter]: At program point L176(lines 172 539) the Hoare annotation is: (let ((.cse5 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and .cse4 (and .cse0 .cse5)) (and .cse0 .cse5 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))))
[2019-11-19 20:51:52,746 INFO L444 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed.
[2019-11-19 20:51:52,747 INFO L444 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed.
[2019-11-19 20:51:52,747 INFO L447 ceAbstractionStarter]: At program point L607(lines 7 609) the Hoare annotation is: true
[2019-11-19 20:51:52,747 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 249) no Hoare annotation was computed.
[2019-11-19 20:51:52,747 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 537) no Hoare annotation was computed.
[2019-11-19 20:51:52,747 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 548) no Hoare annotation was computed.
[2019-11-19 20:51:52,747 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 559) no Hoare annotation was computed.
[2019-11-19 20:51:52,748 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed.
[2019-11-19 20:51:52,749 INFO L444 ceAbstractionStarter]: For program point L476-2(lines 476 480) no Hoare annotation was computed.
[2019-11-19 20:51:52,749 INFO L440 ceAbstractionStarter]: At program point L146(lines 142 549) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2)))
[2019-11-19 20:51:52,751 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 382) no Hoare annotation was computed.
[2019-11-19 20:51:52,751 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed.
[2019-11-19 20:51:52,751 INFO L444 ceAbstractionStarter]: For program point L279(lines 279 287) no Hoare annotation was computed.
[2019-11-19 20:51:52,752 INFO L440 ceAbstractionStarter]: At program point L346(lines 60 608) the Hoare annotation is: false
[2019-11-19 20:51:52,752 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 536) no Hoare annotation was computed.
[2019-11-19 20:51:52,752 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 547) no Hoare annotation was computed.
[2019-11-19 20:51:52,752 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 558) no Hoare annotation was computed.
[2019-11-19 20:51:52,752 INFO L444 ceAbstractionStarter]: For program point L578(lines 578 584) no Hoare annotation was computed.
[2019-11-19 20:51:52,752 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed.
[2019-11-19 20:51:52,753 INFO L444 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed.
[2019-11-19 20:51:52,753 INFO L440 ceAbstractionStarter]: At program point L182(lines 178 537) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse3) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 .cse4) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))))
[2019-11-19 20:51:52,754 INFO L440 ceAbstractionStarter]: At program point L116(lines 112 559) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))
[2019-11-19 20:51:52,754 INFO L444 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed.
[2019-11-19 20:51:52,754 INFO L444 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed.
[2019-11-19 20:51:52,754 INFO L444 ceAbstractionStarter]: For program point L282-2(lines 198 528) no Hoare annotation was computed.
[2019-11-19 20:51:52,754 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed.
[2019-11-19 20:51:52,755 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 535) no Hoare annotation was computed.
[2019-11-19 20:51:52,755 INFO L444 ceAbstractionStarter]: For program point L151(lines 151 546) no Hoare annotation was computed.
[2019-11-19 20:51:52,755 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 557) no Hoare annotation was computed.
[2019-11-19 20:51:52,755 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed.
[2019-11-19 20:51:52,755 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 354) no Hoare annotation was computed.
[2019-11-19 20:51:52,756 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed.
[2019-11-19 20:51:52,756 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 484 496) no Hoare annotation was computed.
[2019-11-19 20:51:52,756 INFO L444 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed.
[2019-11-19 20:51:52,756 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 237) no Hoare annotation was computed.
[2019-11-19 20:51:52,756 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 534) no Hoare annotation was computed.
[2019-11-19 20:51:52,756 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 545) no Hoare annotation was computed.
[2019-11-19 20:51:52,757 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 198 528) no Hoare annotation was computed.
[2019-11-19 20:51:52,757 INFO L444 ceAbstractionStarter]: For program point L121(lines 121 556) no Hoare annotation was computed.
[2019-11-19 20:51:52,757 INFO L440 ceAbstractionStarter]: At program point L188(lines 184 535) the Hoare annotation is: (let ((.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 .cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse4) (and (not .cse3) .cse0 .cse1 .cse5)))
[2019-11-19 20:51:52,757 INFO L440 ceAbstractionStarter]: At program point L122(lines 118 557) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))
[2019-11-19 20:51:52,757 INFO L447 ceAbstractionStarter]: At program point L618(lines 610 620) the Hoare annotation is: true
[2019-11-19 20:51:52,758 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed.
[2019-11-19 20:51:52,758 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 227) no Hoare annotation was computed.
[2019-11-19 20:51:52,758 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 492) no Hoare annotation was computed.
[2019-11-19 20:51:52,758 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 465) no Hoare annotation was computed.
[2019-11-19 20:51:52,758 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 454 465) no Hoare annotation was computed.
[2019-11-19 20:51:52,759 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2019-11-19 20:51:52,759 INFO L444 ceAbstractionStarter]: For program point L190(lines 190 533) no Hoare annotation was computed.
[2019-11-19 20:51:52,759 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 544) no Hoare annotation was computed.
[2019-11-19 20:51:52,759 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 555) no Hoare annotation was computed.
[2019-11-19 20:51:52,759 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 393) no Hoare annotation was computed.
[2019-11-19 20:51:52,759 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed.
[2019-11-19 20:51:52,760 INFO L444 ceAbstractionStarter]: For program point L323-2(lines 198 528) no Hoare annotation was computed.
[2019-11-19 20:51:52,761 INFO L440 ceAbstractionStarter]: At program point L191(lines 190 533) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 (not .cse1) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse3) (and (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse2 .cse3 .cse4 .cse1 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse1 .cse5)))
[2019-11-19 20:51:52,763 INFO L440 ceAbstractionStarter]: At program point L158(lines 148 547) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2)))
[2019-11-19 20:51:52,763 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 462) no Hoare annotation was computed.
[2019-11-19 20:51:52,763 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 262) no Hoare annotation was computed.
[2019-11-19 20:51:52,763 INFO L444 ceAbstractionStarter]: For program point L258-2(lines 198 528) no Hoare annotation was computed.
[2019-11-19 20:51:52,763 INFO L444 ceAbstractionStarter]: For program point L193(lines 193 532) no Hoare annotation was computed.
[2019-11-19 20:51:52,764 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 543) no Hoare annotation was computed.
[2019-11-19 20:51:52,764 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 554) no Hoare annotation was computed.
[2019-11-19 20:51:52,764 INFO L444 ceAbstractionStarter]: For program point L94-1(lines 60 608) no Hoare annotation was computed.
[2019-11-19 20:51:52,764 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2019-11-19 20:51:52,764 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed.
[2019-11-19 20:51:52,764 INFO L444 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed.
[2019-11-19 20:51:52,765 INFO L447 ceAbstractionStarter]: At program point L194(lines 193 532) the Hoare annotation is: true
[2019-11-19 20:51:52,765 INFO L440 ceAbstractionStarter]: At program point L128(lines 124 555) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))))
[2019-11-19 20:51:52,765 INFO L444 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed.
[2019-11-19 20:51:52,765 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed.
[2019-11-19 20:51:52,765 INFO L444 ceAbstractionStarter]: For program point L426-2(lines 198 528) no Hoare annotation was computed.
[2019-11-19 20:51:52,765 INFO L444 ceAbstractionStarter]: For program point L228(lines 228 233) no Hoare annotation was computed.
[2019-11-19 20:51:52,766 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed.
[2019-11-19 20:51:52,766 INFO L444 ceAbstractionStarter]: For program point L163(lines 163 542) no Hoare annotation was computed.
[2019-11-19 20:51:52,766 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 553) no Hoare annotation was computed.
[2019-11-19 20:51:52,766 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 564) no Hoare annotation was computed.
[2019-11-19 20:51:52,769 INFO L444 ceAbstractionStarter]: For program point L395(lines 395 400) no Hoare annotation was computed.
[2019-11-19 20:51:52,769 INFO L444 ceAbstractionStarter]: For program point L395-2(lines 395 400) no Hoare annotation was computed.
[2019-11-19 20:51:52,769 INFO L447 ceAbstractionStarter]: At program point L197(lines 196 531) the Hoare annotation is: true
[2019-11-19 20:51:52,770 INFO L440 ceAbstractionStarter]: At program point L164(lines 160 543) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2)))
[2019-11-19 20:51:52,770 INFO L440 ceAbstractionStarter]: At program point L98(lines 97 564) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0))
[2019-11-19 20:51:52,770 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed.
[2019-11-19 20:51:52,771 INFO L440 ceAbstractionStarter]: At program point L529(lines 94 595) the Hoare annotation is: (let ((.cse10 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse3 (not .cse10)) (.cse6 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse11 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse15 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse13 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse8 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse14 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse5 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse16 (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse2) (and .cse0 .cse1 .cse10) (and .cse6 .cse7 .cse0 .cse9 .cse2) (and .cse1 .cse8 .cse2) (and .cse3 .cse6 .cse7 .cse0) (and .cse11 .cse12 .cse0) (and .cse12 .cse13 .cse8 .cse10 .cse14) (and .cse8 .cse4 .cse5 .cse9 .cse10 .cse2) (and .cse8 .cse15 .cse13 .cse10 .cse2) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse0) (and .cse11 .cse12 .cse8 .cse10 .cse2) (and .cse0 .cse10 .cse15) (and .cse16 .cse13 .cse8 .cse10) (and .cse12 .cse0 .cse10 .cse14) (and .cse0 .cse4 .cse5 .cse9 .cse10 .cse2) (and .cse16 .cse0 .cse10))))
[2019-11-19 20:51:52,771 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 541) no Hoare annotation was computed.
[2019-11-19 20:51:52,771 INFO L444 ceAbstractionStarter]: For program point L133(lines 133 552) no Hoare annotation was computed.
[2019-11-19 20:51:52,772 INFO L444 ceAbstractionStarter]: For program point L100(lines 100 563) no Hoare annotation was computed.
[2019-11-19 20:51:52,772 INFO L447 ceAbstractionStarter]: At program point L596(lines 93 597) the Hoare annotation is: true
[2019-11-19 20:51:52,772 INFO L440 ceAbstractionStarter]: At program point L134(lines 130 553) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2)))
[2019-11-19 20:51:52,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:51:52 BoogieIcfgContainer
[2019-11-19 20:51:52,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-11-19 20:51:52,825 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2019-11-19 20:51:52,825 INFO L271 PluginConnector]: Initializing Witness Printer...
[2019-11-19 20:51:52,826 INFO L275 PluginConnector]: Witness Printer initialized
[2019-11-19 20:51:52,826 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:36" (3/4) ...
[2019-11-19 20:51:52,830 INFO L137 WitnessPrinter]: Generating witness for correct program
[2019-11-19 20:51:52,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2019-11-19 20:51:52,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2019-11-19 20:51:52,949 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2019-11-19 20:51:52,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2019-11-19 20:51:52,951 INFO L168 Benchmark]: Toolchain (without parser) took 17800.64 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 903.9 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -348.8 MB). Peak memory consumption was 555.1 MB. Max. memory is 11.5 GB.
[2019-11-19 20:51:52,951 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2019-11-19 20:51:52,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB.
[2019-11-19 20:51:52,952 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB.
[2019-11-19 20:51:52,952 INFO L168 Benchmark]: Boogie Preprocessor took 39.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB.
[2019-11-19 20:51:52,952 INFO L168 Benchmark]: RCFGBuilder took 756.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB.
[2019-11-19 20:51:52,953 INFO L168 Benchmark]: TraceAbstraction took 16390.52 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 753.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -238.7 MB). Peak memory consumption was 515.2 MB. Max. memory is 11.5 GB.
[2019-11-19 20:51:52,953 INFO L168 Benchmark]: Witness Printer took 124.19 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB.
[2019-11-19 20:51:52,955 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB.
* CACSL2BoogieTranslator took 430.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB.
* Boogie Procedure Inliner took 52.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB.
* Boogie Preprocessor took 39.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB.
* RCFGBuilder took 756.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB.
* TraceAbstraction took 16390.52 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 753.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -238.7 MB). Peak memory consumption was 515.2 MB. Max. memory is 11.5 GB.
* Witness Printer took 124.19 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 606]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- InvariantResult [Line: 118]: Loop Invariant
Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state
- InvariantResult [Line: 196]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 172]: Loop Invariant
Derived loop invariant: ((((((s__state <= 4528 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) || (4512 <= s__state && s__state <= 4528 && blastFlag <= 2)) || (((s__state <= 4528 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || ((((4512 <= s__state && s__state <= 4528) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)
- InvariantResult [Line: 130]: Loop Invariant
Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || ((((blastFlag <= 4 && s__state <= 4432) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 0 == s__hit)
- InvariantResult [Line: 184]: Loop Invariant
Derived loop invariant: ((((((4560 <= s__state && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)
- InvariantResult [Line: 142]: Loop Invariant
Derived loop invariant: (((s__state <= 4464 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4464 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)
- InvariantResult [Line: 148]: Loop Invariant
Derived loop invariant: ((((s__state <= 4480 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4480 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)
- InvariantResult [Line: 610]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 7]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 112]: Loop Invariant
Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state
- InvariantResult [Line: 93]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 190]: Loop Invariant
Derived loop invariant: (((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((((s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0 && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)
- InvariantResult [Line: 166]: Loop Invariant
Derived loop invariant: (((((s__state <= 4512 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || (((s__state <= 4512 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || ((((s__state <= 4512 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)
- InvariantResult [Line: 124]: Loop Invariant
Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || (((((blastFlag <= 4 && s__state <= 4432) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)
- InvariantResult [Line: 100]: Loop Invariant
Derived loop invariant: s__state <= 4560 && blastFlag <= 2
- InvariantResult [Line: 178]: Loop Invariant
Derived loop invariant: ((((((s__state <= 4560 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4560 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || (s__state <= 4560 && ((blastFlag <= 4 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)
- InvariantResult [Line: 136]: Loop Invariant
Derived loop invariant: (((blastFlag <= 2 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state) || ((((blastFlag <= 4 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state)
- InvariantResult [Line: 97]: Loop Invariant
Derived loop invariant: blastFlag <= 2 && 12292 == s__state
- InvariantResult [Line: 94]: Loop Invariant
Derived loop invariant: ((((((((((((((((((blastFlag <= 2 && 4368 == s__state) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (((((4560 <= s__state && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 3 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__s3__tmp__next_state___0 <= 4560)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)) || ((((s__state <= 4528 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)) || ((((((s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0 && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((((s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0 && 4400 == s__state) && blastFlag <= 4) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (s__state == 4384 && blastFlag <= 2)) || ((((4512 <= s__state && s__state <= 4528) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || (((4416 == s__state && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit)) || (((s__state <= 4528 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || (((((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((4416 == s__state && blastFlag <= 2) && 0 == s__hit)
- InvariantResult [Line: 193]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 60]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 160]: Loop Invariant
Derived loop invariant: (((s__state <= 4512 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4512 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 123 locations, 1 error locations. Result: SAFE, OverallTime: 16.2s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, HoareTripleCheckerStatistics: 4391 SDtfs, 2019 SDslu, 2246 SDs, 0 SdLazy, 2459 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2725 GetRequests, 2688 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3841occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2798 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 127 NumberOfFragments, 826 HoareAnnotationTreeSize, 22 FomulaSimplifications, 28203 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24378 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 8751 NumberOfCodeBlocks, 8751 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8720 ConstructedInterpolants, 0 QuantifiedInterpolants, 4981326 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4110 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 39090/39192 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...