./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 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_srvr_2.cil-2.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 6c347afff8e447ace50221adb149313f25c6a4a0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:26:38,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:26:38,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:26:38,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:26:38,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:26:38,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:26:38,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:26:38,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:26:38,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:26:38,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:26:38,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:26:38,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:26:38,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:26:38,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:26:38,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:26:38,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:26:38,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:26:38,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:26:38,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:26:38,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:26:38,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:26:38,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:26:38,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:26:38,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:26:38,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:26:38,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:26:38,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:26:38,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:26:38,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:26:38,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:26:38,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:26:38,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:26:38,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:26:38,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:26:38,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:26:38,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:26:38,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:26:38,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:26:38,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:26:38,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:26:38,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:26:38,665 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:26:38,684 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:26:38,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:26:38,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:26:38,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:26:38,687 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:26:38,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:26:38,688 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:26:38,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:26:38,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:26:38,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:26:38,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:26:38,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:26:38,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:26:38,690 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:26:38,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:26:38,690 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:26:38,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:26:38,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:26:38,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:26:38,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:26:38,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:26:38,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:26:38,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:26:38,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:26:38,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:26:38,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:26:38,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:26:38,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:26:38,699 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 -> 6c347afff8e447ace50221adb149313f25c6a4a0 [2019-11-19 18:26:38,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:26:39,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:26:39,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:26:39,021 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:26:39,021 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:26:39,023 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c [2019-11-19 18:26:39,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe535b9a/650b505f8bad4635b96419f5ed38c852/FLAG960be31fd [2019-11-19 18:26:39,601 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:26:39,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c [2019-11-19 18:26:39,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe535b9a/650b505f8bad4635b96419f5ed38c852/FLAG960be31fd [2019-11-19 18:26:39,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe535b9a/650b505f8bad4635b96419f5ed38c852 [2019-11-19 18:26:39,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:26:39,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:26:39,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:26:39,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:26:39,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:26:39,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:39" (1/1) ... [2019-11-19 18:26:39,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647e69ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:39, skipping insertion in model container [2019-11-19 18:26:39,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:39" (1/1) ... [2019-11-19 18:26:39,940 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:26:39,999 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:26:40,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:26:40,244 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:26:40,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:26:40,407 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:26:40,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:40 WrapperNode [2019-11-19 18:26:40,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:26:40,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:26:40,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:26:40,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:26:40,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:40" (1/1) ... [2019-11-19 18:26:40,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:40" (1/1) ... [2019-11-19 18:26:40,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:26:40,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:26:40,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:26:40,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:26:40,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:40" (1/1) ... [2019-11-19 18:26:40,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:40" (1/1) ... [2019-11-19 18:26:40,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:40" (1/1) ... [2019-11-19 18:26:40,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:40" (1/1) ... [2019-11-19 18:26:40,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:40" (1/1) ... [2019-11-19 18:26:40,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:40" (1/1) ... [2019-11-19 18:26:40,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:40" (1/1) ... [2019-11-19 18:26:40,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:26:40,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:26:40,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:26:40,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:26:40,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:40" (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 18:26:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:26:40,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:26:40,788 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 18:26:41,349 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-19 18:26:41,349 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-19 18:26:41,351 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:26:41,352 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 18:26:41,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:41 BoogieIcfgContainer [2019-11-19 18:26:41,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:26:41,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:26:41,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:26:41,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:26:41,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:26:39" (1/3) ... [2019-11-19 18:26:41,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65478933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:26:41, skipping insertion in model container [2019-11-19 18:26:41,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:40" (2/3) ... [2019-11-19 18:26:41,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65478933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:26:41, skipping insertion in model container [2019-11-19 18:26:41,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:41" (3/3) ... [2019-11-19 18:26:41,368 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-2.c [2019-11-19 18:26:41,377 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:26:41,383 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:26:41,394 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:26:41,421 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:26:41,421 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:26:41,422 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:26:41,422 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:26:41,422 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:26:41,423 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:26:41,423 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:26:41,423 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:26:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-19 18:26:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 18:26:41,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:41,454 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:41,454 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:41,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:41,460 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-11-19 18:26:41,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:41,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855540633] [2019-11-19 18:26:41,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:41,743 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 18:26:41,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855540633] [2019-11-19 18:26:41,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:41,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:41,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734879832] [2019-11-19 18:26:41,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:41,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:41,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:41,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:41,774 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-11-19 18:26:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:42,086 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-11-19 18:26:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:42,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-19 18:26:42,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:42,103 INFO L225 Difference]: With dead ends: 327 [2019-11-19 18:26:42,104 INFO L226 Difference]: Without dead ends: 174 [2019-11-19 18:26:42,108 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 18:26:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-19 18:26:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-11-19 18:26:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-19 18:26:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-11-19 18:26:42,168 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-11-19 18:26:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:42,169 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-11-19 18:26:42,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-11-19 18:26:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 18:26:42,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:42,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:42,173 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:42,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:42,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-11-19 18:26:42,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:42,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733725550] [2019-11-19 18:26:42,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:42,279 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 18:26:42,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733725550] [2019-11-19 18:26:42,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:42,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:42,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395764184] [2019-11-19 18:26:42,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:42,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:42,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:42,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:42,287 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-11-19 18:26:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:42,538 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-11-19 18:26:42,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:42,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-19 18:26:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:42,541 INFO L225 Difference]: With dead ends: 379 [2019-11-19 18:26:42,541 INFO L226 Difference]: Without dead ends: 215 [2019-11-19 18:26:42,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-19 18:26:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-11-19 18:26:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-19 18:26:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-19 18:26:42,563 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-11-19 18:26:42,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:42,563 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-19 18:26:42,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-19 18:26:42,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-19 18:26:42,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:42,567 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:42,567 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:42,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:42,568 INFO L82 PathProgramCache]: Analyzing trace with hash -442897790, now seen corresponding path program 1 times [2019-11-19 18:26:42,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:42,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124884904] [2019-11-19 18:26:42,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:26:42,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124884904] [2019-11-19 18:26:42,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:42,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:42,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100890405] [2019-11-19 18:26:42,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:42,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:42,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:42,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:42,643 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-19 18:26:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:42,830 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-19 18:26:42,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:42,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-19 18:26:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:42,833 INFO L225 Difference]: With dead ends: 444 [2019-11-19 18:26:42,834 INFO L226 Difference]: Without dead ends: 241 [2019-11-19 18:26:42,836 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 18:26:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-19 18:26:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-19 18:26:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-19 18:26:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-19 18:26:42,853 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-11-19 18:26:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:42,854 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-19 18:26:42,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-19 18:26:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-19 18:26:42,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:42,859 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:42,859 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:42,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:42,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2002519192, now seen corresponding path program 1 times [2019-11-19 18:26:42,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:42,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049614869] [2019-11-19 18:26:42,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 18:26:42,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049614869] [2019-11-19 18:26:42,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:42,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:42,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668821875] [2019-11-19 18:26:42,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:42,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:42,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:42,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:42,958 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-19 18:26:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,104 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-11-19 18:26:43,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:43,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-19 18:26:43,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,107 INFO L225 Difference]: With dead ends: 492 [2019-11-19 18:26:43,107 INFO L226 Difference]: Without dead ends: 258 [2019-11-19 18:26:43,108 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 18:26:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-19 18:26:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-19 18:26:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-19 18:26:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-11-19 18:26:43,144 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-11-19 18:26:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,144 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-11-19 18:26:43,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-11-19 18:26:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-19 18:26:43,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,152 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:43,152 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1780613796, now seen corresponding path program 1 times [2019-11-19 18:26:43,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798342791] [2019-11-19 18:26:43,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:26:43,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798342791] [2019-11-19 18:26:43,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:43,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:43,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929629569] [2019-11-19 18:26:43,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:43,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,231 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-11-19 18:26:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,407 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-11-19 18:26:43,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:43,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-19 18:26:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,410 INFO L225 Difference]: With dead ends: 551 [2019-11-19 18:26:43,410 INFO L226 Difference]: Without dead ends: 302 [2019-11-19 18:26:43,411 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 18:26:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-19 18:26:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-19 18:26:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-19 18:26:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-11-19 18:26:43,425 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-11-19 18:26:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,426 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-11-19 18:26:43,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-11-19 18:26:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 18:26:43,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,429 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:43,429 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,430 INFO L82 PathProgramCache]: Analyzing trace with hash -923139676, now seen corresponding path program 1 times [2019-11-19 18:26:43,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141965115] [2019-11-19 18:26:43,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 18:26:43,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141965115] [2019-11-19 18:26:43,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:43,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:43,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071174070] [2019-11-19 18:26:43,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:43,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:43,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:43,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,549 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-11-19 18:26:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,674 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-11-19 18:26:43,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:43,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-19 18:26:43,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,677 INFO L225 Difference]: With dead ends: 591 [2019-11-19 18:26:43,677 INFO L226 Difference]: Without dead ends: 300 [2019-11-19 18:26:43,678 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 18:26:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-19 18:26:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-19 18:26:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-19 18:26:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-11-19 18:26:43,689 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-11-19 18:26:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,689 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-11-19 18:26:43,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-11-19 18:26:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 18:26:43,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,691 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:43,692 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1119050571, now seen corresponding path program 1 times [2019-11-19 18:26:43,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465142137] [2019-11-19 18:26:43,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:26:43,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465142137] [2019-11-19 18:26:43,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:43,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:43,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732989483] [2019-11-19 18:26:43,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:43,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:43,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:43,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,764 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-11-19 18:26:43,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,938 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-11-19 18:26:43,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:43,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-19 18:26:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,941 INFO L225 Difference]: With dead ends: 593 [2019-11-19 18:26:43,941 INFO L226 Difference]: Without dead ends: 300 [2019-11-19 18:26:43,942 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 18:26:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-19 18:26:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-11-19 18:26:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-19 18:26:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-11-19 18:26:43,952 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-11-19 18:26:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,953 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-11-19 18:26:43,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-11-19 18:26:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 18:26:43,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,954 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:43,955 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1891855493, now seen corresponding path program 1 times [2019-11-19 18:26:43,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435742544] [2019-11-19 18:26:43,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-19 18:26:44,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435742544] [2019-11-19 18:26:44,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:44,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:44,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745971472] [2019-11-19 18:26:44,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:44,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:44,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,009 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-11-19 18:26:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:44,136 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-19 18:26:44,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:44,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-19 18:26:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:44,139 INFO L225 Difference]: With dead ends: 594 [2019-11-19 18:26:44,139 INFO L226 Difference]: Without dead ends: 305 [2019-11-19 18:26:44,140 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 18:26:44,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-19 18:26:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-19 18:26:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-19 18:26:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-11-19 18:26:44,151 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-11-19 18:26:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:44,151 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-11-19 18:26:44,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-11-19 18:26:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 18:26:44,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:44,153 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:44,153 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:44,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:44,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1633491035, now seen corresponding path program 1 times [2019-11-19 18:26:44,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:44,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355286276] [2019-11-19 18:26:44,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 18:26:44,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355286276] [2019-11-19 18:26:44,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:44,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:44,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040796981] [2019-11-19 18:26:44,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:44,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:44,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:44,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,194 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-11-19 18:26:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:44,335 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-11-19 18:26:44,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:44,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-19 18:26:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:44,338 INFO L225 Difference]: With dead ends: 634 [2019-11-19 18:26:44,338 INFO L226 Difference]: Without dead ends: 336 [2019-11-19 18:26:44,339 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 18:26:44,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-19 18:26:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-19 18:26:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-19 18:26:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-11-19 18:26:44,351 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-11-19 18:26:44,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:44,351 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-11-19 18:26:44,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-11-19 18:26:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 18:26:44,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:44,353 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:44,354 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:44,354 INFO L82 PathProgramCache]: Analyzing trace with hash -839203641, now seen corresponding path program 1 times [2019-11-19 18:26:44,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:44,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716598686] [2019-11-19 18:26:44,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 18:26:44,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716598686] [2019-11-19 18:26:44,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:44,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:44,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783822602] [2019-11-19 18:26:44,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:44,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:44,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,401 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-11-19 18:26:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:44,542 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-11-19 18:26:44,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:44,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-19 18:26:44,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:44,545 INFO L225 Difference]: With dead ends: 663 [2019-11-19 18:26:44,545 INFO L226 Difference]: Without dead ends: 336 [2019-11-19 18:26:44,546 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 18:26:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-19 18:26:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-19 18:26:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-19 18:26:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-11-19 18:26:44,557 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-11-19 18:26:44,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:44,558 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-11-19 18:26:44,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-11-19 18:26:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 18:26:44,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:44,560 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:44,560 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:44,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:44,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2015586581, now seen corresponding path program 1 times [2019-11-19 18:26:44,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:44,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118649284] [2019-11-19 18:26:44,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 18:26:44,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118649284] [2019-11-19 18:26:44,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:44,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:44,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742064784] [2019-11-19 18:26:44,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:44,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:44,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:44,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,597 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-11-19 18:26:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:44,777 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-11-19 18:26:44,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:44,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-19 18:26:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:44,780 INFO L225 Difference]: With dead ends: 696 [2019-11-19 18:26:44,780 INFO L226 Difference]: Without dead ends: 369 [2019-11-19 18:26:44,781 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 18:26:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-19 18:26:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-19 18:26:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-19 18:26:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-11-19 18:26:44,793 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-11-19 18:26:44,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:44,793 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-11-19 18:26:44,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-11-19 18:26:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-19 18:26:44,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:44,795 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:44,795 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:44,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:44,795 INFO L82 PathProgramCache]: Analyzing trace with hash -598706249, now seen corresponding path program 1 times [2019-11-19 18:26:44,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:44,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996198622] [2019-11-19 18:26:44,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 18:26:44,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996198622] [2019-11-19 18:26:44,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:44,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:44,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164876358] [2019-11-19 18:26:44,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:44,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:44,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:44,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,828 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-11-19 18:26:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:44,978 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-11-19 18:26:44,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:44,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-19 18:26:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:44,982 INFO L225 Difference]: With dead ends: 723 [2019-11-19 18:26:44,982 INFO L226 Difference]: Without dead ends: 369 [2019-11-19 18:26:44,983 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 18:26:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-19 18:26:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-19 18:26:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-19 18:26:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-11-19 18:26:44,998 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-11-19 18:26:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:44,998 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-11-19 18:26:44,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:44,999 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-11-19 18:26:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-19 18:26:45,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:45,000 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:45,001 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:45,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731612, now seen corresponding path program 1 times [2019-11-19 18:26:45,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:45,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105343008] [2019-11-19 18:26:45,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-19 18:26:45,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105343008] [2019-11-19 18:26:45,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:45,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:45,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496494458] [2019-11-19 18:26:45,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:45,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:45,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:45,046 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-11-19 18:26:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:45,200 INFO L93 Difference]: Finished difference Result 741 states and 1194 transitions. [2019-11-19 18:26:45,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:45,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-19 18:26:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:45,202 INFO L225 Difference]: With dead ends: 741 [2019-11-19 18:26:45,203 INFO L226 Difference]: Without dead ends: 387 [2019-11-19 18:26:45,204 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 18:26:45,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-19 18:26:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-11-19 18:26:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-19 18:26:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-11-19 18:26:45,219 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-11-19 18:26:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:45,219 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-11-19 18:26:45,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:45,220 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-11-19 18:26:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-19 18:26:45,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:45,222 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:45,222 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:45,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:45,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1883634640, now seen corresponding path program 1 times [2019-11-19 18:26:45,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:45,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820328620] [2019-11-19 18:26:45,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-19 18:26:45,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820328620] [2019-11-19 18:26:45,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:45,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:45,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689327734] [2019-11-19 18:26:45,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:45,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:45,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:45,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:45,274 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-11-19 18:26:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:45,394 INFO L93 Difference]: Finished difference Result 762 states and 1217 transitions. [2019-11-19 18:26:45,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:45,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-19 18:26:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:45,397 INFO L225 Difference]: With dead ends: 762 [2019-11-19 18:26:45,397 INFO L226 Difference]: Without dead ends: 387 [2019-11-19 18:26:45,398 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 18:26:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-19 18:26:45,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-11-19 18:26:45,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-19 18:26:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-11-19 18:26:45,410 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-11-19 18:26:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:45,411 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-11-19 18:26:45,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-11-19 18:26:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-19 18:26:45,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:45,413 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:45,413 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:45,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1006288068, now seen corresponding path program 1 times [2019-11-19 18:26:45,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:45,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213318333] [2019-11-19 18:26:45,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:26:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:26:45,503 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:26:45,503 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:26:45,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:26:45 BoogieIcfgContainer [2019-11-19 18:26:45,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:26:45,576 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:26:45,576 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:26:45,576 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:26:45,577 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:41" (3/4) ... [2019-11-19 18:26:45,579 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 18:26:45,745 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:26:45,745 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:26:45,747 INFO L168 Benchmark]: Toolchain (without parser) took 5823.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 338.2 MB). Free memory was 953.6 MB in the beginning and 1.3 GB in the end (delta: -298.5 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:45,748 INFO L168 Benchmark]: CDTParser took 0.30 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 18:26:45,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 953.6 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:45,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.34 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 18:26:45,749 INFO L168 Benchmark]: Boogie Preprocessor took 53.37 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 18:26:45,749 INFO L168 Benchmark]: RCFGBuilder took 833.76 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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:45,749 INFO L168 Benchmark]: TraceAbstraction took 4219.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -198.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:26:45,750 INFO L168 Benchmark]: Witness Printer took 169.12 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:45,752 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.30 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 484.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 953.6 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.34 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 53.37 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 833.76 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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4219.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -198.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 169.12 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 607]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L612] int s ; [L613] int tmp ; [L617] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L40] int s__session__cipher ; [L41] int buf ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND FALSE !(tmp___1 + 12288) [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L579] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L293] COND FALSE !(ret <= 0) [L296] COND TRUE \read(s__hit) [L297] s__state = 8656 [L301] s__init_num = 0 [L579] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND FALSE !(s__state == 8576) [L170] COND FALSE !(s__state == 8577) [L173] COND FALSE !(s__state == 8592) [L176] COND FALSE !(s__state == 8593) [L179] COND FALSE !(s__state == 8608) [L182] COND FALSE !(s__state == 8609) [L185] COND FALSE !(s__state == 8640) [L188] COND FALSE !(s__state == 8641) [L191] COND TRUE s__state == 8656 [L490] s__session__cipher = s__s3__tmp__new_cipher [L491] COND FALSE !(! tmp___9) [L495] ret = __VERIFIER_nondet_int() [L496] COND TRUE blastFlag == 2 [L497] blastFlag = 3 [L499] COND FALSE !(ret <= 0) [L502] s__state = 8672 [L503] s__init_num = 0 [L504] COND FALSE !(! tmp___10) [L579] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND FALSE !(s__state == 8576) [L170] COND FALSE !(s__state == 8577) [L173] COND FALSE !(s__state == 8592) [L176] COND FALSE !(s__state == 8593) [L179] COND FALSE !(s__state == 8608) [L182] COND FALSE !(s__state == 8609) [L185] COND FALSE !(s__state == 8640) [L188] COND FALSE !(s__state == 8641) [L191] COND FALSE !(s__state == 8656) [L194] COND FALSE !(s__state == 8657) [L197] COND TRUE s__state == 8672 [L511] ret = __VERIFIER_nondet_int() [L512] COND TRUE blastFlag == 3 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.1s, OverallIterations: 15, TraceHistogramMax: 4, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1821 SDtfs, 2038 SDslu, 234 SDs, 0 SdLazy, 1321 SolverSat, 599 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 188237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 636/636 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...