./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_10.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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_10.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 221038eb3d852e675138331615da45f0057866c6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-30f4e4a [2019-11-27 22:35:36,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:36,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:36,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:36,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:36,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:36,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:36,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:36,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:36,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:36,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:36,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:36,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:36,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:36,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:36,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:36,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:36,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:36,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:36,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:36,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:36,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:36,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:36,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:36,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:36,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:36,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:36,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:36,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:36,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:36,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:36,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:36,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:36,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:36,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:36,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:36,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:36,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:36,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:36,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:36,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:36,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:35:36,739 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:36,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:36,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:36,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:36,747 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:36,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:36,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:36,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:36,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:36,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:36,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:36,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:36,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:36,750 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:36,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:36,751 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:36,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:36,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:36,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:36,752 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:36,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:36,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:36,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:36,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:36,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:36,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:36,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:36,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:36,755 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 -> 221038eb3d852e675138331615da45f0057866c6 [2019-11-27 22:35:37,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:37,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:37,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:37,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:37,130 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:37,131 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_10.cil.c [2019-11-27 22:35:37,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7614c5a7a/3f12fddf2a84414b967a47eb0c0e51ed/FLAGad152f5d0 [2019-11-27 22:35:37,682 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:37,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_10.cil.c [2019-11-27 22:35:37,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7614c5a7a/3f12fddf2a84414b967a47eb0c0e51ed/FLAGad152f5d0 [2019-11-27 22:35:38,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7614c5a7a/3f12fddf2a84414b967a47eb0c0e51ed [2019-11-27 22:35:38,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:38,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:38,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:38,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:38,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:38,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:38" (1/1) ... [2019-11-27 22:35:38,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a58cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38, skipping insertion in model container [2019-11-27 22:35:38,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:38" (1/1) ... [2019-11-27 22:35:38,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:38,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:38,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:38,539 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:38,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:38,615 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:38,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38 WrapperNode [2019-11-27 22:35:38,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:38,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:38,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:38,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:38,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38" (1/1) ... [2019-11-27 22:35:38,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38" (1/1) ... [2019-11-27 22:35:38,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:38,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:38,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:38,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:38,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38" (1/1) ... [2019-11-27 22:35:38,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38" (1/1) ... [2019-11-27 22:35:38,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38" (1/1) ... [2019-11-27 22:35:38,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38" (1/1) ... [2019-11-27 22:35:38,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38" (1/1) ... [2019-11-27 22:35:38,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38" (1/1) ... [2019-11-27 22:35:38,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38" (1/1) ... [2019-11-27 22:35:38,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:38,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:38,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:38,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:38,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38" (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-27 22:35:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:38,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:38,937 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:39,607 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-27 22:35:39,608 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-27 22:35:39,613 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:39,613 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:35:39,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:39 BoogieIcfgContainer [2019-11-27 22:35:39,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:39,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:39,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:39,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:39,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:38" (1/3) ... [2019-11-27 22:35:39,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55553d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:39, skipping insertion in model container [2019-11-27 22:35:39,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:38" (2/3) ... [2019-11-27 22:35:39,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55553d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:39, skipping insertion in model container [2019-11-27 22:35:39,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:39" (3/3) ... [2019-11-27 22:35:39,625 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_10.cil.c [2019-11-27 22:35:39,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:39,645 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:39,659 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:39,689 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:39,689 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:39,690 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:39,690 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:39,690 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:39,690 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:39,690 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:39,691 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-27 22:35:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:35:39,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:39,721 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] [2019-11-27 22:35:39,721 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:39,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2084821380, now seen corresponding path program 1 times [2019-11-27 22:35:39,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:39,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557916685] [2019-11-27 22:35:39,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:39,948 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-27 22:35:39,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557916685] [2019-11-27 22:35:39,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:39,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:39,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951485241] [2019-11-27 22:35:39,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:39,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:39,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:39,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:39,982 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-11-27 22:35:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:40,316 INFO L93 Difference]: Finished difference Result 311 states and 529 transitions. [2019-11-27 22:35:40,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:40,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-27 22:35:40,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:40,336 INFO L225 Difference]: With dead ends: 311 [2019-11-27 22:35:40,337 INFO L226 Difference]: Without dead ends: 152 [2019-11-27 22:35:40,342 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-27 22:35:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-27 22:35:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-11-27 22:35:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-27 22:35:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 235 transitions. [2019-11-27 22:35:40,408 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 235 transitions. Word has length 22 [2019-11-27 22:35:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:40,409 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 235 transitions. [2019-11-27 22:35:40,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 235 transitions. [2019-11-27 22:35:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:40,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:40,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:40,412 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:40,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:40,413 INFO L82 PathProgramCache]: Analyzing trace with hash -586952456, now seen corresponding path program 1 times [2019-11-27 22:35:40,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:40,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874414733] [2019-11-27 22:35:40,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:40,526 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-27 22:35:40,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874414733] [2019-11-27 22:35:40,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:40,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:40,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421542430] [2019-11-27 22:35:40,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:40,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:40,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:40,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:40,534 INFO L87 Difference]: Start difference. First operand 150 states and 235 transitions. Second operand 3 states. [2019-11-27 22:35:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:40,738 INFO L93 Difference]: Finished difference Result 313 states and 493 transitions. [2019-11-27 22:35:40,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:40,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:40,743 INFO L225 Difference]: With dead ends: 313 [2019-11-27 22:35:40,743 INFO L226 Difference]: Without dead ends: 170 [2019-11-27 22:35:40,745 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-27 22:35:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-27 22:35:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2019-11-27 22:35:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-27 22:35:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 266 transitions. [2019-11-27 22:35:40,766 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 266 transitions. Word has length 23 [2019-11-27 22:35:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:40,766 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 266 transitions. [2019-11-27 22:35:40,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 266 transitions. [2019-11-27 22:35:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:40,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:40,769 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:40,769 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:40,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash 69813308, now seen corresponding path program 1 times [2019-11-27 22:35:40,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:40,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213498148] [2019-11-27 22:35:40,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:40,866 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-27 22:35:40,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213498148] [2019-11-27 22:35:40,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:40,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:40,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675909290] [2019-11-27 22:35:40,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:40,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:40,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:40,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:40,869 INFO L87 Difference]: Start difference. First operand 168 states and 266 transitions. Second operand 3 states. [2019-11-27 22:35:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:41,026 INFO L93 Difference]: Finished difference Result 330 states and 523 transitions. [2019-11-27 22:35:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:41,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:41,030 INFO L225 Difference]: With dead ends: 330 [2019-11-27 22:35:41,030 INFO L226 Difference]: Without dead ends: 169 [2019-11-27 22:35:41,032 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-27 22:35:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-27 22:35:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-11-27 22:35:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-27 22:35:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 267 transitions. [2019-11-27 22:35:41,049 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 267 transitions. Word has length 23 [2019-11-27 22:35:41,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:41,050 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 267 transitions. [2019-11-27 22:35:41,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 267 transitions. [2019-11-27 22:35:41,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:35:41,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:41,052 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] [2019-11-27 22:35:41,052 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:41,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:41,052 INFO L82 PathProgramCache]: Analyzing trace with hash 173828051, now seen corresponding path program 1 times [2019-11-27 22:35:41,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:41,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591785870] [2019-11-27 22:35:41,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:41,097 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-27 22:35:41,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591785870] [2019-11-27 22:35:41,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:41,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:41,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112012724] [2019-11-27 22:35:41,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:41,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:41,100 INFO L87 Difference]: Start difference. First operand 169 states and 267 transitions. Second operand 3 states. [2019-11-27 22:35:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:41,262 INFO L93 Difference]: Finished difference Result 340 states and 535 transitions. [2019-11-27 22:35:41,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:41,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-27 22:35:41,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:41,265 INFO L225 Difference]: With dead ends: 340 [2019-11-27 22:35:41,265 INFO L226 Difference]: Without dead ends: 178 [2019-11-27 22:35:41,266 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-27 22:35:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-27 22:35:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-11-27 22:35:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-27 22:35:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 276 transitions. [2019-11-27 22:35:41,280 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 276 transitions. Word has length 24 [2019-11-27 22:35:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:41,280 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 276 transitions. [2019-11-27 22:35:41,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 276 transitions. [2019-11-27 22:35:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:35:41,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:41,283 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] [2019-11-27 22:35:41,283 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:41,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:41,284 INFO L82 PathProgramCache]: Analyzing trace with hash 57533382, now seen corresponding path program 1 times [2019-11-27 22:35:41,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:41,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378686990] [2019-11-27 22:35:41,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:41,331 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-27 22:35:41,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378686990] [2019-11-27 22:35:41,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:41,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:41,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954479247] [2019-11-27 22:35:41,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:41,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:41,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:41,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:41,334 INFO L87 Difference]: Start difference. First operand 178 states and 276 transitions. Second operand 3 states. [2019-11-27 22:35:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:41,497 INFO L93 Difference]: Finished difference Result 359 states and 553 transitions. [2019-11-27 22:35:41,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:41,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-27 22:35:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:41,501 INFO L225 Difference]: With dead ends: 359 [2019-11-27 22:35:41,501 INFO L226 Difference]: Without dead ends: 188 [2019-11-27 22:35:41,502 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-27 22:35:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-27 22:35:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 178. [2019-11-27 22:35:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-27 22:35:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 274 transitions. [2019-11-27 22:35:41,515 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 274 transitions. Word has length 25 [2019-11-27 22:35:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:41,515 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 274 transitions. [2019-11-27 22:35:41,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 274 transitions. [2019-11-27 22:35:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 22:35:41,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:41,518 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] [2019-11-27 22:35:41,518 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:41,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:41,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1413165422, now seen corresponding path program 1 times [2019-11-27 22:35:41,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:41,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374123091] [2019-11-27 22:35:41,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:41,550 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-27 22:35:41,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374123091] [2019-11-27 22:35:41,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:41,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:41,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978000724] [2019-11-27 22:35:41,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:41,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:41,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:41,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:41,553 INFO L87 Difference]: Start difference. First operand 178 states and 274 transitions. Second operand 3 states. [2019-11-27 22:35:41,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:41,688 INFO L93 Difference]: Finished difference Result 359 states and 549 transitions. [2019-11-27 22:35:41,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:41,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-27 22:35:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:41,690 INFO L225 Difference]: With dead ends: 359 [2019-11-27 22:35:41,690 INFO L226 Difference]: Without dead ends: 188 [2019-11-27 22:35:41,691 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-27 22:35:41,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-27 22:35:41,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 178. [2019-11-27 22:35:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-27 22:35:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 272 transitions. [2019-11-27 22:35:41,700 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 272 transitions. Word has length 26 [2019-11-27 22:35:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:41,701 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 272 transitions. [2019-11-27 22:35:41,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 272 transitions. [2019-11-27 22:35:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 22:35:41,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:41,702 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] [2019-11-27 22:35:41,703 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:41,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:41,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1880242814, now seen corresponding path program 1 times [2019-11-27 22:35:41,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:41,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404064389] [2019-11-27 22:35:41,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:41,766 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:35:41,767 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:35:41,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:35:41 BoogieIcfgContainer [2019-11-27 22:35:41,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:35:41,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:35:41,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:35:41,812 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:35:41,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:39" (3/4) ... [2019-11-27 22:35:41,815 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:35:41,907 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:35:41,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:35:41,915 INFO L168 Benchmark]: Toolchain (without parser) took 3857.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.0 MB). Free memory was 955.0 MB in the beginning and 792.6 MB in the end (delta: 162.4 MB). Peak memory consumption was 237.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:41,916 INFO L168 Benchmark]: CDTParser took 0.18 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-27 22:35:41,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 560.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -108.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:41,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:41,917 INFO L168 Benchmark]: Boogie Preprocessor took 52.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:41,918 INFO L168 Benchmark]: RCFGBuilder took 873.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:41,919 INFO L168 Benchmark]: TraceAbstraction took 2194.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 799.6 MB in the end (delta: 203.6 MB). Peak memory consumption was 203.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:41,919 INFO L168 Benchmark]: Witness Printer took 98.88 ms. Allocated memory is still 1.1 GB. Free memory was 799.6 MB in the beginning and 792.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:41,922 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.18 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 560.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -108.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 873.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2194.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 799.6 MB in the end (delta: 203.6 MB). Peak memory consumption was 203.6 MB. Max. memory is 11.5 GB. * Witness Printer took 98.88 ms. Allocated memory is still 1.1 GB. Free memory was 799.6 MB in the beginning and 792.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 628]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L634] int s ; [L635] int tmp ; [L639] 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 ; [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 ; [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 = __VERIFIER_nondet_int() ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp = __VERIFIER_nondet_long() ; [L45] int cb ; [L46] long num1 ; [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 ; [L55] int tmp___4 ; [L56] int tmp___5 ; [L57] int tmp___6 ; [L58] int tmp___7 ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 ; [L61] int tmp___10 ; [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 ; [L72] s__s3__tmp__new_cipher__algorithms = 0 [L73] __cil_tmp56 = 0 [L74] __cil_tmp57 = 0 [L75] __cil_tmp58 = 0 [L76] __cil_tmp59 = 0 [L77] __cil_tmp60 = 0 [L78] __cil_tmp61 = 0 [L79] s__s3__tmp__reuse_message = 0 [L80] s__state = initial_state [L81] blastFlag = 0 [L82] Time = tmp [L83] cb = 0 [L84] ret = -1 [L85] skip = 0 [L86] got_new_session = 0 [L87] COND TRUE s__info_callback != 0 [L88] cb = s__info_callback [L94] s__in_handshake ++ [L95] COND FALSE !(tmp___1 + 12288) [L100] COND FALSE !(s__cert == 0) [L104] COND TRUE 1 [L106] state = s__state [L107] COND FALSE !(s__state == 12292) [L110] COND FALSE !(s__state == 16384) [L113] COND FALSE !(s__state == 8192) [L116] COND FALSE !(s__state == 24576) [L119] COND FALSE !(s__state == 8195) [L122] COND FALSE !(s__state == 8480) [L125] COND FALSE !(s__state == 8481) [L128] COND FALSE !(s__state == 8482) [L131] COND TRUE s__state == 8464 [L275] s__shutdown = 0 [L276] ret = __VERIFIER_nondet_int() [L277] COND TRUE blastFlag == 0 [L278] blastFlag = 1 [L280] COND FALSE !(ret <= 0) [L283] got_new_session = 1 [L284] s__state = 8496 [L285] s__init_num = 0 [L591] COND TRUE ! s__s3__tmp__reuse_message [L592] COND TRUE ! skip [L593] COND TRUE state == 8464 [L594] COND TRUE s__state == 8496 [L595] COND TRUE cb != 0 [L596] COND TRUE s__info_callback != 0 [L628] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.0s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 840 SDtfs, 1058 SDslu, 120 SDs, 0 SdLazy, 496 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 7411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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...