./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec0_product05.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 287a23d08eab86c6fb35463a3e779b64ab9bd712 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:19:23,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:19:23,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:19:23,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:19:23,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:19:23,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:19:23,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:19:23,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:19:23,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:19:23,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:19:23,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:19:23,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:19:23,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:19:23,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:19:23,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:19:23,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:19:23,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:19:23,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:19:23,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:19:24,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:19:24,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:19:24,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:19:24,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:19:24,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:19:24,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:19:24,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:19:24,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:19:24,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:19:24,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:19:24,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:19:24,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:19:24,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:19:24,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:19:24,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:19:24,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:19:24,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:19:24,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:19:24,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:19:24,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:19:24,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:19:24,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:19:24,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:19:24,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:19:24,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:19:24,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:19:24,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:19:24,060 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:19:24,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:19:24,061 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:19:24,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:19:24,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:19:24,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:19:24,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:19:24,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:19:24,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:19:24,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:19:24,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:19:24,065 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:19:24,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:19:24,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:19:24,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:19:24,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:19:24,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:19:24,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:19:24,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:19:24,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:19:24,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:19:24,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:19:24,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:19:24,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:19:24,069 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 -> 287a23d08eab86c6fb35463a3e779b64ab9bd712 [2019-11-19 21:19:24,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:19:24,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:19:24,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:19:24,445 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:19:24,446 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:19:24,446 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2019-11-19 21:19:24,522 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb655fa0/32a4cc83ecaa4246b2ead1807d44c74b/FLAG28859c992 [2019-11-19 21:19:25,121 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:19:25,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2019-11-19 21:19:25,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb655fa0/32a4cc83ecaa4246b2ead1807d44c74b/FLAG28859c992 [2019-11-19 21:19:25,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb655fa0/32a4cc83ecaa4246b2ead1807d44c74b [2019-11-19 21:19:25,436 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:19:25,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:19:25,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:19:25,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:19:25,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:19:25,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:19:25" (1/1) ... [2019-11-19 21:19:25,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5611b85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:25, skipping insertion in model container [2019-11-19 21:19:25,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:19:25" (1/1) ... [2019-11-19 21:19:25,456 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:19:25,542 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:19:26,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:19:26,128 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:19:26,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:19:26,312 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:19:26,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:26 WrapperNode [2019-11-19 21:19:26,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:19:26,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:19:26,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:19:26,315 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:19:26,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:26" (1/1) ... [2019-11-19 21:19:26,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:26" (1/1) ... [2019-11-19 21:19:26,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:19:26,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:19:26,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:19:26,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:19:26,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:26" (1/1) ... [2019-11-19 21:19:26,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:26" (1/1) ... [2019-11-19 21:19:26,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:26" (1/1) ... [2019-11-19 21:19:26,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:26" (1/1) ... [2019-11-19 21:19:26,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:26" (1/1) ... [2019-11-19 21:19:26,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:26" (1/1) ... [2019-11-19 21:19:26,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:26" (1/1) ... [2019-11-19 21:19:26,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:19:26,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:19:26,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:19:26,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:19:26,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:26" (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 21:19:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-19 21:19:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:19:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 21:19:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:19:26,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:19:27,787 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:19:27,787 INFO L285 CfgBuilder]: Removed 127 assume(true) statements. [2019-11-19 21:19:27,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:19:27 BoogieIcfgContainer [2019-11-19 21:19:27,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:19:27,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:19:27,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:19:27,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:19:27,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:19:25" (1/3) ... [2019-11-19 21:19:27,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40672f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:19:27, skipping insertion in model container [2019-11-19 21:19:27,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:26" (2/3) ... [2019-11-19 21:19:27,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40672f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:19:27, skipping insertion in model container [2019-11-19 21:19:27,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:19:27" (3/3) ... [2019-11-19 21:19:27,804 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product05.cil.c [2019-11-19 21:19:27,814 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:19:27,822 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-19 21:19:27,833 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-19 21:19:27,868 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:19:27,868 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:19:27,868 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:19:27,872 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:19:27,872 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:19:27,872 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:19:27,872 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:19:27,873 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:19:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2019-11-19 21:19:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 21:19:27,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:27,916 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] [2019-11-19 21:19:27,917 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:27,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:27,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1721357046, now seen corresponding path program 1 times [2019-11-19 21:19:27,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:27,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113903262] [2019-11-19 21:19:27,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:28,274 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 21:19:28,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113903262] [2019-11-19 21:19:28,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:28,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:19:28,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910304976] [2019-11-19 21:19:28,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:19:28,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:28,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:19:28,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:19:28,301 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 2 states. [2019-11-19 21:19:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:28,344 INFO L93 Difference]: Finished difference Result 221 states and 347 transitions. [2019-11-19 21:19:28,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:19:28,346 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2019-11-19 21:19:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:28,363 INFO L225 Difference]: With dead ends: 221 [2019-11-19 21:19:28,364 INFO L226 Difference]: Without dead ends: 118 [2019-11-19 21:19:28,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:19:28,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-19 21:19:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-19 21:19:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-19 21:19:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 187 transitions. [2019-11-19 21:19:28,419 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 187 transitions. Word has length 34 [2019-11-19 21:19:28,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:28,420 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 187 transitions. [2019-11-19 21:19:28,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:19:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2019-11-19 21:19:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 21:19:28,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:28,423 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] [2019-11-19 21:19:28,423 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:28,424 INFO L82 PathProgramCache]: Analyzing trace with hash -122239248, now seen corresponding path program 1 times [2019-11-19 21:19:28,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:28,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116316387] [2019-11-19 21:19:28,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:28,545 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 21:19:28,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116316387] [2019-11-19 21:19:28,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:28,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:19:28,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830866963] [2019-11-19 21:19:28,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:19:28,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:28,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:19:28,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:28,555 INFO L87 Difference]: Start difference. First operand 118 states and 187 transitions. Second operand 3 states. [2019-11-19 21:19:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:28,627 INFO L93 Difference]: Finished difference Result 327 states and 519 transitions. [2019-11-19 21:19:28,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:19:28,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-19 21:19:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:28,630 INFO L225 Difference]: With dead ends: 327 [2019-11-19 21:19:28,631 INFO L226 Difference]: Without dead ends: 220 [2019-11-19 21:19:28,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-19 21:19:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 117. [2019-11-19 21:19:28,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-19 21:19:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2019-11-19 21:19:28,659 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 183 transitions. Word has length 35 [2019-11-19 21:19:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:28,660 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 183 transitions. [2019-11-19 21:19:28,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:19:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2019-11-19 21:19:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 21:19:28,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:28,662 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] [2019-11-19 21:19:28,662 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:28,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:28,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2107249571, now seen corresponding path program 1 times [2019-11-19 21:19:28,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:28,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270210057] [2019-11-19 21:19:28,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:28,764 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 21:19:28,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270210057] [2019-11-19 21:19:28,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:28,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:19:28,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923469629] [2019-11-19 21:19:28,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:19:28,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:28,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:19:28,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:28,770 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. Second operand 3 states. [2019-11-19 21:19:28,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:28,818 INFO L93 Difference]: Finished difference Result 220 states and 346 transitions. [2019-11-19 21:19:28,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:19:28,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-19 21:19:28,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:28,820 INFO L225 Difference]: With dead ends: 220 [2019-11-19 21:19:28,821 INFO L226 Difference]: Without dead ends: 118 [2019-11-19 21:19:28,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-19 21:19:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-11-19 21:19:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-19 21:19:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2019-11-19 21:19:28,841 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 36 [2019-11-19 21:19:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:28,841 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2019-11-19 21:19:28,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:19:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2019-11-19 21:19:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 21:19:28,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:28,845 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] [2019-11-19 21:19:28,846 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:28,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:28,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1032935230, now seen corresponding path program 1 times [2019-11-19 21:19:28,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:28,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199403829] [2019-11-19 21:19:28,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:28,984 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 21:19:28,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199403829] [2019-11-19 21:19:28,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:28,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:19:28,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313085315] [2019-11-19 21:19:28,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:19:28,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:28,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:19:28,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:28,988 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand 3 states. [2019-11-19 21:19:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:29,009 INFO L93 Difference]: Finished difference Result 191 states and 289 transitions. [2019-11-19 21:19:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:19:29,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-19 21:19:29,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:29,011 INFO L225 Difference]: With dead ends: 191 [2019-11-19 21:19:29,011 INFO L226 Difference]: Without dead ends: 120 [2019-11-19 21:19:29,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-19 21:19:29,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-11-19 21:19:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-19 21:19:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 182 transitions. [2019-11-19 21:19:29,040 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 182 transitions. Word has length 38 [2019-11-19 21:19:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:29,041 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 182 transitions. [2019-11-19 21:19:29,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:19:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 182 transitions. [2019-11-19 21:19:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 21:19:29,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:29,047 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:19:29,047 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:29,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1719269101, now seen corresponding path program 1 times [2019-11-19 21:19:29,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:29,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543948847] [2019-11-19 21:19:29,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 21:19:29,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543948847] [2019-11-19 21:19:29,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:29,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-19 21:19:29,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225938725] [2019-11-19 21:19:29,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:19:29,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:29,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:19:29,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:19:29,285 INFO L87 Difference]: Start difference. First operand 119 states and 182 transitions. Second operand 10 states. [2019-11-19 21:19:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:30,270 INFO L93 Difference]: Finished difference Result 562 states and 790 transitions. [2019-11-19 21:19:30,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-19 21:19:30,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-11-19 21:19:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:30,274 INFO L225 Difference]: With dead ends: 562 [2019-11-19 21:19:30,275 INFO L226 Difference]: Without dead ends: 513 [2019-11-19 21:19:30,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-11-19 21:19:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-11-19 21:19:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 153. [2019-11-19 21:19:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-19 21:19:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 229 transitions. [2019-11-19 21:19:30,299 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 229 transitions. Word has length 43 [2019-11-19 21:19:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:30,300 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 229 transitions. [2019-11-19 21:19:30,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:19:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 229 transitions. [2019-11-19 21:19:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 21:19:30,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:30,303 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:19:30,303 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:30,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:30,304 INFO L82 PathProgramCache]: Analyzing trace with hash 943468756, now seen corresponding path program 1 times [2019-11-19 21:19:30,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:30,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82555829] [2019-11-19 21:19:30,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 21:19:30,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82555829] [2019-11-19 21:19:30,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:30,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 21:19:30,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718279196] [2019-11-19 21:19:30,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:19:30,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:30,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:19:30,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:19:30,437 INFO L87 Difference]: Start difference. First operand 153 states and 229 transitions. Second operand 6 states. [2019-11-19 21:19:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:30,545 INFO L93 Difference]: Finished difference Result 285 states and 410 transitions. [2019-11-19 21:19:30,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:19:30,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-11-19 21:19:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:30,548 INFO L225 Difference]: With dead ends: 285 [2019-11-19 21:19:30,548 INFO L226 Difference]: Without dead ends: 196 [2019-11-19 21:19:30,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:19:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-19 21:19:30,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 149. [2019-11-19 21:19:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-19 21:19:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 222 transitions. [2019-11-19 21:19:30,566 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 222 transitions. Word has length 44 [2019-11-19 21:19:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:30,566 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 222 transitions. [2019-11-19 21:19:30,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:19:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 222 transitions. [2019-11-19 21:19:30,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 21:19:30,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:30,569 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:19:30,569 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:30,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:30,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1174671319, now seen corresponding path program 1 times [2019-11-19 21:19:30,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:30,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058005569] [2019-11-19 21:19:30,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 21:19:30,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058005569] [2019-11-19 21:19:30,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:30,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:19:30,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112240944] [2019-11-19 21:19:30,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:19:30,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:30,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:19:30,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:19:30,656 INFO L87 Difference]: Start difference. First operand 149 states and 222 transitions. Second operand 5 states. [2019-11-19 21:19:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:30,785 INFO L93 Difference]: Finished difference Result 433 states and 638 transitions. [2019-11-19 21:19:30,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:19:30,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-19 21:19:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:30,791 INFO L225 Difference]: With dead ends: 433 [2019-11-19 21:19:30,791 INFO L226 Difference]: Without dead ends: 351 [2019-11-19 21:19:30,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:19:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-19 21:19:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 271. [2019-11-19 21:19:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-19 21:19:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 411 transitions. [2019-11-19 21:19:30,828 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 411 transitions. Word has length 44 [2019-11-19 21:19:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:30,828 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 411 transitions. [2019-11-19 21:19:30,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:19:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 411 transitions. [2019-11-19 21:19:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 21:19:30,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:30,834 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:19:30,834 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:30,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:30,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1596126344, now seen corresponding path program 1 times [2019-11-19 21:19:30,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:30,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173813044] [2019-11-19 21:19:30,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 21:19:30,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173813044] [2019-11-19 21:19:30,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:30,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 21:19:30,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660786689] [2019-11-19 21:19:30,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 21:19:30,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:30,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 21:19:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:19:30,961 INFO L87 Difference]: Start difference. First operand 271 states and 411 transitions. Second operand 9 states. [2019-11-19 21:19:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:31,524 INFO L93 Difference]: Finished difference Result 800 states and 1135 transitions. [2019-11-19 21:19:31,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 21:19:31,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-11-19 21:19:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:31,529 INFO L225 Difference]: With dead ends: 800 [2019-11-19 21:19:31,530 INFO L226 Difference]: Without dead ends: 642 [2019-11-19 21:19:31,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2019-11-19 21:19:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-19 21:19:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 350. [2019-11-19 21:19:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-19 21:19:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 521 transitions. [2019-11-19 21:19:31,575 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 521 transitions. Word has length 45 [2019-11-19 21:19:31,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:31,576 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 521 transitions. [2019-11-19 21:19:31,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 21:19:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 521 transitions. [2019-11-19 21:19:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-19 21:19:31,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:31,577 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:19:31,578 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:31,578 INFO L82 PathProgramCache]: Analyzing trace with hash -792285918, now seen corresponding path program 1 times [2019-11-19 21:19:31,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:31,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174757672] [2019-11-19 21:19:31,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 21:19:31,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174757672] [2019-11-19 21:19:31,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:31,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:19:31,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894310776] [2019-11-19 21:19:31,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:19:31,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:31,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:19:31,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:19:31,652 INFO L87 Difference]: Start difference. First operand 350 states and 521 transitions. Second operand 4 states. [2019-11-19 21:19:31,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:31,713 INFO L93 Difference]: Finished difference Result 441 states and 637 transitions. [2019-11-19 21:19:31,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:19:31,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-19 21:19:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:31,716 INFO L225 Difference]: With dead ends: 441 [2019-11-19 21:19:31,716 INFO L226 Difference]: Without dead ends: 257 [2019-11-19 21:19:31,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:19:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-19 21:19:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 222. [2019-11-19 21:19:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-19 21:19:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 330 transitions. [2019-11-19 21:19:31,740 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 330 transitions. Word has length 46 [2019-11-19 21:19:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:31,741 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 330 transitions. [2019-11-19 21:19:31,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:19:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 330 transitions. [2019-11-19 21:19:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-19 21:19:31,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:31,743 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:19:31,743 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1597021696, now seen corresponding path program 1 times [2019-11-19 21:19:31,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:31,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571632002] [2019-11-19 21:19:31,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:19:31,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571632002] [2019-11-19 21:19:31,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:31,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:19:31,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386016931] [2019-11-19 21:19:31,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:19:31,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:31,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:19:31,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:31,836 INFO L87 Difference]: Start difference. First operand 222 states and 330 transitions. Second operand 3 states. [2019-11-19 21:19:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:31,895 INFO L93 Difference]: Finished difference Result 626 states and 942 transitions. [2019-11-19 21:19:31,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:19:31,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-19 21:19:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:31,900 INFO L225 Difference]: With dead ends: 626 [2019-11-19 21:19:31,900 INFO L226 Difference]: Without dead ends: 423 [2019-11-19 21:19:31,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-11-19 21:19:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 278. [2019-11-19 21:19:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-11-19 21:19:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 434 transitions. [2019-11-19 21:19:31,935 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 434 transitions. Word has length 52 [2019-11-19 21:19:31,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:31,935 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 434 transitions. [2019-11-19 21:19:31,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:19:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 434 transitions. [2019-11-19 21:19:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-19 21:19:31,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:31,937 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:19:31,937 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:31,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:31,938 INFO L82 PathProgramCache]: Analyzing trace with hash -186933284, now seen corresponding path program 1 times [2019-11-19 21:19:31,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:31,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781400408] [2019-11-19 21:19:31,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:19:31,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781400408] [2019-11-19 21:19:31,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:31,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:19:31,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670844683] [2019-11-19 21:19:31,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:19:31,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:31,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:19:31,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:31,991 INFO L87 Difference]: Start difference. First operand 278 states and 434 transitions. Second operand 3 states. [2019-11-19 21:19:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:32,057 INFO L93 Difference]: Finished difference Result 792 states and 1250 transitions. [2019-11-19 21:19:32,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:19:32,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-19 21:19:32,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:32,062 INFO L225 Difference]: With dead ends: 792 [2019-11-19 21:19:32,062 INFO L226 Difference]: Without dead ends: 533 [2019-11-19 21:19:32,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-11-19 21:19:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 388. [2019-11-19 21:19:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-19 21:19:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 636 transitions. [2019-11-19 21:19:32,127 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 636 transitions. Word has length 53 [2019-11-19 21:19:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:32,129 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 636 transitions. [2019-11-19 21:19:32,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:19:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 636 transitions. [2019-11-19 21:19:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-19 21:19:32,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:32,130 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:19:32,131 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:32,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:32,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1955314594, now seen corresponding path program 1 times [2019-11-19 21:19:32,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:32,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543555186] [2019-11-19 21:19:32,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:19:32,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543555186] [2019-11-19 21:19:32,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:32,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:19:32,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481623972] [2019-11-19 21:19:32,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:19:32,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:32,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:19:32,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:32,181 INFO L87 Difference]: Start difference. First operand 388 states and 636 transitions. Second operand 3 states. [2019-11-19 21:19:32,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:32,243 INFO L93 Difference]: Finished difference Result 1118 states and 1848 transitions. [2019-11-19 21:19:32,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:19:32,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-19 21:19:32,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:32,249 INFO L225 Difference]: With dead ends: 1118 [2019-11-19 21:19:32,249 INFO L226 Difference]: Without dead ends: 749 [2019-11-19 21:19:32,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-11-19 21:19:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 604. [2019-11-19 21:19:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-11-19 21:19:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1028 transitions. [2019-11-19 21:19:32,295 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1028 transitions. Word has length 54 [2019-11-19 21:19:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:32,296 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1028 transitions. [2019-11-19 21:19:32,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:19:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1028 transitions. [2019-11-19 21:19:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-19 21:19:32,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:32,298 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:19:32,298 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:32,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1992051330, now seen corresponding path program 1 times [2019-11-19 21:19:32,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:32,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519320411] [2019-11-19 21:19:32,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:19:32,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519320411] [2019-11-19 21:19:32,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:32,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:19:32,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971424454] [2019-11-19 21:19:32,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:19:32,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:32,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:19:32,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:32,358 INFO L87 Difference]: Start difference. First operand 604 states and 1028 transitions. Second operand 3 states. [2019-11-19 21:19:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:32,437 INFO L93 Difference]: Finished difference Result 1758 states and 3008 transitions. [2019-11-19 21:19:32,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:19:32,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-19 21:19:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:32,444 INFO L225 Difference]: With dead ends: 1758 [2019-11-19 21:19:32,445 INFO L226 Difference]: Without dead ends: 1173 [2019-11-19 21:19:32,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2019-11-19 21:19:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1028. [2019-11-19 21:19:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-11-19 21:19:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1788 transitions. [2019-11-19 21:19:32,509 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1788 transitions. Word has length 55 [2019-11-19 21:19:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:32,510 INFO L462 AbstractCegarLoop]: Abstraction has 1028 states and 1788 transitions. [2019-11-19 21:19:32,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:19:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1788 transitions. [2019-11-19 21:19:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-19 21:19:32,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:32,513 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:19:32,513 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1363693892, now seen corresponding path program 1 times [2019-11-19 21:19:32,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:32,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084813731] [2019-11-19 21:19:32,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:19:32,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084813731] [2019-11-19 21:19:32,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:32,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:19:32,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036741868] [2019-11-19 21:19:32,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:19:32,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:32,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:19:32,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:32,558 INFO L87 Difference]: Start difference. First operand 1028 states and 1788 transitions. Second operand 3 states. [2019-11-19 21:19:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:32,668 INFO L93 Difference]: Finished difference Result 3014 states and 5256 transitions. [2019-11-19 21:19:32,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:19:32,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-19 21:19:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:32,680 INFO L225 Difference]: With dead ends: 3014 [2019-11-19 21:19:32,680 INFO L226 Difference]: Without dead ends: 2005 [2019-11-19 21:19:32,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:19:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-11-19 21:19:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1860. [2019-11-19 21:19:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2019-11-19 21:19:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 3260 transitions. [2019-11-19 21:19:32,789 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 3260 transitions. Word has length 56 [2019-11-19 21:19:32,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:32,790 INFO L462 AbstractCegarLoop]: Abstraction has 1860 states and 3260 transitions. [2019-11-19 21:19:32,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:19:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 3260 transitions. [2019-11-19 21:19:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 21:19:32,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:19:32,794 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:19:32,794 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:19:32,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:19:32,795 INFO L82 PathProgramCache]: Analyzing trace with hash 161239840, now seen corresponding path program 1 times [2019-11-19 21:19:32,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:19:32,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173413023] [2019-11-19 21:19:32,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:19:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:19:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 21:19:32,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173413023] [2019-11-19 21:19:32,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:19:32,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:19:32,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817721702] [2019-11-19 21:19:32,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:19:32,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:19:32,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:19:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:19:32,865 INFO L87 Difference]: Start difference. First operand 1860 states and 3260 transitions. Second operand 4 states. [2019-11-19 21:19:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:19:32,989 INFO L93 Difference]: Finished difference Result 1891 states and 3302 transitions. [2019-11-19 21:19:32,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:19:32,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-19 21:19:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:19:32,990 INFO L225 Difference]: With dead ends: 1891 [2019-11-19 21:19:32,990 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:19:32,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:19:32,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:19:32,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:19:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:19:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:19:32,994 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-19 21:19:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:19:32,995 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:19:32,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:19:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:19:32,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:19:33,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:19:33,688 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 114 [2019-11-19 21:19:34,018 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-11-19 21:19:34,320 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 154 [2019-11-19 21:19:34,776 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 152 [2019-11-19 21:19:35,142 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-11-19 21:19:35,263 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-11-19 21:19:35,369 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 114 [2019-11-19 21:19:35,554 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-11-19 21:19:35,949 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-11-19 21:19:36,206 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 20 [2019-11-19 21:19:36,492 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-11-19 21:19:36,617 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 22 [2019-11-19 21:19:36,906 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-11-19 21:19:37,657 WARN L191 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 32 [2019-11-19 21:19:37,962 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 30 [2019-11-19 21:19:38,121 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 26 [2019-11-19 21:19:38,402 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 24 [2019-11-19 21:19:38,906 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 34 [2019-11-19 21:19:39,802 WARN L191 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 16 [2019-11-19 21:19:40,147 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 28 [2019-11-19 21:19:40,430 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2019-11-19 21:19:41,430 WARN L191 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 16 [2019-11-19 21:19:41,708 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2019-11-19 21:19:41,969 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-11-19 21:19:42,163 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 19 [2019-11-19 21:19:42,466 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2019-11-19 21:19:42,981 WARN L191 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 34 [2019-11-19 21:19:43,496 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 34 [2019-11-19 21:19:44,099 WARN L191 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 32 [2019-11-19 21:19:44,418 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 16 [2019-11-19 21:19:44,555 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 22 [2019-11-19 21:19:45,073 WARN L191 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 34 [2019-11-19 21:19:45,458 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2019-11-19 21:19:45,462 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 197) no Hoare annotation was computed. [2019-11-19 21:19:45,462 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-11-19 21:19:45,463 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 337) no Hoare annotation was computed. [2019-11-19 21:19:45,463 INFO L440 ceAbstractionStarter]: At program point L366-1(lines 241 384) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,463 INFO L444 ceAbstractionStarter]: For program point L533(lines 533 537) no Hoare annotation was computed. [2019-11-19 21:19:45,463 INFO L440 ceAbstractionStarter]: At program point L533-2(lines 526 541) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-19 21:19:45,463 INFO L444 ceAbstractionStarter]: For program point L533-3(lines 533 537) no Hoare annotation was computed. [2019-11-19 21:19:45,464 INFO L440 ceAbstractionStarter]: At program point L533-5(lines 526 541) the Hoare annotation is: (let ((.cse2 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse4 .cse5 .cse6) (and .cse2 .cse1 (= 2 ULTIMATE.start_incoming_~client) .cse0 (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 .cse4 .cse5 .cse6))) [2019-11-19 21:19:45,464 INFO L444 ceAbstractionStarter]: For program point L533-6(lines 533 537) no Hoare annotation was computed. [2019-11-19 21:19:45,465 INFO L440 ceAbstractionStarter]: At program point L533-8(lines 526 541) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-19 21:19:45,466 INFO L440 ceAbstractionStarter]: At program point L303(lines 293 379) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,466 INFO L440 ceAbstractionStarter]: At program point L270(lines 260 382) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,466 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 178) no Hoare annotation was computed. [2019-11-19 21:19:45,466 INFO L444 ceAbstractionStarter]: For program point L2186(lines 2186 2197) no Hoare annotation was computed. [2019-11-19 21:19:45,467 INFO L447 ceAbstractionStarter]: At program point L171-1(lines 171 178) the Hoare annotation is: true [2019-11-19 21:19:45,467 INFO L444 ceAbstractionStarter]: For program point L2186-1(lines 2186 2197) no Hoare annotation was computed. [2019-11-19 21:19:45,468 INFO L444 ceAbstractionStarter]: For program point L2253(lines 2253 2265) no Hoare annotation was computed. [2019-11-19 21:19:45,468 INFO L444 ceAbstractionStarter]: For program point L2253-2(lines 2253 2265) no Hoare annotation was computed. [2019-11-19 21:19:45,468 INFO L444 ceAbstractionStarter]: For program point L2253-4(lines 2253 2265) no Hoare annotation was computed. [2019-11-19 21:19:45,468 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 448) no Hoare annotation was computed. [2019-11-19 21:19:45,468 INFO L444 ceAbstractionStarter]: For program point L437-1(lines 437 448) no Hoare annotation was computed. [2019-11-19 21:19:45,469 INFO L440 ceAbstractionStarter]: At program point L339(lines 329 376) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,469 INFO L444 ceAbstractionStarter]: For program point L2256(lines 2256 2264) no Hoare annotation was computed. [2019-11-19 21:19:45,469 INFO L444 ceAbstractionStarter]: For program point L2256-2(lines 2256 2264) no Hoare annotation was computed. [2019-11-19 21:19:45,469 INFO L444 ceAbstractionStarter]: For program point L2190(lines 2190 2196) no Hoare annotation was computed. [2019-11-19 21:19:45,470 INFO L444 ceAbstractionStarter]: For program point L2256-4(lines 2256 2264) no Hoare annotation was computed. [2019-11-19 21:19:45,470 INFO L444 ceAbstractionStarter]: For program point L2190-1(lines 2190 2196) no Hoare annotation was computed. [2019-11-19 21:19:45,470 INFO L444 ceAbstractionStarter]: For program point L308(lines 308 315) no Hoare annotation was computed. [2019-11-19 21:19:45,470 INFO L440 ceAbstractionStarter]: At program point L2389(lines 2384 2392) the Hoare annotation is: (let ((.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= ~rjh~0 2)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (= |ULTIMATE.start_isReadable_#res| 1) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 1 ULTIMATE.start_setEmailTo_~handle))) (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse3 (and .cse0 .cse1 .cse2) .cse5) .cse4))) [2019-11-19 21:19:45,471 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2019-11-19 21:19:45,471 INFO L444 ceAbstractionStarter]: For program point L242(lines 241 384) no Hoare annotation was computed. [2019-11-19 21:19:45,471 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-11-19 21:19:45,471 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 447) no Hoare annotation was computed. [2019-11-19 21:19:45,471 INFO L444 ceAbstractionStarter]: For program point L474-1(lines 474 485) no Hoare annotation was computed. [2019-11-19 21:19:45,471 INFO L444 ceAbstractionStarter]: For program point L441-1(lines 441 447) no Hoare annotation was computed. [2019-11-19 21:19:45,472 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 247) no Hoare annotation was computed. [2019-11-19 21:19:45,472 INFO L444 ceAbstractionStarter]: For program point L2259(lines 2259 2263) no Hoare annotation was computed. [2019-11-19 21:19:45,472 INFO L444 ceAbstractionStarter]: For program point L2259-3(lines 2259 2263) no Hoare annotation was computed. [2019-11-19 21:19:45,472 INFO L440 ceAbstractionStarter]: At program point L2259-2(lines 1 2539) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2019-11-19 21:19:45,473 INFO L440 ceAbstractionStarter]: At program point L2259-5(lines 1 2539) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (= ~rjh~0 ULTIMATE.start_setClientId_~handle) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,473 INFO L444 ceAbstractionStarter]: For program point L2259-6(lines 2259 2263) no Hoare annotation was computed. [2019-11-19 21:19:45,473 INFO L440 ceAbstractionStarter]: At program point L2259-8(lines 1 2539) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,473 INFO L444 ceAbstractionStarter]: For program point L344(lines 344 348) no Hoare annotation was computed. [2019-11-19 21:19:45,473 INFO L447 ceAbstractionStarter]: At program point L179(lines 161 181) the Hoare annotation is: true [2019-11-19 21:19:45,474 INFO L440 ceAbstractionStarter]: At program point L2195-1(lines 2178 2201) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (not (= ~rjh~0 1)) (= |ULTIMATE.start_getClientForwardReceiver_#res| 0) .cse1 (not (= 1 ULTIMATE.start_createEmail_~to)) .cse2) (and (= 2 ULTIMATE.start_createEmail_~to) (and .cse0 .cse1 .cse2) (= ~rjh~0 2)))) [2019-11-19 21:19:45,474 INFO L440 ceAbstractionStarter]: At program point L2195(lines 2178 2201) the Hoare annotation is: (and (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_incoming_~client) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-19 21:19:45,474 INFO L444 ceAbstractionStarter]: For program point L511(lines 511 522) no Hoare annotation was computed. [2019-11-19 21:19:45,474 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 484) no Hoare annotation was computed. [2019-11-19 21:19:45,475 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 511 522) no Hoare annotation was computed. [2019-11-19 21:19:45,475 INFO L444 ceAbstractionStarter]: For program point L511-2(lines 511 522) no Hoare annotation was computed. [2019-11-19 21:19:45,475 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 478 484) no Hoare annotation was computed. [2019-11-19 21:19:45,475 INFO L444 ceAbstractionStarter]: For program point L511-3(lines 511 522) no Hoare annotation was computed. [2019-11-19 21:19:45,475 INFO L444 ceAbstractionStarter]: For program point L2229-1(lines 2229 2245) no Hoare annotation was computed. [2019-11-19 21:19:45,475 INFO L444 ceAbstractionStarter]: For program point L2229(lines 2229 2245) no Hoare annotation was computed. [2019-11-19 21:19:45,476 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 123) no Hoare annotation was computed. [2019-11-19 21:19:45,476 INFO L440 ceAbstractionStarter]: At program point L446(lines 433 451) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse1 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse4 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse6 .cse7 .cse8)) (and .cse0 .cse1 (and .cse4 .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse2 (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse5 .cse6 .cse7 .cse8)))) [2019-11-19 21:19:45,476 INFO L447 ceAbstractionStarter]: At program point L446-1(lines 433 451) the Hoare annotation is: true [2019-11-19 21:19:45,477 INFO L440 ceAbstractionStarter]: At program point L281(lines 271 381) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,477 INFO L440 ceAbstractionStarter]: At program point L2528(lines 1 2539) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2019-11-19 21:19:45,477 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 383) no Hoare annotation was computed. [2019-11-19 21:19:45,477 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 521) no Hoare annotation was computed. [2019-11-19 21:19:45,477 INFO L444 ceAbstractionStarter]: For program point L515-1(lines 515 521) no Hoare annotation was computed. [2019-11-19 21:19:45,478 INFO L444 ceAbstractionStarter]: For program point L515-2(lines 515 521) no Hoare annotation was computed. [2019-11-19 21:19:45,478 INFO L444 ceAbstractionStarter]: For program point L515-3(lines 515 521) no Hoare annotation was computed. [2019-11-19 21:19:45,478 INFO L440 ceAbstractionStarter]: At program point L2398(lines 2393 2401) the Hoare annotation is: (let ((.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= ~rjh~0 2)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (= |ULTIMATE.start_isReadable_#res| 1) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 1 ULTIMATE.start_setEmailTo_~handle))) (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse3 (and .cse0 .cse1 .cse2) .cse5) .cse4))) [2019-11-19 21:19:45,478 INFO L440 ceAbstractionStarter]: At program point L350(lines 340 375) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,479 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:19:45,479 INFO L440 ceAbstractionStarter]: At program point L317(lines 304 378) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,479 INFO L444 ceAbstractionStarter]: For program point L2233-1(lines 2233 2244) no Hoare annotation was computed. [2019-11-19 21:19:45,479 INFO L444 ceAbstractionStarter]: For program point L2233(lines 2233 2244) no Hoare annotation was computed. [2019-11-19 21:19:45,479 INFO L440 ceAbstractionStarter]: At program point L483(lines 470 488) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse1 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse4 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse6 .cse7 .cse8)) (and .cse0 .cse1 (and .cse4 .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse2 (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse5 .cse6 .cse7 .cse8)))) [2019-11-19 21:19:45,480 INFO L447 ceAbstractionStarter]: At program point L483-1(lines 470 488) the Hoare annotation is: true [2019-11-19 21:19:45,480 INFO L440 ceAbstractionStarter]: At program point L385(lines 240 386) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,480 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 290) no Hoare annotation was computed. [2019-11-19 21:19:45,480 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 257) no Hoare annotation was computed. [2019-11-19 21:19:45,480 INFO L440 ceAbstractionStarter]: At program point L2335-1(lines 1 2539) the Hoare annotation is: (let ((.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= ~rjh~0 2)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (= |ULTIMATE.start_isReadable_#res| 1) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 1 ULTIMATE.start_setEmailTo_~handle))) (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse3 (and .cse0 .cse1 .cse2) .cse5) .cse4))) [2019-11-19 21:19:45,481 INFO L444 ceAbstractionStarter]: For program point L2335(lines 2335 2342) no Hoare annotation was computed. [2019-11-19 21:19:45,481 INFO L444 ceAbstractionStarter]: For program point L2335-2(lines 2335 2342) no Hoare annotation was computed. [2019-11-19 21:19:45,481 INFO L440 ceAbstractionStarter]: At program point L2501(lines 2490 2504) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-19 21:19:45,481 INFO L444 ceAbstractionStarter]: For program point L2237-1(lines 2237 2243) no Hoare annotation was computed. [2019-11-19 21:19:45,481 INFO L444 ceAbstractionStarter]: For program point L2237(lines 2237 2243) no Hoare annotation was computed. [2019-11-19 21:19:45,482 INFO L440 ceAbstractionStarter]: At program point L520(lines 507 525) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-19 21:19:45,482 INFO L440 ceAbstractionStarter]: At program point L520-1(lines 507 525) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse1 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse2 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse7 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 (= ~__ste_email_to0~0 2) .cse3 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse4 .cse5 .cse6 .cse7)) (and .cse0 .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= 1 ULTIMATE.start_setEmailTo_~handle))))) [2019-11-19 21:19:45,482 INFO L440 ceAbstractionStarter]: At program point L520-2(lines 507 525) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-19 21:19:45,482 INFO L447 ceAbstractionStarter]: At program point L520-3(lines 507 525) the Hoare annotation is: true [2019-11-19 21:19:45,483 INFO L447 ceAbstractionStarter]: At program point L2469-1(lines 2444 2471) the Hoare annotation is: true [2019-11-19 21:19:45,483 INFO L440 ceAbstractionStarter]: At program point L2469(lines 2444 2471) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse1 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse2 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse7 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 (= ~__ste_email_to0~0 2) .cse3 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse4 .cse5 .cse6 .cse7)) (and .cse0 .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= 1 ULTIMATE.start_setEmailTo_~handle))))) [2019-11-19 21:19:45,483 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 359) no Hoare annotation was computed. [2019-11-19 21:19:45,483 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 326) no Hoare annotation was computed. [2019-11-19 21:19:45,483 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:19:45,484 INFO L444 ceAbstractionStarter]: For program point L1181(lines 1181 1187) no Hoare annotation was computed. [2019-11-19 21:19:45,484 INFO L444 ceAbstractionStarter]: For program point L1181-2(lines 1181 1187) no Hoare annotation was computed. [2019-11-19 21:19:45,484 INFO L440 ceAbstractionStarter]: At program point L2536(lines 2531 2539) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2019-11-19 21:19:45,484 INFO L444 ceAbstractionStarter]: For program point L2206(lines 2206 2218) no Hoare annotation was computed. [2019-11-19 21:19:45,484 INFO L440 ceAbstractionStarter]: At program point L158(lines 138 160) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,485 INFO L440 ceAbstractionStarter]: At program point L292(lines 282 380) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,485 INFO L440 ceAbstractionStarter]: At program point L259(lines 249 383) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,485 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:19:45,485 INFO L440 ceAbstractionStarter]: At program point L2407(lines 2402 2410) the Hoare annotation is: (let ((.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= ~rjh~0 2)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (= |ULTIMATE.start_isReadable_#res| 1) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 1 ULTIMATE.start_setEmailTo_~handle))) (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse3 (and .cse0 .cse1 .cse2) .cse5) .cse4))) [2019-11-19 21:19:45,486 INFO L440 ceAbstractionStarter]: At program point L2242(lines 2225 2248) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-19 21:19:45,486 INFO L444 ceAbstractionStarter]: For program point L2209(lines 2209 2217) no Hoare annotation was computed. [2019-11-19 21:19:45,486 INFO L440 ceAbstractionStarter]: At program point L2242-1(lines 2225 2248) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse0 (= 2 ULTIMATE.start_incoming_~client) .cse1 .cse2) .cse3) (and (and (and .cse1 .cse0 .cse2) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (= |ULTIMATE.start_isReadable_#res| 1)))) [2019-11-19 21:19:45,486 INFO L444 ceAbstractionStarter]: For program point L493(lines 493 501) no Hoare annotation was computed. [2019-11-19 21:19:45,486 INFO L444 ceAbstractionStarter]: For program point L493-2(lines 493 501) no Hoare annotation was computed. [2019-11-19 21:19:45,487 INFO L440 ceAbstractionStarter]: At program point L361(lines 351 374) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,487 INFO L444 ceAbstractionStarter]: For program point L493-4(lines 493 501) no Hoare annotation was computed. [2019-11-19 21:19:45,487 INFO L440 ceAbstractionStarter]: At program point L328(lines 318 377) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,487 INFO L444 ceAbstractionStarter]: For program point L2212(lines 2212 2216) no Hoare annotation was computed. [2019-11-19 21:19:45,487 INFO L444 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-19 21:19:45,488 INFO L444 ceAbstractionStarter]: For program point L197-1(line 197) no Hoare annotation was computed. [2019-11-19 21:19:45,488 INFO L440 ceAbstractionStarter]: At program point L2212-2(lines 1 2539) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-19 21:19:45,488 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:19:45,488 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 197) no Hoare annotation was computed. [2019-11-19 21:19:45,488 INFO L440 ceAbstractionStarter]: At program point L2477-1(lines 2472 2480) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse1 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse2 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse7 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 (= ~__ste_email_to0~0 2) .cse3 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse4 .cse5 .cse6 .cse7)) (and .cse0 .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= 1 ULTIMATE.start_setEmailTo_~handle))))) [2019-11-19 21:19:45,489 INFO L440 ceAbstractionStarter]: At program point L2477(lines 2472 2480) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse3 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse7 (= ~rjh~0 2))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse5 .cse6 .cse7)) (and .cse0 (and .cse3 .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse1 (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 .cse5 .cse6 .cse7)))) [2019-11-19 21:19:45,489 INFO L447 ceAbstractionStarter]: At program point L2477-3(lines 2472 2480) the Hoare annotation is: true [2019-11-19 21:19:45,489 INFO L440 ceAbstractionStarter]: At program point L2477-2(lines 2472 2480) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_isReadable_#res| 1) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-19 21:19:45,489 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 301) no Hoare annotation was computed. [2019-11-19 21:19:45,490 INFO L440 ceAbstractionStarter]: At program point L2312(lines 1 2539) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= 2 ULTIMATE.start_incoming_~client) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-19 21:19:45,490 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 268) no Hoare annotation was computed. [2019-11-19 21:19:45,490 INFO L440 ceAbstractionStarter]: At program point L198(lines 1173 1190) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse1 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse4 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse6 .cse7 .cse8)) (and .cse0 .cse1 (and .cse4 .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse2 (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse5 .cse6 .cse7 .cse8)))) [2019-11-19 21:19:45,490 INFO L440 ceAbstractionStarter]: At program point L2312-1(lines 1 2539) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-19 21:19:45,490 INFO L447 ceAbstractionStarter]: At program point L198-1(lines 1173 1190) the Hoare annotation is: true [2019-11-19 21:19:45,491 INFO L444 ceAbstractionStarter]: For program point L496(lines 496 500) no Hoare annotation was computed. [2019-11-19 21:19:45,491 INFO L440 ceAbstractionStarter]: At program point L496-2(lines 489 504) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_createEmail_~to) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-19 21:19:45,491 INFO L444 ceAbstractionStarter]: For program point L496-3(lines 496 500) no Hoare annotation was computed. [2019-11-19 21:19:45,491 INFO L440 ceAbstractionStarter]: At program point L496-5(lines 489 504) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-19 21:19:45,491 INFO L444 ceAbstractionStarter]: For program point L496-6(lines 496 500) no Hoare annotation was computed. [2019-11-19 21:19:45,492 INFO L440 ceAbstractionStarter]: At program point L496-8(lines 489 504) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse0 (= 2 ULTIMATE.start_incoming_~client) .cse1 .cse2) .cse3) (and (and (and .cse1 .cse0 .cse2) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (= |ULTIMATE.start_isReadable_#res| 1)))) [2019-11-19 21:19:45,492 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 538) no Hoare annotation was computed. [2019-11-19 21:19:45,492 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 538) no Hoare annotation was computed. [2019-11-19 21:19:45,492 INFO L444 ceAbstractionStarter]: For program point L530-4(lines 530 538) no Hoare annotation was computed. [2019-11-19 21:19:45,492 INFO L444 ceAbstractionStarter]: For program point L2182(lines 2182 2198) no Hoare annotation was computed. [2019-11-19 21:19:45,493 INFO L444 ceAbstractionStarter]: For program point L2182-1(lines 2182 2198) no Hoare annotation was computed. [2019-11-19 21:19:45,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:19:45 BoogieIcfgContainer [2019-11-19 21:19:45,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:19:45,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:19:45,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:19:45,533 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:19:45,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:19:27" (3/4) ... [2019-11-19 21:19:45,538 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:19:45,570 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 69 nodes and edges [2019-11-19 21:19:45,573 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2019-11-19 21:19:45,575 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-19 21:19:45,576 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 21:19:45,635 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-19 21:19:45,635 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-19 21:19:45,636 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-19 21:19:45,636 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-19 21:19:45,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && 2 == client) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-19 21:19:45,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == handle && handle == 3) && 2 == client) && 1 == handle) && value == 2) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-19 21:19:45,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) [2019-11-19 21:19:45,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-11-19 21:19:45,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) [2019-11-19 21:19:45,639 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) [2019-11-19 21:19:45,639 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 1 && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || (\result == 1 && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-11-19 21:19:45,639 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) [2019-11-19 21:19:45,639 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-11-19 21:19:45,640 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((__ste_email_to0 == 2 && 2 == handle) && handle == 3 && \result == 1) && 2 == client) && 2 == to) && rjh == 2) && 1 == msg) || ((((((2 == to && handle == 3 && \result == 1) && rjh == 2) && 1 == handle) && 1 == msg) && tmp == 1) && \result == 1) [2019-11-19 21:19:45,640 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-11-19 21:19:45,640 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((__ste_email_to0 == 2 && 2 == handle) && handle == 3 && \result == 1) && 2 == client) && 2 == to) && rjh == 2) && 1 == msg) || ((((((2 == to && handle == 3 && \result == 1) && rjh == 2) && 1 == handle) && 1 == msg) && tmp == 1) && \result == 1) [2019-11-19 21:19:45,641 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-11-19 21:19:45,641 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-19 21:19:45,642 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && 2 == handle) && 2 == client) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) [2019-11-19 21:19:45,642 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-19 21:19:45,642 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == 3 && !(rjh == 1)) && \result == 0) && \result == 1) && !(1 == to)) && 1 == msg) || ((2 == to && (handle == 3 && \result == 1) && 1 == msg) && rjh == 2) [2019-11-19 21:19:45,643 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && 2 == handle) && 2 == client) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) [2019-11-19 21:19:45,643 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && 2 == handle) && 2 == client) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) [2019-11-19 21:19:45,643 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-19 21:19:45,644 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-19 21:19:45,750 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:19:45,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:19:45,752 INFO L168 Benchmark]: Toolchain (without parser) took 20314.73 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 537.4 MB). Free memory was 955.0 MB in the beginning and 912.2 MB in the end (delta: 42.8 MB). Peak memory consumption was 580.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:19:45,753 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:19:45,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 874.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:19:45,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.81 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 21:19:45,754 INFO L168 Benchmark]: Boogie Preprocessor took 79.52 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:19:45,754 INFO L168 Benchmark]: RCFGBuilder took 1285.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 100.4 MB). Peak memory consumption was 100.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:19:45,755 INFO L168 Benchmark]: TraceAbstraction took 17741.04 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 385.9 MB). Free memory was 1.0 GB in the beginning and 939.9 MB in the end (delta: 61.1 MB). Peak memory consumption was 447.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:19:45,755 INFO L168 Benchmark]: Witness Printer took 218.06 ms. Allocated memory is still 1.6 GB. Free memory was 939.9 MB in the beginning and 912.2 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:19:45,757 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 874.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.81 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 79.52 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1285.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 100.4 MB). Peak memory consumption was 100.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17741.04 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 385.9 MB). Free memory was 1.0 GB in the beginning and 939.9 MB in the end (delta: 61.1 MB). Peak memory consumption was 447.0 MB. Max. memory is 11.5 GB. * Witness Printer took 218.06 ms. Allocated memory is still 1.6 GB. Free memory was 939.9 MB in the beginning and 912.2 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 197]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 197]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2490]: Loop Invariant Derived loop invariant: ((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1173]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 470]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 2444]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2225]: Loop Invariant Derived loop invariant: (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1173]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 470]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2225]: Loop Invariant Derived loop invariant: ((((((__ste_email_to0 == 2 && 2 == handle) && handle == 3 && \result == 1) && 2 == client) && 2 == to) && rjh == 2) && 1 == msg) || ((((((2 == to && handle == 3 && \result == 1) && rjh == 2) && 1 == handle) && 1 == msg) && tmp == 1) && \result == 1) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((handle == 3 && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2178]: Loop Invariant Derived loop invariant: (((((((((((1 == handle && handle == 3) && 2 == client) && 1 == handle) && value == 2) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2178]: Loop Invariant Derived loop invariant: (((((handle == 3 && !(rjh == 1)) && \result == 0) && \result == 1) && !(1 == to)) && 1 == msg) || ((2 == to && (handle == 3 && \result == 1) && 1 == msg) && rjh == 2) - InvariantResult [Line: 2402]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && 2 == client) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && 2 == handle) && 2 == client) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2444]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && 2 == handle) && 2 == client) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) - InvariantResult [Line: 2472]: Loop Invariant Derived loop invariant: (\result == 1 && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || (\result == 1 && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 2472]: Loop Invariant Derived loop invariant: ((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2472]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && 2 == handle) && 2 == client) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) - InvariantResult [Line: 2472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2384]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: ((((((__ste_email_to0 == 2 && 2 == handle) && handle == 3 && \result == 1) && 2 == client) && 2 == to) && rjh == 2) && 1 == msg) || ((((((2 == to && handle == 3 && \result == 1) && rjh == 2) && 1 == handle) && 1 == msg) && tmp == 1) && \result == 1) - InvariantResult [Line: 2531]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((__ste_client_forwardReceiver1 == 0 && rjh == handle) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == to) && !(__ste_email_to0 == 1)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((handle == 3 && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2393]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((__ste_email_to0 == 2 && handle == 3) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 318]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 134 locations, 2 error locations. Result: SAFE, OverallTime: 17.6s, OverallIterations: 15, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.4s, HoareTripleCheckerStatistics: 2997 SDtfs, 4251 SDslu, 5307 SDs, 0 SdLazy, 496 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1860occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 1644 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 54 PreInvPairs, 917 NumberOfFragments, 1479 HoareAnnotationTreeSize, 54 FomulaSimplifications, 8612669 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 54 FomulaSimplificationsInter, 908320 FormulaSimplificationTreeSizeReductionInter, 9.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 692 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 677 ConstructedInterpolants, 0 QuantifiedInterpolants, 46893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 22/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...