./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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_product11.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a08fcb94ae52c696817c83486fe27cfd2e5e20c4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 08:30:46,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 08:30:46,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 08:30:46,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 08:30:46,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 08:30:46,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 08:30:46,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 08:30:46,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 08:30:46,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 08:30:46,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 08:30:46,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 08:30:46,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 08:30:46,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 08:30:46,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 08:30:46,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 08:30:46,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 08:30:46,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 08:30:46,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 08:30:46,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 08:30:46,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 08:30:46,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 08:30:46,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 08:30:46,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 08:30:46,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 08:30:46,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 08:30:46,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 08:30:46,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 08:30:46,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 08:30:46,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 08:30:46,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 08:30:46,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 08:30:46,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 08:30:46,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 08:30:46,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 08:30:46,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 08:30:46,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 08:30:46,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 08:30:46,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 08:30:46,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 08:30:46,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 08:30:46,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 08:30:46,627 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 08:30:46,648 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 08:30:46,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 08:30:46,648 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 08:30:46,648 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 08:30:46,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 08:30:46,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 08:30:46,649 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 08:30:46,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 08:30:46,650 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 08:30:46,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 08:30:46,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 08:30:46,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 08:30:46,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 08:30:46,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 08:30:46,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 08:30:46,651 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 08:30:46,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 08:30:46,651 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 08:30:46,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 08:30:46,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 08:30:46,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 08:30:46,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 08:30:46,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 08:30:46,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 08:30:46,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 08:30:46,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 08:30:46,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 08:30:46,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 08:30:46,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 08:30:46,652 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 08:30:46,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> a08fcb94ae52c696817c83486fe27cfd2e5e20c4 [2021-08-26 08:30:46,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 08:30:46,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 08:30:46,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 08:30:46,924 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 08:30:46,924 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 08:30:46,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product11.cil.c [2021-08-26 08:30:46,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4b08498/cb1ec8ced62741eda23df15989335aac/FLAG3d379ffcf [2021-08-26 08:30:47,439 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 08:30:47,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product11.cil.c [2021-08-26 08:30:47,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4b08498/cb1ec8ced62741eda23df15989335aac/FLAG3d379ffcf [2021-08-26 08:30:47,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4b08498/cb1ec8ced62741eda23df15989335aac [2021-08-26 08:30:47,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 08:30:47,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 08:30:47,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 08:30:47,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 08:30:47,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 08:30:47,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:30:47" (1/1) ... [2021-08-26 08:30:47,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6657d5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:47, skipping insertion in model container [2021-08-26 08:30:47,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:30:47" (1/1) ... [2021-08-26 08:30:47,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 08:30:48,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 08:30:48,338 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product11.cil.c[59393,59406] [2021-08-26 08:30:48,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 08:30:48,351 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 08:30:48,452 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product11.cil.c[59393,59406] [2021-08-26 08:30:48,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 08:30:48,475 INFO L208 MainTranslator]: Completed translation [2021-08-26 08:30:48,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:48 WrapperNode [2021-08-26 08:30:48,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 08:30:48,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 08:30:48,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 08:30:48,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 08:30:48,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:48" (1/1) ... [2021-08-26 08:30:48,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:48" (1/1) ... [2021-08-26 08:30:48,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 08:30:48,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 08:30:48,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 08:30:48,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 08:30:48,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:48" (1/1) ... [2021-08-26 08:30:48,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:48" (1/1) ... [2021-08-26 08:30:48,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:48" (1/1) ... [2021-08-26 08:30:48,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:48" (1/1) ... [2021-08-26 08:30:48,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:48" (1/1) ... [2021-08-26 08:30:48,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:48" (1/1) ... [2021-08-26 08:30:48,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:48" (1/1) ... [2021-08-26 08:30:48,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 08:30:48,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 08:30:48,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 08:30:48,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 08:30:48,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:48" (1/1) ... [2021-08-26 08:30:48,666 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 08:30:48,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:30:48,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 08:30:48,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 08:30:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2021-08-26 08:30:48,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 08:30:48,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 08:30:48,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 08:30:48,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 08:30:49,911 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 08:30:49,912 INFO L299 CfgBuilder]: Removed 219 assume(true) statements. [2021-08-26 08:30:49,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:30:49 BoogieIcfgContainer [2021-08-26 08:30:49,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 08:30:49,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 08:30:49,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 08:30:49,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 08:30:49,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:30:47" (1/3) ... [2021-08-26 08:30:49,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1812b54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:30:49, skipping insertion in model container [2021-08-26 08:30:49,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:48" (2/3) ... [2021-08-26 08:30:49,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1812b54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:30:49, skipping insertion in model container [2021-08-26 08:30:49,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:30:49" (3/3) ... [2021-08-26 08:30:49,921 INFO L111 eAbstractionObserver]: Analyzing ICFG email_spec0_product11.cil.c [2021-08-26 08:30:49,924 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 08:30:49,925 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 08:30:49,955 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 08:30:49,961 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 08:30:49,961 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-26 08:30:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 329 states, 326 states have (on average 1.7546012269938651) internal successors, (572), 328 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:49,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-26 08:30:49,989 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:49,989 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:49,990 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:49,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash 48512962, now seen corresponding path program 1 times [2021-08-26 08:30:50,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:50,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149101001] [2021-08-26 08:30:50,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:50,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:50,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:50,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149101001] [2021-08-26 08:30:50,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149101001] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:50,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:50,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:50,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722745995] [2021-08-26 08:30:50,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:50,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:50,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:50,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:50,259 INFO L87 Difference]: Start difference. First operand has 329 states, 326 states have (on average 1.7546012269938651) internal successors, (572), 328 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:50,363 INFO L93 Difference]: Finished difference Result 952 states and 1658 transitions. [2021-08-26 08:30:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:50,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-08-26 08:30:50,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:50,381 INFO L225 Difference]: With dead ends: 952 [2021-08-26 08:30:50,381 INFO L226 Difference]: Without dead ends: 606 [2021-08-26 08:30:50,387 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-08-26 08:30:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 312. [2021-08-26 08:30:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 310 states have (on average 1.738709677419355) internal successors, (539), 311 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 539 transitions. [2021-08-26 08:30:50,459 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 539 transitions. Word has length 40 [2021-08-26 08:30:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:50,460 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 539 transitions. [2021-08-26 08:30:50,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 539 transitions. [2021-08-26 08:30:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-26 08:30:50,466 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:50,467 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:50,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 08:30:50,467 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:50,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash 802740885, now seen corresponding path program 1 times [2021-08-26 08:30:50,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:50,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103387308] [2021-08-26 08:30:50,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:50,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:50,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:50,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103387308] [2021-08-26 08:30:50,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103387308] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:50,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:50,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 08:30:50,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941535551] [2021-08-26 08:30:50,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:30:50,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:50,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:30:50,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:50,581 INFO L87 Difference]: Start difference. First operand 312 states and 539 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:50,714 INFO L93 Difference]: Finished difference Result 885 states and 1533 transitions. [2021-08-26 08:30:50,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 08:30:50,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-08-26 08:30:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:50,717 INFO L225 Difference]: With dead ends: 885 [2021-08-26 08:30:50,717 INFO L226 Difference]: Without dead ends: 592 [2021-08-26 08:30:50,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 20.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 08:30:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-08-26 08:30:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 312. [2021-08-26 08:30:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 310 states have (on average 1.735483870967742) internal successors, (538), 311 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 538 transitions. [2021-08-26 08:30:50,733 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 538 transitions. Word has length 42 [2021-08-26 08:30:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:50,733 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 538 transitions. [2021-08-26 08:30:50,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 538 transitions. [2021-08-26 08:30:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-26 08:30:50,736 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:50,736 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:50,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 08:30:50,737 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:50,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:50,737 INFO L82 PathProgramCache]: Analyzing trace with hash -447724126, now seen corresponding path program 1 times [2021-08-26 08:30:50,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:50,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638790229] [2021-08-26 08:30:50,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:50,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:50,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:50,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638790229] [2021-08-26 08:30:50,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638790229] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:50,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:50,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:50,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001591215] [2021-08-26 08:30:50,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:50,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:50,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:50,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:50,802 INFO L87 Difference]: Start difference. First operand 312 states and 538 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:50,822 INFO L93 Difference]: Finished difference Result 606 states and 1050 transitions. [2021-08-26 08:30:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:50,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-08-26 08:30:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:50,824 INFO L225 Difference]: With dead ends: 606 [2021-08-26 08:30:50,824 INFO L226 Difference]: Without dead ends: 317 [2021-08-26 08:30:50,824 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-08-26 08:30:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 312. [2021-08-26 08:30:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 310 states have (on average 1.732258064516129) internal successors, (537), 311 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 537 transitions. [2021-08-26 08:30:50,831 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 537 transitions. Word has length 43 [2021-08-26 08:30:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:50,831 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 537 transitions. [2021-08-26 08:30:50,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 537 transitions. [2021-08-26 08:30:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-26 08:30:50,832 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:50,832 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:50,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 08:30:50,833 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:50,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1057269480, now seen corresponding path program 1 times [2021-08-26 08:30:50,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:50,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266848294] [2021-08-26 08:30:50,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:50,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:50,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:50,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266848294] [2021-08-26 08:30:50,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266848294] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:50,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:50,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:50,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139783212] [2021-08-26 08:30:50,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:50,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:50,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:50,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:50,910 INFO L87 Difference]: Start difference. First operand 312 states and 537 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:50,929 INFO L93 Difference]: Finished difference Result 616 states and 1063 transitions. [2021-08-26 08:30:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:50,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-08-26 08:30:50,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:50,932 INFO L225 Difference]: With dead ends: 616 [2021-08-26 08:30:50,932 INFO L226 Difference]: Without dead ends: 312 [2021-08-26 08:30:50,933 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-08-26 08:30:50,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-08-26 08:30:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 310 states have (on average 1.7258064516129032) internal successors, (535), 311 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 535 transitions. [2021-08-26 08:30:50,941 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 535 transitions. Word has length 44 [2021-08-26 08:30:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:50,941 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 535 transitions. [2021-08-26 08:30:50,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 535 transitions. [2021-08-26 08:30:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-26 08:30:50,942 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:50,943 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:50,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 08:30:50,943 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:50,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:50,944 INFO L82 PathProgramCache]: Analyzing trace with hash -806251715, now seen corresponding path program 1 times [2021-08-26 08:30:50,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:50,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86811426] [2021-08-26 08:30:50,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:50,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:50,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:50,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86811426] [2021-08-26 08:30:50,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86811426] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:50,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:50,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 08:30:50,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793135859] [2021-08-26 08:30:50,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:30:50,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:50,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:30:50,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:50,989 INFO L87 Difference]: Start difference. First operand 312 states and 535 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:51,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:51,093 INFO L93 Difference]: Finished difference Result 875 states and 1513 transitions. [2021-08-26 08:30:51,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 08:30:51,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-26 08:30:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:51,098 INFO L225 Difference]: With dead ends: 875 [2021-08-26 08:30:51,098 INFO L226 Difference]: Without dead ends: 590 [2021-08-26 08:30:51,099 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 08:30:51,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2021-08-26 08:30:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 312. [2021-08-26 08:30:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 310 states have (on average 1.7225806451612904) internal successors, (534), 311 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 534 transitions. [2021-08-26 08:30:51,109 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 534 transitions. Word has length 45 [2021-08-26 08:30:51,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:51,111 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 534 transitions. [2021-08-26 08:30:51,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 534 transitions. [2021-08-26 08:30:51,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-26 08:30:51,112 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:51,113 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:51,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 08:30:51,113 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:51,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:51,113 INFO L82 PathProgramCache]: Analyzing trace with hash -692287456, now seen corresponding path program 1 times [2021-08-26 08:30:51,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:51,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976143507] [2021-08-26 08:30:51,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:51,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:51,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:51,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976143507] [2021-08-26 08:30:51,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976143507] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:51,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:51,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 08:30:51,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634235910] [2021-08-26 08:30:51,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:30:51,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:51,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:30:51,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:51,201 INFO L87 Difference]: Start difference. First operand 312 states and 534 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:51,307 INFO L93 Difference]: Finished difference Result 880 states and 1518 transitions. [2021-08-26 08:30:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 08:30:51,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-08-26 08:30:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:51,310 INFO L225 Difference]: With dead ends: 880 [2021-08-26 08:30:51,314 INFO L226 Difference]: Without dead ends: 595 [2021-08-26 08:30:51,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 08:30:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-08-26 08:30:51,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 312. [2021-08-26 08:30:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 310 states have (on average 1.7193548387096773) internal successors, (533), 311 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 533 transitions. [2021-08-26 08:30:51,328 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 533 transitions. Word has length 46 [2021-08-26 08:30:51,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:51,329 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 533 transitions. [2021-08-26 08:30:51,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 533 transitions. [2021-08-26 08:30:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-26 08:30:51,330 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:51,330 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:51,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 08:30:51,331 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1299263688, now seen corresponding path program 1 times [2021-08-26 08:30:51,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:51,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982505861] [2021-08-26 08:30:51,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:51,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:51,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:51,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982505861] [2021-08-26 08:30:51,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982505861] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:51,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:51,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:51,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995909470] [2021-08-26 08:30:51,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:51,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:51,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:51,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:51,392 INFO L87 Difference]: Start difference. First operand 312 states and 533 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:51,414 INFO L93 Difference]: Finished difference Result 386 states and 642 transitions. [2021-08-26 08:30:51,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:51,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-08-26 08:30:51,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:51,417 INFO L225 Difference]: With dead ends: 386 [2021-08-26 08:30:51,417 INFO L226 Difference]: Without dead ends: 315 [2021-08-26 08:30:51,417 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-08-26 08:30:51,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2021-08-26 08:30:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 312 states have (on average 1.7147435897435896) internal successors, (535), 313 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 535 transitions. [2021-08-26 08:30:51,427 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 535 transitions. Word has length 47 [2021-08-26 08:30:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:51,428 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 535 transitions. [2021-08-26 08:30:51,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 535 transitions. [2021-08-26 08:30:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-26 08:30:51,429 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:51,429 INFO L512 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] [2021-08-26 08:30:51,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 08:30:51,429 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:51,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:51,430 INFO L82 PathProgramCache]: Analyzing trace with hash -527622090, now seen corresponding path program 1 times [2021-08-26 08:30:51,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:51,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130528796] [2021-08-26 08:30:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:51,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:51,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:51,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130528796] [2021-08-26 08:30:51,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130528796] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:51,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:51,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:51,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660052106] [2021-08-26 08:30:51,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:51,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:51,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:51,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:51,491 INFO L87 Difference]: Start difference. First operand 314 states and 535 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:51,512 INFO L93 Difference]: Finished difference Result 828 states and 1429 transitions. [2021-08-26 08:30:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:51,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-08-26 08:30:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:51,516 INFO L225 Difference]: With dead ends: 828 [2021-08-26 08:30:51,516 INFO L226 Difference]: Without dead ends: 545 [2021-08-26 08:30:51,517 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:51,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-08-26 08:30:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 474. [2021-08-26 08:30:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 472 states have (on average 1.7542372881355932) internal successors, (828), 473 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 828 transitions. [2021-08-26 08:30:51,535 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 828 transitions. Word has length 53 [2021-08-26 08:30:51,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:51,536 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 828 transitions. [2021-08-26 08:30:51,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 828 transitions. [2021-08-26 08:30:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-26 08:30:51,537 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:51,537 INFO L512 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] [2021-08-26 08:30:51,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 08:30:51,537 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:51,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:51,538 INFO L82 PathProgramCache]: Analyzing trace with hash 424261333, now seen corresponding path program 1 times [2021-08-26 08:30:51,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:51,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379966176] [2021-08-26 08:30:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:51,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:51,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:51,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379966176] [2021-08-26 08:30:51,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379966176] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:30:51,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231204965] [2021-08-26 08:30:51,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:51,590 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:30:51,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:30:51,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:30:51,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 08:30:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:51,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 08:30:51,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:30:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:52,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231204965] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:30:52,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:30:52,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-26 08:30:52,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649267262] [2021-08-26 08:30:52,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:30:52,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:52,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:30:52,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:52,045 INFO L87 Difference]: Start difference. First operand 474 states and 828 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:52,076 INFO L93 Difference]: Finished difference Result 832 states and 1432 transitions. [2021-08-26 08:30:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 08:30:52,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-08-26 08:30:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:52,079 INFO L225 Difference]: With dead ends: 832 [2021-08-26 08:30:52,079 INFO L226 Difference]: Without dead ends: 761 [2021-08-26 08:30:52,080 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2021-08-26 08:30:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 688. [2021-08-26 08:30:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 686 states have (on average 1.7755102040816326) internal successors, (1218), 687 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1218 transitions. [2021-08-26 08:30:52,100 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1218 transitions. Word has length 54 [2021-08-26 08:30:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:52,100 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 1218 transitions. [2021-08-26 08:30:52,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1218 transitions. [2021-08-26 08:30:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-26 08:30:52,102 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:52,102 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:52,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 08:30:52,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:30:52,313 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:52,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1597372392, now seen corresponding path program 1 times [2021-08-26 08:30:52,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:52,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479469318] [2021-08-26 08:30:52,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:52,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:52,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:52,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479469318] [2021-08-26 08:30:52,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479469318] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:52,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:52,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:52,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840586682] [2021-08-26 08:30:52,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:52,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:52,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,350 INFO L87 Difference]: Start difference. First operand 688 states and 1218 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:52,412 INFO L93 Difference]: Finished difference Result 1730 states and 3078 transitions. [2021-08-26 08:30:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:52,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-08-26 08:30:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:52,416 INFO L225 Difference]: With dead ends: 1730 [2021-08-26 08:30:52,416 INFO L226 Difference]: Without dead ends: 1131 [2021-08-26 08:30:52,417 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2021-08-26 08:30:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1060. [2021-08-26 08:30:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1058 states have (on average 1.7920604914933838) internal successors, (1896), 1059 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1896 transitions. [2021-08-26 08:30:52,451 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1896 transitions. Word has length 60 [2021-08-26 08:30:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:52,451 INFO L470 AbstractCegarLoop]: Abstraction has 1060 states and 1896 transitions. [2021-08-26 08:30:52,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1896 transitions. [2021-08-26 08:30:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-26 08:30:52,452 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:52,453 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:52,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 08:30:52,453 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:52,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:52,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1910863000, now seen corresponding path program 2 times [2021-08-26 08:30:52,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:52,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427750752] [2021-08-26 08:30:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:52,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:52,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:52,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427750752] [2021-08-26 08:30:52,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427750752] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:52,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:52,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:52,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360911554] [2021-08-26 08:30:52,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:52,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:52,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,505 INFO L87 Difference]: Start difference. First operand 1060 states and 1896 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:52,539 INFO L93 Difference]: Finished difference Result 1944 states and 3466 transitions. [2021-08-26 08:30:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:52,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-08-26 08:30:52,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:52,544 INFO L225 Difference]: With dead ends: 1944 [2021-08-26 08:30:52,544 INFO L226 Difference]: Without dead ends: 1131 [2021-08-26 08:30:52,545 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2021-08-26 08:30:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1060. [2021-08-26 08:30:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1058 states have (on average 1.7901701323251418) internal successors, (1894), 1059 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1894 transitions. [2021-08-26 08:30:52,576 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1894 transitions. Word has length 61 [2021-08-26 08:30:52,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:52,577 INFO L470 AbstractCegarLoop]: Abstraction has 1060 states and 1894 transitions. [2021-08-26 08:30:52,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1894 transitions. [2021-08-26 08:30:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-26 08:30:52,578 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:52,578 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:52,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 08:30:52,579 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:52,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:52,579 INFO L82 PathProgramCache]: Analyzing trace with hash -206239817, now seen corresponding path program 1 times [2021-08-26 08:30:52,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:52,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876192943] [2021-08-26 08:30:52,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:52,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:52,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:52,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876192943] [2021-08-26 08:30:52,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876192943] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:52,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:52,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:52,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483758890] [2021-08-26 08:30:52,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:52,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:52,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:52,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,625 INFO L87 Difference]: Start difference. First operand 1060 states and 1894 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:52,684 INFO L93 Difference]: Finished difference Result 2818 states and 5061 transitions. [2021-08-26 08:30:52,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:52,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-08-26 08:30:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:52,690 INFO L225 Difference]: With dead ends: 2818 [2021-08-26 08:30:52,690 INFO L226 Difference]: Without dead ends: 1855 [2021-08-26 08:30:52,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2021-08-26 08:30:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1784. [2021-08-26 08:30:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1782 states have (on average 1.803030303030303) internal successors, (3213), 1783 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 3213 transitions. [2021-08-26 08:30:52,743 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 3213 transitions. Word has length 61 [2021-08-26 08:30:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:52,744 INFO L470 AbstractCegarLoop]: Abstraction has 1784 states and 3213 transitions. [2021-08-26 08:30:52,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 3213 transitions. [2021-08-26 08:30:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-26 08:30:52,749 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:52,749 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:52,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 08:30:52,750 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:52,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:52,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1057921110, now seen corresponding path program 1 times [2021-08-26 08:30:52,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:52,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510486960] [2021-08-26 08:30:52,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:52,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:52,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:52,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510486960] [2021-08-26 08:30:52,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510486960] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:52,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:52,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:52,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497158357] [2021-08-26 08:30:52,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:52,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:52,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:52,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,785 INFO L87 Difference]: Start difference. First operand 1784 states and 3213 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:52,876 INFO L93 Difference]: Finished difference Result 4726 states and 8537 transitions. [2021-08-26 08:30:52,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:52,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-08-26 08:30:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:52,886 INFO L225 Difference]: With dead ends: 4726 [2021-08-26 08:30:52,886 INFO L226 Difference]: Without dead ends: 3073 [2021-08-26 08:30:52,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2021-08-26 08:30:52,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 3002. [2021-08-26 08:30:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 3000 states have (on average 1.8086666666666666) internal successors, (5426), 3001 states have internal predecessors, (5426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 5426 transitions. [2021-08-26 08:30:52,992 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 5426 transitions. Word has length 62 [2021-08-26 08:30:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:52,992 INFO L470 AbstractCegarLoop]: Abstraction has 3002 states and 5426 transitions. [2021-08-26 08:30:52,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 5426 transitions. [2021-08-26 08:30:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-26 08:30:52,995 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:52,995 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:52,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 08:30:52,996 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:52,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:52,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1486301384, now seen corresponding path program 1 times [2021-08-26 08:30:52,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:52,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152403487] [2021-08-26 08:30:52,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:52,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:53,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:53,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152403487] [2021-08-26 08:30:53,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152403487] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:53,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:53,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:53,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958899727] [2021-08-26 08:30:53,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:53,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:53,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:53,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:53,043 INFO L87 Difference]: Start difference. First operand 3002 states and 5426 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:53,190 INFO L93 Difference]: Finished difference Result 8096 states and 14659 transitions. [2021-08-26 08:30:53,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:53,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-08-26 08:30:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:53,207 INFO L225 Difference]: With dead ends: 8096 [2021-08-26 08:30:53,208 INFO L226 Difference]: Without dead ends: 5259 [2021-08-26 08:30:53,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2021-08-26 08:30:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 5188. [2021-08-26 08:30:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5188 states, 5186 states have (on average 1.8100655611261087) internal successors, (9387), 5187 states have internal predecessors, (9387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 9387 transitions. [2021-08-26 08:30:53,377 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 9387 transitions. Word has length 63 [2021-08-26 08:30:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:53,377 INFO L470 AbstractCegarLoop]: Abstraction has 5188 states and 9387 transitions. [2021-08-26 08:30:53,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 9387 transitions. [2021-08-26 08:30:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-26 08:30:53,380 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:53,380 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:53,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 08:30:53,380 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash 369646572, now seen corresponding path program 1 times [2021-08-26 08:30:53,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:53,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022583168] [2021-08-26 08:30:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:53,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 08:30:53,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:53,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022583168] [2021-08-26 08:30:53,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022583168] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:53,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:53,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 08:30:53,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209947407] [2021-08-26 08:30:53,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:30:53,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:53,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:30:53,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:53,434 INFO L87 Difference]: Start difference. First operand 5188 states and 9387 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:53,880 INFO L93 Difference]: Finished difference Result 14783 states and 26778 transitions. [2021-08-26 08:30:53,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 08:30:53,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-08-26 08:30:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:53,911 INFO L225 Difference]: With dead ends: 14783 [2021-08-26 08:30:53,911 INFO L226 Difference]: Without dead ends: 9842 [2021-08-26 08:30:53,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 08:30:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9842 states. [2021-08-26 08:30:54,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9842 to 5188. [2021-08-26 08:30:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5188 states, 5186 states have (on average 1.800424219051292) internal successors, (9337), 5187 states have internal predecessors, (9337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 9337 transitions. [2021-08-26 08:30:54,124 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 9337 transitions. Word has length 64 [2021-08-26 08:30:54,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:54,125 INFO L470 AbstractCegarLoop]: Abstraction has 5188 states and 9337 transitions. [2021-08-26 08:30:54,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:54,125 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 9337 transitions. [2021-08-26 08:30:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-26 08:30:54,128 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:54,128 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:54,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 08:30:54,128 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:54,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:54,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1805141723, now seen corresponding path program 1 times [2021-08-26 08:30:54,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:54,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995871273] [2021-08-26 08:30:54,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:54,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:54,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:54,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995871273] [2021-08-26 08:30:54,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995871273] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:54,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:54,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:54,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379249652] [2021-08-26 08:30:54,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:54,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:54,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:54,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:54,192 INFO L87 Difference]: Start difference. First operand 5188 states and 9337 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:54,451 INFO L93 Difference]: Finished difference Result 14980 states and 27006 transitions. [2021-08-26 08:30:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:54,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-08-26 08:30:54,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:54,470 INFO L225 Difference]: With dead ends: 14980 [2021-08-26 08:30:54,471 INFO L226 Difference]: Without dead ends: 9965 [2021-08-26 08:30:54,476 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9965 states. [2021-08-26 08:30:54,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9965 to 9894. [2021-08-26 08:30:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9894 states, 9892 states have (on average 1.801253538212697) internal successors, (17818), 9893 states have internal predecessors, (17818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9894 states to 9894 states and 17818 transitions. [2021-08-26 08:30:54,869 INFO L78 Accepts]: Start accepts. Automaton has 9894 states and 17818 transitions. Word has length 64 [2021-08-26 08:30:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:54,869 INFO L470 AbstractCegarLoop]: Abstraction has 9894 states and 17818 transitions. [2021-08-26 08:30:54,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 9894 states and 17818 transitions. [2021-08-26 08:30:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-26 08:30:54,874 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:54,874 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:54,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 08:30:54,874 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:54,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1928331801, now seen corresponding path program 1 times [2021-08-26 08:30:54,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:54,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095825409] [2021-08-26 08:30:54,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:54,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-26 08:30:54,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:54,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095825409] [2021-08-26 08:30:54,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095825409] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:54,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:54,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 08:30:54,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642103539] [2021-08-26 08:30:54,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 08:30:54,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:54,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 08:30:54,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-08-26 08:30:54,968 INFO L87 Difference]: Start difference. First operand 9894 states and 17818 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:56,011 INFO L93 Difference]: Finished difference Result 10337 states and 18426 transitions. [2021-08-26 08:30:56,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-26 08:30:56,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-08-26 08:30:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:56,039 INFO L225 Difference]: With dead ends: 10337 [2021-08-26 08:30:56,040 INFO L226 Difference]: Without dead ends: 10288 [2021-08-26 08:30:56,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 268.1ms TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2021-08-26 08:30:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10288 states. [2021-08-26 08:30:56,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10288 to 9928. [2021-08-26 08:30:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9928 states, 9926 states have (on average 1.799818658069716) internal successors, (17865), 9927 states have internal predecessors, (17865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9928 states to 9928 states and 17865 transitions. [2021-08-26 08:30:56,382 INFO L78 Accepts]: Start accepts. Automaton has 9928 states and 17865 transitions. Word has length 65 [2021-08-26 08:30:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:56,382 INFO L470 AbstractCegarLoop]: Abstraction has 9928 states and 17865 transitions. [2021-08-26 08:30:56,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 9928 states and 17865 transitions. [2021-08-26 08:30:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-26 08:30:56,386 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:56,386 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:56,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 08:30:56,386 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:56,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:56,387 INFO L82 PathProgramCache]: Analyzing trace with hash -231806011, now seen corresponding path program 1 times [2021-08-26 08:30:56,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:56,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009571146] [2021-08-26 08:30:56,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:56,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-26 08:30:56,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:56,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009571146] [2021-08-26 08:30:56,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009571146] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:56,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:56,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 08:30:56,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844132776] [2021-08-26 08:30:56,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:30:56,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:56,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:30:56,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:56,442 INFO L87 Difference]: Start difference. First operand 9928 states and 17865 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:56,909 INFO L93 Difference]: Finished difference Result 19758 states and 35516 transitions. [2021-08-26 08:30:56,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 08:30:56,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-08-26 08:30:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:56,947 INFO L225 Difference]: With dead ends: 19758 [2021-08-26 08:30:56,947 INFO L226 Difference]: Without dead ends: 19676 [2021-08-26 08:30:56,955 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:30:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19676 states. [2021-08-26 08:30:57,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19676 to 19596. [2021-08-26 08:30:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19596 states, 19594 states have (on average 1.8010105134224763) internal successors, (35289), 19595 states have internal predecessors, (35289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19596 states to 19596 states and 35289 transitions. [2021-08-26 08:30:57,670 INFO L78 Accepts]: Start accepts. Automaton has 19596 states and 35289 transitions. Word has length 66 [2021-08-26 08:30:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:57,670 INFO L470 AbstractCegarLoop]: Abstraction has 19596 states and 35289 transitions. [2021-08-26 08:30:57,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 19596 states and 35289 transitions. [2021-08-26 08:30:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-26 08:30:57,675 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:57,675 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:57,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 08:30:57,676 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:57,676 INFO L82 PathProgramCache]: Analyzing trace with hash -463008574, now seen corresponding path program 1 times [2021-08-26 08:30:57,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:57,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849095126] [2021-08-26 08:30:57,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:57,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-26 08:30:57,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:57,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849095126] [2021-08-26 08:30:57,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849095126] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:57,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:57,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 08:30:57,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467658629] [2021-08-26 08:30:57,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 08:30:57,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:57,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 08:30:57,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 08:30:57,736 INFO L87 Difference]: Start difference. First operand 19596 states and 35289 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:58,237 INFO L93 Difference]: Finished difference Result 19842 states and 35626 transitions. [2021-08-26 08:30:58,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 08:30:58,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-08-26 08:30:58,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:58,271 INFO L225 Difference]: With dead ends: 19842 [2021-08-26 08:30:58,271 INFO L226 Difference]: Without dead ends: 19672 [2021-08-26 08:30:58,277 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-08-26 08:30:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19672 states. [2021-08-26 08:30:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19672 to 19588. [2021-08-26 08:30:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19588 states, 19586 states have (on average 1.8010313489227) internal successors, (35275), 19587 states have internal predecessors, (35275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19588 states to 19588 states and 35275 transitions. [2021-08-26 08:30:58,771 INFO L78 Accepts]: Start accepts. Automaton has 19588 states and 35275 transitions. Word has length 66 [2021-08-26 08:30:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:58,772 INFO L470 AbstractCegarLoop]: Abstraction has 19588 states and 35275 transitions. [2021-08-26 08:30:58,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 19588 states and 35275 transitions. [2021-08-26 08:30:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-26 08:30:58,777 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:58,777 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:58,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-26 08:30:58,777 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:58,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:58,778 INFO L82 PathProgramCache]: Analyzing trace with hash 945003010, now seen corresponding path program 1 times [2021-08-26 08:30:58,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:58,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617609182] [2021-08-26 08:30:58,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:58,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-26 08:30:58,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:58,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617609182] [2021-08-26 08:30:58,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617609182] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:58,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:58,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 08:30:58,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806632016] [2021-08-26 08:30:58,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 08:30:58,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:58,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 08:30:58,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:30:58,927 INFO L87 Difference]: Start difference. First operand 19588 states and 35275 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:30:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:59,661 INFO L93 Difference]: Finished difference Result 20117 states and 35999 transitions. [2021-08-26 08:30:59,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-26 08:30:59,661 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-08-26 08:30:59,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:59,698 INFO L225 Difference]: With dead ends: 20117 [2021-08-26 08:30:59,699 INFO L226 Difference]: Without dead ends: 19959 [2021-08-26 08:30:59,708 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 241.3ms TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2021-08-26 08:30:59,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19959 states. [2021-08-26 08:31:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19959 to 19667. [2021-08-26 08:31:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19667 states, 19665 states have (on average 1.7993897787948132) internal successors, (35385), 19666 states have internal predecessors, (35385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:31:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19667 states to 19667 states and 35385 transitions. [2021-08-26 08:31:00,333 INFO L78 Accepts]: Start accepts. Automaton has 19667 states and 35385 transitions. Word has length 67 [2021-08-26 08:31:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:31:00,334 INFO L470 AbstractCegarLoop]: Abstraction has 19667 states and 35385 transitions. [2021-08-26 08:31:00,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:31:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 19667 states and 35385 transitions. [2021-08-26 08:31:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-26 08:31:00,341 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:31:00,341 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:31:00,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-26 08:31:00,341 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:31:00,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:31:00,342 INFO L82 PathProgramCache]: Analyzing trace with hash -319920306, now seen corresponding path program 1 times [2021-08-26 08:31:00,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:31:00,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233324487] [2021-08-26 08:31:00,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:31:00,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:31:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:31:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-26 08:31:00,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:31:00,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233324487] [2021-08-26 08:31:00,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233324487] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:31:00,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:31:00,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 08:31:00,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427120039] [2021-08-26 08:31:00,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 08:31:00,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:31:00,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 08:31:00,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 08:31:00,383 INFO L87 Difference]: Start difference. First operand 19667 states and 35385 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:31:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:31:00,828 INFO L93 Difference]: Finished difference Result 19758 states and 35501 transitions. [2021-08-26 08:31:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 08:31:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-08-26 08:31:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:31:00,861 INFO L225 Difference]: With dead ends: 19758 [2021-08-26 08:31:00,861 INFO L226 Difference]: Without dead ends: 19574 [2021-08-26 08:31:00,867 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:31:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19574 states. [2021-08-26 08:31:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19574 to 19539. [2021-08-26 08:31:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19539 states, 19537 states have (on average 1.8014024671136817) internal successors, (35194), 19538 states have internal predecessors, (35194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:31:01,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19539 states to 19539 states and 35194 transitions. [2021-08-26 08:31:01,505 INFO L78 Accepts]: Start accepts. Automaton has 19539 states and 35194 transitions. Word has length 68 [2021-08-26 08:31:01,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:31:01,506 INFO L470 AbstractCegarLoop]: Abstraction has 19539 states and 35194 transitions. [2021-08-26 08:31:01,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:31:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 19539 states and 35194 transitions. [2021-08-26 08:31:01,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-26 08:31:01,513 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:31:01,513 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:31:01,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-26 08:31:01,514 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:31:01,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:31:01,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1404783674, now seen corresponding path program 1 times [2021-08-26 08:31:01,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:31:01,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444015740] [2021-08-26 08:31:01,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:31:01,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:31:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:31:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-26 08:31:01,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:31:01,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444015740] [2021-08-26 08:31:01,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444015740] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:31:01,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904780493] [2021-08-26 08:31:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:31:01,570 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:31:01,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:31:01,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:31:01,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 08:31:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:31:01,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 08:31:01,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:31:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:31:02,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904780493] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:31:02,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:31:02,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-26 08:31:02,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076717441] [2021-08-26 08:31:02,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 08:31:02,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:31:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 08:31:02,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-26 08:31:02,109 INFO L87 Difference]: Start difference. First operand 19539 states and 35194 transitions. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:31:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:31:02,849 INFO L93 Difference]: Finished difference Result 21880 states and 39113 transitions. [2021-08-26 08:31:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-26 08:31:02,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-26 08:31:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:31:02,850 INFO L225 Difference]: With dead ends: 21880 [2021-08-26 08:31:02,850 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 08:31:02,865 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 109.0ms TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-08-26 08:31:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 08:31:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 08:31:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:31:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 08:31:02,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2021-08-26 08:31:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:31:02,867 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 08:31:02,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 08:31:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 08:31:02,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 08:31:02,869 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 08:31:02,869 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 08:31:02,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 08:31:03,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-26 08:31:03,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 08:31:03,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:03,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:03,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:03,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:03,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:03,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:03,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:04,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:05,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:06,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:06,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:06,297 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:06,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:06,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:06,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:06,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:06,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:06,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:06,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:06,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,264 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:07,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:08,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:09,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:19,013 INFO L857 garLoopResultBuilder]: For program point L2281-8(lines 2281 2293) no Hoare annotation was computed. [2021-08-26 08:31:19,014 INFO L857 garLoopResultBuilder]: For program point L2281-10(lines 2281 2293) no Hoare annotation was computed. [2021-08-26 08:31:19,014 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2737) no Hoare annotation was computed. [2021-08-26 08:31:19,014 INFO L857 garLoopResultBuilder]: For program point L2612(lines 2612 2616) no Hoare annotation was computed. [2021-08-26 08:31:19,014 INFO L853 garLoopResultBuilder]: At program point L564(lines 553 567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:31:19,014 INFO L857 garLoopResultBuilder]: For program point L2612-3(lines 2612 2616) no Hoare annotation was computed. [2021-08-26 08:31:19,014 INFO L857 garLoopResultBuilder]: For program point L2612-6(lines 2612 2616) no Hoare annotation was computed. [2021-08-26 08:31:19,014 INFO L857 garLoopResultBuilder]: For program point L2612-9(lines 2612 2616) no Hoare annotation was computed. [2021-08-26 08:31:19,014 INFO L857 garLoopResultBuilder]: For program point L2612-12(lines 2612 2616) no Hoare annotation was computed. [2021-08-26 08:31:19,014 INFO L857 garLoopResultBuilder]: For program point L2415(lines 2415 2421) no Hoare annotation was computed. [2021-08-26 08:31:19,014 INFO L857 garLoopResultBuilder]: For program point L1359(lines 1359 1366) no Hoare annotation was computed. [2021-08-26 08:31:19,014 INFO L857 garLoopResultBuilder]: For program point L2284(lines 2284 2292) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L2284-2(lines 2284 2292) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L2284-4(lines 2284 2292) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L2284-6(lines 2284 2292) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L2284-8(lines 2284 2292) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L2284-10(lines 2284 2292) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L853 garLoopResultBuilder]: At program point L765(lines 746 767) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (= ULTIMATE.start_test_~op1~0 0)) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L1426(lines 1426 1433) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L1295(lines 1294 1461) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L2287(lines 2287 2291) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L2287-3(lines 2287 2291) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L853 garLoopResultBuilder]: At program point L2287-2(lines 1 2757) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:31:19,015 INFO L853 garLoopResultBuilder]: At program point L2287-5(lines 1 2757) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_client_forwardReceiver1~0 0) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ULTIMATE.start_setClientId_~handle 2)) [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L2287-6(lines 2287 2291) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L2287-9(lines 2287 2291) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L853 garLoopResultBuilder]: At program point L2287-8(lines 1 2757) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ~__ste_client_forwardReceiver1~0 0) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (not (= ~__ste_email_to0~0 1)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2))) [2021-08-26 08:31:19,015 INFO L853 garLoopResultBuilder]: At program point L2287-11(lines 1 2757) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~op3~0 0)) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= ~rjh~0 2)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse6 (not (= ULTIMATE.start_setClientPrivateKey_~handle 1))) (.cse7 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_test_~op2~0 1) .cse4 .cse5 .cse6 .cse7))) [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L2287-12(lines 2287 2291) no Hoare annotation was computed. [2021-08-26 08:31:19,015 INFO L857 garLoopResultBuilder]: For program point L2287-15(lines 2287 2291) no Hoare annotation was computed. [2021-08-26 08:31:19,016 INFO L853 garLoopResultBuilder]: At program point L2287-14(lines 848 857) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ULTIMATE.start_setClientPrivateKey_~handle 1))) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,016 INFO L853 garLoopResultBuilder]: At program point L2287-17(lines 838 847) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,016 INFO L853 garLoopResultBuilder]: At program point L2619-1(lines 2593 2636) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (= ULTIMATE.start_test_~op1~0 0)) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,016 INFO L857 garLoopResultBuilder]: For program point L2619(lines 2619 2631) no Hoare annotation was computed. [2021-08-26 08:31:19,016 INFO L853 garLoopResultBuilder]: At program point L2619-3(lines 1 2757) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~op4~0 0)) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= ~rjh~0 2)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_test_~op2~0 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,016 INFO L857 garLoopResultBuilder]: For program point L2619-2(lines 2619 2631) no Hoare annotation was computed. [2021-08-26 08:31:19,016 INFO L853 garLoopResultBuilder]: At program point L2619-5(lines 1 2757) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1))) (.cse6 (= ULTIMATE.start_test_~op5~0 0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0) .cse6))) [2021-08-26 08:31:19,016 INFO L857 garLoopResultBuilder]: For program point L2619-4(lines 2619 2631) no Hoare annotation was computed. [2021-08-26 08:31:19,016 INFO L853 garLoopResultBuilder]: At program point L2619-7(lines 1 2757) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,016 INFO L857 garLoopResultBuilder]: For program point L2619-6(lines 2619 2631) no Hoare annotation was computed. [2021-08-26 08:31:19,016 INFO L857 garLoopResultBuilder]: For program point L2355-1(lines 2355 2365) no Hoare annotation was computed. [2021-08-26 08:31:19,016 INFO L853 garLoopResultBuilder]: At program point L2619-9(lines 1 2757) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,016 INFO L857 garLoopResultBuilder]: For program point L2355(lines 2355 2365) no Hoare annotation was computed. [2021-08-26 08:31:19,016 INFO L857 garLoopResultBuilder]: For program point L2619-8(lines 2619 2631) no Hoare annotation was computed. [2021-08-26 08:31:19,016 INFO L857 garLoopResultBuilder]: For program point L2355-3(lines 2355 2365) no Hoare annotation was computed. [2021-08-26 08:31:19,016 INFO L857 garLoopResultBuilder]: For program point L2355-2(lines 2355 2365) no Hoare annotation was computed. [2021-08-26 08:31:19,016 INFO L857 garLoopResultBuilder]: For program point L2355-4(lines 2355 2365) no Hoare annotation was computed. [2021-08-26 08:31:19,016 INFO L857 garLoopResultBuilder]: For program point L2620(lines 2620 2628) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L2620-2(lines 2620 2628) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L2620-4(lines 2620 2628) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L2620-6(lines 2620 2628) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L2620-8(lines 2620 2628) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L2489(lines 2489 2535) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L177-2(lines 177 185) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L177-4(lines 177 185) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L2490(lines 2490 2501) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L2623(lines 2623 2627) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L2623-3(lines 2623 2627) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L853 garLoopResultBuilder]: At program point L2425(lines 2378 2431) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (= ULTIMATE.start_test_~op1~0 0)) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L2623-6(lines 2623 2627) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L853 garLoopResultBuilder]: At program point L1368(lines 1355 1456) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L2623-9(lines 2623 2627) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L1302(lines 1302 1460) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L857 garLoopResultBuilder]: For program point L2623-12(lines 2623 2627) no Hoare annotation was computed. [2021-08-26 08:31:19,017 INFO L853 garLoopResultBuilder]: At program point L1435(lines 1422 1451) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,018 INFO L857 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2021-08-26 08:31:19,018 INFO L853 garLoopResultBuilder]: At program point L180-2(lines 173 188) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= ~__ste_email_to0~0 2) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:31:19,018 INFO L857 garLoopResultBuilder]: For program point L180-3(lines 180 184) no Hoare annotation was computed. [2021-08-26 08:31:19,018 INFO L853 garLoopResultBuilder]: At program point L180-5(lines 173 188) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= ~rjh~0 2)) (.cse7 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse8 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse9 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_setEmailTo_~handle 1) .cse6 .cse7 .cse8 .cse9) (and (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse0 .cse1 .cse2 .cse3 (= ~__ste_email_to0~0 2) .cse4 .cse5 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,018 INFO L857 garLoopResultBuilder]: For program point L180-6(lines 180 184) no Hoare annotation was computed. [2021-08-26 08:31:19,018 INFO L853 garLoopResultBuilder]: At program point L180-8(lines 173 188) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= |ULTIMATE.start_createEmail_#res| 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:31:19,018 INFO L857 garLoopResultBuilder]: For program point L2692(lines 2692 2708) no Hoare annotation was computed. [2021-08-26 08:31:19,018 INFO L857 garLoopResultBuilder]: For program point L2692-1(lines 2692 2708) no Hoare annotation was computed. [2021-08-26 08:31:19,018 INFO L857 garLoopResultBuilder]: For program point L2494(lines 2494 2500) no Hoare annotation was computed. [2021-08-26 08:31:19,018 INFO L857 garLoopResultBuilder]: For program point L1306(lines 1306 1313) no Hoare annotation was computed. [2021-08-26 08:31:19,018 INFO L853 garLoopResultBuilder]: At program point L2364(lines 2344 2368) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (= ULTIMATE.start_test_~op1~0 0)) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,018 INFO L857 garLoopResultBuilder]: For program point L1373(lines 1373 1380) no Hoare annotation was computed. [2021-08-26 08:31:19,018 INFO L853 garLoopResultBuilder]: At program point L2364-2(lines 2344 2368) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1))) (.cse6 (= ULTIMATE.start_test_~op5~0 0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0) .cse6))) [2021-08-26 08:31:19,019 INFO L853 garLoopResultBuilder]: At program point L2364-1(lines 2344 2368) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~op4~0 0)) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= ~rjh~0 2)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_test_~op2~0 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,019 INFO L853 garLoopResultBuilder]: At program point L2364-4(lines 2344 2368) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,019 INFO L853 garLoopResultBuilder]: At program point L2364-3(lines 2344 2368) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L1440(lines 1440 1447) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L853 garLoopResultBuilder]: At program point L1440-1(lines 1294 1461) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2696(lines 2696 2707) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2696-1(lines 2696 2707) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L121(lines 121 132) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L121-1(lines 121 132) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2700(lines 2700 2706) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2700-1(lines 2700 2706) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2436(lines 2436 2472) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2436-2(lines 2436 2472) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2436-1(lines 2436 2472) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2304(lines 2304 2320) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2436-4(lines 2436 2472) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2436-3(lines 2436 2472) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2304-2(lines 2304 2320) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2304-1(lines 2304 2320) no Hoare annotation was computed. [2021-08-26 08:31:19,019 INFO L857 garLoopResultBuilder]: For program point L2304-4(lines 2304 2320) no Hoare annotation was computed. [2021-08-26 08:31:19,020 INFO L857 garLoopResultBuilder]: For program point L2304-3(lines 2304 2320) no Hoare annotation was computed. [2021-08-26 08:31:19,020 INFO L857 garLoopResultBuilder]: For program point L2503(lines 2503 2534) no Hoare annotation was computed. [2021-08-26 08:31:19,020 INFO L857 garLoopResultBuilder]: For program point L2437(lines 2437 2445) no Hoare annotation was computed. [2021-08-26 08:31:19,020 INFO L857 garLoopResultBuilder]: For program point L2437-2(lines 2437 2445) no Hoare annotation was computed. [2021-08-26 08:31:19,020 INFO L857 garLoopResultBuilder]: For program point L2437-4(lines 2437 2445) no Hoare annotation was computed. [2021-08-26 08:31:19,020 INFO L857 garLoopResultBuilder]: For program point L2437-6(lines 2437 2445) no Hoare annotation was computed. [2021-08-26 08:31:19,020 INFO L857 garLoopResultBuilder]: For program point L125(lines 125 131) no Hoare annotation was computed. [2021-08-26 08:31:19,020 INFO L857 garLoopResultBuilder]: For program point L2437-8(lines 2437 2445) no Hoare annotation was computed. [2021-08-26 08:31:19,020 INFO L857 garLoopResultBuilder]: For program point L125-1(lines 125 131) no Hoare annotation was computed. [2021-08-26 08:31:19,020 INFO L857 garLoopResultBuilder]: For program point L2504(lines 2504 2515) no Hoare annotation was computed. [2021-08-26 08:31:19,020 INFO L853 garLoopResultBuilder]: At program point L1315(lines 1302 1460) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,020 INFO L853 garLoopResultBuilder]: At program point L1382(lines 1369 1455) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,020 INFO L853 garLoopResultBuilder]: At program point L722(lines 702 724) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ~__ste_client_forwardReceiver1~0 0) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (not (= ~__ste_email_to0~0 1)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2))) [2021-08-26 08:31:19,020 INFO L853 garLoopResultBuilder]: At program point L1515(lines 1 2757) the Hoare annotation is: (and (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1) (= 2 ULTIMATE.start_incoming_~client)) [2021-08-26 08:31:19,020 INFO L853 garLoopResultBuilder]: At program point L1515-1(lines 1 2757) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= |ULTIMATE.start_createEmail_#res| 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:31:19,020 INFO L857 garLoopResultBuilder]: For program point L2440(lines 2440 2444) no Hoare annotation was computed. [2021-08-26 08:31:19,021 INFO L857 garLoopResultBuilder]: For program point L2308(lines 2308 2319) no Hoare annotation was computed. [2021-08-26 08:31:19,021 INFO L857 garLoopResultBuilder]: For program point L2440-3(lines 2440 2444) no Hoare annotation was computed. [2021-08-26 08:31:19,021 INFO L857 garLoopResultBuilder]: For program point L2308-2(lines 2308 2319) no Hoare annotation was computed. [2021-08-26 08:31:19,021 INFO L857 garLoopResultBuilder]: For program point L2440-6(lines 2440 2444) no Hoare annotation was computed. [2021-08-26 08:31:19,021 INFO L857 garLoopResultBuilder]: For program point L2308-1(lines 2308 2319) no Hoare annotation was computed. [2021-08-26 08:31:19,021 INFO L857 garLoopResultBuilder]: For program point L2308-4(lines 2308 2319) no Hoare annotation was computed. [2021-08-26 08:31:19,021 INFO L857 garLoopResultBuilder]: For program point L2308-3(lines 2308 2319) no Hoare annotation was computed. [2021-08-26 08:31:19,021 INFO L857 garLoopResultBuilder]: For program point L2440-9(lines 2440 2444) no Hoare annotation was computed. [2021-08-26 08:31:19,021 INFO L857 garLoopResultBuilder]: For program point L2440-12(lines 2440 2444) no Hoare annotation was computed. [2021-08-26 08:31:19,021 INFO L853 garLoopResultBuilder]: At program point L2705-1(lines 2688 2711) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ~rjh~0 2)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse7 (= ULTIMATE.start_createEmail_~msg~0 1))) (or (and (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 0)) .cse0 .cse1 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,021 INFO L853 garLoopResultBuilder]: At program point L2705(lines 2688 2711) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-08-26 08:31:19,021 INFO L857 garLoopResultBuilder]: For program point L2508(lines 2508 2514) no Hoare annotation was computed. [2021-08-26 08:31:19,021 INFO L853 garLoopResultBuilder]: At program point L130(lines 117 135) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 0))) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse4 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse5 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= ~rjh~0 2)) (.cse9 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse10 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse11 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_setEmailTo_~handle 1) .cse8 .cse9 .cse10 .cse11) (and .cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~__ste_email_to0~0 2) .cse6 .cse7 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse8 .cse9 .cse10 .cse11 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,021 INFO L860 garLoopResultBuilder]: At program point L130-1(lines 117 135) the Hoare annotation is: true [2021-08-26 08:31:19,021 INFO L857 garLoopResultBuilder]: For program point L1320(lines 1320 1324) no Hoare annotation was computed. [2021-08-26 08:31:19,022 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 08:31:19,022 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2737) no Hoare annotation was computed. [2021-08-26 08:31:19,022 INFO L857 garLoopResultBuilder]: For program point L1387(lines 1387 1394) no Hoare annotation was computed. [2021-08-26 08:31:19,022 INFO L857 garLoopResultBuilder]: For program point L2312(lines 2312 2318) no Hoare annotation was computed. [2021-08-26 08:31:19,022 INFO L857 garLoopResultBuilder]: For program point L2312-2(lines 2312 2318) no Hoare annotation was computed. [2021-08-26 08:31:19,022 INFO L857 garLoopResultBuilder]: For program point L2312-1(lines 2312 2318) no Hoare annotation was computed. [2021-08-26 08:31:19,022 INFO L857 garLoopResultBuilder]: For program point L2312-4(lines 2312 2318) no Hoare annotation was computed. [2021-08-26 08:31:19,022 INFO L857 garLoopResultBuilder]: For program point L2312-3(lines 2312 2318) no Hoare annotation was computed. [2021-08-26 08:31:19,023 INFO L857 garLoopResultBuilder]: For program point L2645-1(lines 2645 2661) no Hoare annotation was computed. [2021-08-26 08:31:19,023 INFO L857 garLoopResultBuilder]: For program point L2645(lines 2645 2661) no Hoare annotation was computed. [2021-08-26 08:31:19,023 INFO L857 garLoopResultBuilder]: For program point L2447-1(lines 2447 2471) no Hoare annotation was computed. [2021-08-26 08:31:19,023 INFO L857 garLoopResultBuilder]: For program point L2447(lines 2447 2471) no Hoare annotation was computed. [2021-08-26 08:31:19,023 INFO L857 garLoopResultBuilder]: For program point L2447-3(lines 2447 2471) no Hoare annotation was computed. [2021-08-26 08:31:19,023 INFO L857 garLoopResultBuilder]: For program point L2447-2(lines 2447 2471) no Hoare annotation was computed. [2021-08-26 08:31:19,023 INFO L857 garLoopResultBuilder]: For program point L2447-4(lines 2447 2471) no Hoare annotation was computed. [2021-08-26 08:31:19,024 INFO L853 garLoopResultBuilder]: At program point L532(lines 507 534) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 0))) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= ~rjh~0 2)) (.cse8 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse9 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse10 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_setEmailTo_~handle 1) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~__ste_email_to0~0 2) .cse5 .cse6 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,024 INFO L860 garLoopResultBuilder]: At program point L532-1(lines 507 534) the Hoare annotation is: true [2021-08-26 08:31:19,024 INFO L857 garLoopResultBuilder]: For program point L2448(lines 2448 2456) no Hoare annotation was computed. [2021-08-26 08:31:19,024 INFO L857 garLoopResultBuilder]: For program point L2382(lines 2382 2428) no Hoare annotation was computed. [2021-08-26 08:31:19,024 INFO L857 garLoopResultBuilder]: For program point L2448-2(lines 2448 2456) no Hoare annotation was computed. [2021-08-26 08:31:19,024 INFO L857 garLoopResultBuilder]: For program point L2448-4(lines 2448 2456) no Hoare annotation was computed. [2021-08-26 08:31:19,025 INFO L857 garLoopResultBuilder]: For program point L2448-6(lines 2448 2456) no Hoare annotation was computed. [2021-08-26 08:31:19,025 INFO L857 garLoopResultBuilder]: For program point L2448-8(lines 2448 2456) no Hoare annotation was computed. [2021-08-26 08:31:19,025 INFO L857 garLoopResultBuilder]: For program point L2383(lines 2383 2394) no Hoare annotation was computed. [2021-08-26 08:31:19,026 INFO L853 garLoopResultBuilder]: At program point L1326(lines 1316 1459) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,026 INFO L853 garLoopResultBuilder]: At program point L2317-1(lines 2300 2323) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~op4~0 0)) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= ~rjh~0 2)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_test_~op2~0 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,026 INFO L853 garLoopResultBuilder]: At program point L2317(lines 2300 2323) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (= ULTIMATE.start_test_~op1~0 0)) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,026 INFO L853 garLoopResultBuilder]: At program point L2317-3(lines 2300 2323) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,026 INFO L853 garLoopResultBuilder]: At program point L2317-2(lines 2300 2323) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1))) (.cse6 (= ULTIMATE.start_test_~op5~0 0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0) .cse6))) [2021-08-26 08:31:19,026 INFO L853 garLoopResultBuilder]: At program point L2317-4(lines 2300 2323) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,026 INFO L857 garLoopResultBuilder]: For program point L2649-1(lines 2649 2660) no Hoare annotation was computed. [2021-08-26 08:31:19,027 INFO L857 garLoopResultBuilder]: For program point L2649(lines 2649 2660) no Hoare annotation was computed. [2021-08-26 08:31:19,027 INFO L853 garLoopResultBuilder]: At program point L1592(lines 1587 1595) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ~rjh~0 2)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse7 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse8 (= ULTIMATE.start_outgoing_~msg 1))) (or (and (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 0)) .cse0 .cse1 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,027 INFO L857 garLoopResultBuilder]: For program point L2517(lines 2517 2533) no Hoare annotation was computed. [2021-08-26 08:31:19,027 INFO L857 garLoopResultBuilder]: For program point L2451(lines 2451 2455) no Hoare annotation was computed. [2021-08-26 08:31:19,028 INFO L857 garLoopResultBuilder]: For program point L2451-3(lines 2451 2455) no Hoare annotation was computed. [2021-08-26 08:31:19,028 INFO L857 garLoopResultBuilder]: For program point L2451-6(lines 2451 2455) no Hoare annotation was computed. [2021-08-26 08:31:19,028 INFO L857 garLoopResultBuilder]: For program point L2451-9(lines 2451 2455) no Hoare annotation was computed. [2021-08-26 08:31:19,028 INFO L857 garLoopResultBuilder]: For program point L2451-12(lines 2451 2455) no Hoare annotation was computed. [2021-08-26 08:31:19,028 INFO L857 garLoopResultBuilder]: For program point L2716(lines 2716 2728) no Hoare annotation was computed. [2021-08-26 08:31:19,028 INFO L857 garLoopResultBuilder]: For program point L2716-2(lines 2716 2728) no Hoare annotation was computed. [2021-08-26 08:31:19,028 INFO L857 garLoopResultBuilder]: For program point L2716-4(lines 2716 2728) no Hoare annotation was computed. [2021-08-26 08:31:19,028 INFO L857 garLoopResultBuilder]: For program point L2518(lines 2518 2529) no Hoare annotation was computed. [2021-08-26 08:31:19,029 INFO L857 garLoopResultBuilder]: For program point L140(lines 140 148) no Hoare annotation was computed. [2021-08-26 08:31:19,029 INFO L857 garLoopResultBuilder]: For program point L140-2(lines 140 148) no Hoare annotation was computed. [2021-08-26 08:31:19,029 INFO L857 garLoopResultBuilder]: For program point L140-4(lines 140 148) no Hoare annotation was computed. [2021-08-26 08:31:19,029 INFO L857 garLoopResultBuilder]: For program point L735(lines 735 742) no Hoare annotation was computed. [2021-08-26 08:31:19,029 INFO L860 garLoopResultBuilder]: At program point L735-1(lines 735 742) the Hoare annotation is: true [2021-08-26 08:31:19,029 INFO L853 garLoopResultBuilder]: At program point L1462(lines 1293 1463) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:31:19,029 INFO L853 garLoopResultBuilder]: At program point L1396(lines 1383 1454) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,029 INFO L857 garLoopResultBuilder]: For program point L2387(lines 2387 2393) no Hoare annotation was computed. [2021-08-26 08:31:19,029 INFO L857 garLoopResultBuilder]: For program point L1331(lines 1331 1338) no Hoare annotation was computed. [2021-08-26 08:31:19,030 INFO L857 garLoopResultBuilder]: For program point L2719(lines 2719 2727) no Hoare annotation was computed. [2021-08-26 08:31:19,030 INFO L857 garLoopResultBuilder]: For program point L2653-1(lines 2653 2659) no Hoare annotation was computed. [2021-08-26 08:31:19,030 INFO L857 garLoopResultBuilder]: For program point L2719-2(lines 2719 2727) no Hoare annotation was computed. [2021-08-26 08:31:19,030 INFO L857 garLoopResultBuilder]: For program point L2653(lines 2653 2659) no Hoare annotation was computed. [2021-08-26 08:31:19,030 INFO L857 garLoopResultBuilder]: For program point L2719-4(lines 2719 2727) no Hoare annotation was computed. [2021-08-26 08:31:19,030 INFO L857 garLoopResultBuilder]: For program point L143(lines 143 147) no Hoare annotation was computed. [2021-08-26 08:31:19,030 INFO L853 garLoopResultBuilder]: At program point L143-2(lines 136 151) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= ~__ste_email_to0~0 1)) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:31:19,030 INFO L857 garLoopResultBuilder]: For program point L143-3(lines 143 147) no Hoare annotation was computed. [2021-08-26 08:31:19,030 INFO L853 garLoopResultBuilder]: At program point L143-5(lines 136 151) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-08-26 08:31:19,031 INFO L857 garLoopResultBuilder]: For program point L143-6(lines 143 147) no Hoare annotation was computed. [2021-08-26 08:31:19,031 INFO L853 garLoopResultBuilder]: At program point L143-8(lines 136 151) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ~rjh~0 2)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse7 (= ULTIMATE.start_createEmail_~msg~0 1))) (or (and (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 0)) .cse0 .cse1 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,031 INFO L853 garLoopResultBuilder]: At program point L540(lines 535 543) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse3 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= ~rjh~0 2)) (.cse8 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse9 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse10 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_setEmailTo_~handle 1) .cse7 .cse8 .cse9 .cse10) (and (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~__ste_email_to0~0 2) .cse5 .cse6 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,031 INFO L857 garLoopResultBuilder]: For program point L2522(lines 2522 2528) no Hoare annotation was computed. [2021-08-26 08:31:19,031 INFO L853 garLoopResultBuilder]: At program point L540-1(lines 535 543) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 0))) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= ~rjh~0 2)) (.cse8 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse9 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse10 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_setEmailTo_~handle 1) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~__ste_email_to0~0 2) .cse5 .cse6 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,031 INFO L853 garLoopResultBuilder]: At program point L540-2(lines 535 543) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= |ULTIMATE.start_createEmail_#res| 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:31:19,031 INFO L860 garLoopResultBuilder]: At program point L540-3(lines 535 543) the Hoare annotation is: true [2021-08-26 08:31:19,032 INFO L857 garLoopResultBuilder]: For program point L2722(lines 2722 2726) no Hoare annotation was computed. [2021-08-26 08:31:19,032 INFO L853 garLoopResultBuilder]: At program point L2722-2(lines 1 2757) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:31:19,032 INFO L857 garLoopResultBuilder]: For program point L2722-3(lines 2722 2726) no Hoare annotation was computed. [2021-08-26 08:31:19,032 INFO L857 garLoopResultBuilder]: For program point L2722-6(lines 2722 2726) no Hoare annotation was computed. [2021-08-26 08:31:19,032 INFO L853 garLoopResultBuilder]: At program point L2722-5(lines 1 2757) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_client_forwardReceiver1~0 0) (= ~rjh~0 2) (not (= ~__ste_email_to0~0 1)) (= ULTIMATE.start_setClientId_~handle 2)) [2021-08-26 08:31:19,032 INFO L853 garLoopResultBuilder]: At program point L2722-8(lines 1 2757) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ~__ste_client_forwardReceiver1~0 0) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:31:19,032 INFO L857 garLoopResultBuilder]: For program point L2458(lines 2458 2470) no Hoare annotation was computed. [2021-08-26 08:31:19,032 INFO L857 garLoopResultBuilder]: For program point L2458-2(lines 2458 2470) no Hoare annotation was computed. [2021-08-26 08:31:19,032 INFO L857 garLoopResultBuilder]: For program point L1401(lines 1401 1405) no Hoare annotation was computed. [2021-08-26 08:31:19,033 INFO L853 garLoopResultBuilder]: At program point L2458-1(lines 2432 2475) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (= ULTIMATE.start_test_~op1~0 0)) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,033 INFO L857 garLoopResultBuilder]: For program point L2458-4(lines 2458 2470) no Hoare annotation was computed. [2021-08-26 08:31:19,033 INFO L853 garLoopResultBuilder]: At program point L2458-3(lines 2432 2475) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~op4~0 0)) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= ~rjh~0 2)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_test_~op2~0 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,033 INFO L857 garLoopResultBuilder]: For program point L2458-6(lines 2458 2470) no Hoare annotation was computed. [2021-08-26 08:31:19,034 INFO L853 garLoopResultBuilder]: At program point L2458-5(lines 2432 2475) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1))) (.cse6 (= ULTIMATE.start_test_~op5~0 0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0) .cse6))) [2021-08-26 08:31:19,034 INFO L857 garLoopResultBuilder]: For program point L2458-8(lines 2458 2470) no Hoare annotation was computed. [2021-08-26 08:31:19,034 INFO L853 garLoopResultBuilder]: At program point L2458-7(lines 2432 2475) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,034 INFO L853 garLoopResultBuilder]: At program point L2458-9(lines 2432 2475) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,034 INFO L857 garLoopResultBuilder]: For program point L2459(lines 2459 2467) no Hoare annotation was computed. [2021-08-26 08:31:19,034 INFO L857 garLoopResultBuilder]: For program point L2459-2(lines 2459 2467) no Hoare annotation was computed. [2021-08-26 08:31:19,034 INFO L857 garLoopResultBuilder]: For program point L2459-4(lines 2459 2467) no Hoare annotation was computed. [2021-08-26 08:31:19,035 INFO L857 garLoopResultBuilder]: For program point L2459-6(lines 2459 2467) no Hoare annotation was computed. [2021-08-26 08:31:19,035 INFO L857 garLoopResultBuilder]: For program point L2459-8(lines 2459 2467) no Hoare annotation was computed. [2021-08-26 08:31:19,035 INFO L853 garLoopResultBuilder]: At program point L2658(lines 2641 2664) the Hoare annotation is: (and (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1) (= 2 ULTIMATE.start_incoming_~client)) [2021-08-26 08:31:19,035 INFO L853 garLoopResultBuilder]: At program point L1601(lines 1596 1604) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ~rjh~0 2)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse7 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse8 (= ULTIMATE.start_outgoing_~msg 1))) (or (and (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 0)) .cse0 .cse1 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,035 INFO L853 garLoopResultBuilder]: At program point L2658-1(lines 2641 2664) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ~rjh~0 1))) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (not (= ULTIMATE.start_createEmail_~to 1))) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_getClientForwardReceiver_#res| 0)) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_createEmail_#res| 1) .cse3 (= 2 ULTIMATE.start_createEmail_~to) .cse4 (= ~rjh~0 2) .cse5 (= ULTIMATE.start_createEmail_~msg~0 1)))) [2021-08-26 08:31:19,035 INFO L857 garLoopResultBuilder]: For program point L2328(lines 2328 2340) no Hoare annotation was computed. [2021-08-26 08:31:19,035 INFO L857 garLoopResultBuilder]: For program point L2328-2(lines 2328 2340) no Hoare annotation was computed. [2021-08-26 08:31:19,035 INFO L857 garLoopResultBuilder]: For program point L2328-4(lines 2328 2340) no Hoare annotation was computed. [2021-08-26 08:31:19,036 INFO L857 garLoopResultBuilder]: For program point L2328-6(lines 2328 2340) no Hoare annotation was computed. [2021-08-26 08:31:19,036 INFO L857 garLoopResultBuilder]: For program point L2328-8(lines 2328 2340) no Hoare annotation was computed. [2021-08-26 08:31:19,036 INFO L860 garLoopResultBuilder]: At program point L743(lines 725 745) the Hoare annotation is: true [2021-08-26 08:31:19,036 INFO L857 garLoopResultBuilder]: For program point L2462(lines 2462 2466) no Hoare annotation was computed. [2021-08-26 08:31:19,036 INFO L857 garLoopResultBuilder]: For program point L2396(lines 2396 2427) no Hoare annotation was computed. [2021-08-26 08:31:19,036 INFO L857 garLoopResultBuilder]: For program point L2462-3(lines 2462 2466) no Hoare annotation was computed. [2021-08-26 08:31:19,036 INFO L857 garLoopResultBuilder]: For program point L2462-6(lines 2462 2466) no Hoare annotation was computed. [2021-08-26 08:31:19,036 INFO L857 garLoopResultBuilder]: For program point L2462-9(lines 2462 2466) no Hoare annotation was computed. [2021-08-26 08:31:19,036 INFO L857 garLoopResultBuilder]: For program point L84(lines 84 95) no Hoare annotation was computed. [2021-08-26 08:31:19,036 INFO L857 garLoopResultBuilder]: For program point L2462-12(lines 2462 2466) no Hoare annotation was computed. [2021-08-26 08:31:19,037 INFO L857 garLoopResultBuilder]: For program point L84-1(lines 84 95) no Hoare annotation was computed. [2021-08-26 08:31:19,037 INFO L857 garLoopResultBuilder]: For program point L679(lines 679 687) no Hoare annotation was computed. [2021-08-26 08:31:19,037 INFO L857 garLoopResultBuilder]: For program point L1538(lines 1538 1545) no Hoare annotation was computed. [2021-08-26 08:31:19,037 INFO L853 garLoopResultBuilder]: At program point L1538-1(lines 1 2757) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ~rjh~0 2)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse7 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse8 (= ULTIMATE.start_outgoing_~msg 1))) (or (and (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 0)) .cse0 .cse1 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,037 INFO L857 garLoopResultBuilder]: For program point L1538-2(lines 1538 1545) no Hoare annotation was computed. [2021-08-26 08:31:19,037 INFO L857 garLoopResultBuilder]: For program point L2397(lines 2397 2408) no Hoare annotation was computed. [2021-08-26 08:31:19,037 INFO L853 garLoopResultBuilder]: At program point L1340(lines 1327 1458) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,037 INFO L857 garLoopResultBuilder]: For program point L2331(lines 2331 2339) no Hoare annotation was computed. [2021-08-26 08:31:19,038 INFO L857 garLoopResultBuilder]: For program point L2331-2(lines 2331 2339) no Hoare annotation was computed. [2021-08-26 08:31:19,038 INFO L857 garLoopResultBuilder]: For program point L2331-4(lines 2331 2339) no Hoare annotation was computed. [2021-08-26 08:31:19,038 INFO L857 garLoopResultBuilder]: For program point L2331-6(lines 2331 2339) no Hoare annotation was computed. [2021-08-26 08:31:19,038 INFO L857 garLoopResultBuilder]: For program point L2331-8(lines 2331 2339) no Hoare annotation was computed. [2021-08-26 08:31:19,038 INFO L857 garLoopResultBuilder]: For program point L878(lines 878 884) no Hoare annotation was computed. [2021-08-26 08:31:19,039 INFO L857 garLoopResultBuilder]: For program point L878-2(lines 878 884) no Hoare annotation was computed. [2021-08-26 08:31:19,039 INFO L853 garLoopResultBuilder]: At program point L1407(lines 1397 1453) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,039 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 08:31:19,039 INFO L857 garLoopResultBuilder]: For program point L2597-1(lines 2597 2633) no Hoare annotation was computed. [2021-08-26 08:31:19,040 INFO L857 garLoopResultBuilder]: For program point L2597(lines 2597 2633) no Hoare annotation was computed. [2021-08-26 08:31:19,040 INFO L857 garLoopResultBuilder]: For program point L2597-3(lines 2597 2633) no Hoare annotation was computed. [2021-08-26 08:31:19,040 INFO L857 garLoopResultBuilder]: For program point L2597-2(lines 2597 2633) no Hoare annotation was computed. [2021-08-26 08:31:19,040 INFO L857 garLoopResultBuilder]: For program point L2597-4(lines 2597 2633) no Hoare annotation was computed. [2021-08-26 08:31:19,040 INFO L857 garLoopResultBuilder]: For program point L2598(lines 2598 2606) no Hoare annotation was computed. [2021-08-26 08:31:19,041 INFO L853 garLoopResultBuilder]: At program point L2532(lines 2485 2538) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (= ULTIMATE.start_test_~op1~0 0)) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,041 INFO L857 garLoopResultBuilder]: For program point L2598-2(lines 2598 2606) no Hoare annotation was computed. [2021-08-26 08:31:19,041 INFO L857 garLoopResultBuilder]: For program point L2598-4(lines 2598 2606) no Hoare annotation was computed. [2021-08-26 08:31:19,041 INFO L857 garLoopResultBuilder]: For program point L2598-6(lines 2598 2606) no Hoare annotation was computed. [2021-08-26 08:31:19,041 INFO L857 garLoopResultBuilder]: For program point L2334(lines 2334 2338) no Hoare annotation was computed. [2021-08-26 08:31:19,041 INFO L857 garLoopResultBuilder]: For program point L2598-8(lines 2598 2606) no Hoare annotation was computed. [2021-08-26 08:31:19,041 INFO L853 garLoopResultBuilder]: At program point L2334-2(lines 2324 2343) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (= ULTIMATE.start_test_~op1~0 0)) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,041 INFO L857 garLoopResultBuilder]: For program point L2334-3(lines 2334 2338) no Hoare annotation was computed. [2021-08-26 08:31:19,041 INFO L857 garLoopResultBuilder]: For program point L2334-6(lines 2334 2338) no Hoare annotation was computed. [2021-08-26 08:31:19,041 INFO L853 garLoopResultBuilder]: At program point L2334-5(lines 2324 2343) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~op4~0 0)) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= ~rjh~0 2)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_test_~op2~0 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)))) [2021-08-26 08:31:19,042 INFO L857 garLoopResultBuilder]: For program point L88(lines 88 94) no Hoare annotation was computed. [2021-08-26 08:31:19,042 INFO L853 garLoopResultBuilder]: At program point L2334-8(lines 2324 2343) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1))) (.cse6 (= ULTIMATE.start_test_~op5~0 0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0) .cse6))) [2021-08-26 08:31:19,042 INFO L857 garLoopResultBuilder]: For program point L88-1(lines 88 94) no Hoare annotation was computed. [2021-08-26 08:31:19,042 INFO L857 garLoopResultBuilder]: For program point L2334-9(lines 2334 2338) no Hoare annotation was computed. [2021-08-26 08:31:19,042 INFO L857 garLoopResultBuilder]: For program point L2334-12(lines 2334 2338) no Hoare annotation was computed. [2021-08-26 08:31:19,042 INFO L853 garLoopResultBuilder]: At program point L2334-11(lines 2324 2343) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,042 INFO L853 garLoopResultBuilder]: At program point L2334-14(lines 2324 2343) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,042 INFO L857 garLoopResultBuilder]: For program point L2401(lines 2401 2407) no Hoare annotation was computed. [2021-08-26 08:31:19,042 INFO L857 garLoopResultBuilder]: For program point L1345(lines 1345 1352) no Hoare annotation was computed. [2021-08-26 08:31:19,043 INFO L853 garLoopResultBuilder]: At program point L1610(lines 1605 1613) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ~rjh~0 2)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse7 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse8 (= ULTIMATE.start_outgoing_~msg 1))) (or (and (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 0)) .cse0 .cse1 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,043 INFO L857 garLoopResultBuilder]: For program point L2601(lines 2601 2605) no Hoare annotation was computed. [2021-08-26 08:31:19,043 INFO L857 garLoopResultBuilder]: For program point L2601-3(lines 2601 2605) no Hoare annotation was computed. [2021-08-26 08:31:19,043 INFO L857 garLoopResultBuilder]: For program point L1412(lines 1412 1419) no Hoare annotation was computed. [2021-08-26 08:31:19,043 INFO L857 garLoopResultBuilder]: For program point L2601-6(lines 2601 2605) no Hoare annotation was computed. [2021-08-26 08:31:19,043 INFO L857 garLoopResultBuilder]: For program point L2601-9(lines 2601 2605) no Hoare annotation was computed. [2021-08-26 08:31:19,043 INFO L857 garLoopResultBuilder]: For program point L2601-12(lines 2601 2605) no Hoare annotation was computed. [2021-08-26 08:31:19,043 INFO L857 garLoopResultBuilder]: For program point L158(lines 158 169) no Hoare annotation was computed. [2021-08-26 08:31:19,043 INFO L857 garLoopResultBuilder]: For program point L158-1(lines 158 169) no Hoare annotation was computed. [2021-08-26 08:31:19,043 INFO L857 garLoopResultBuilder]: For program point L158-2(lines 158 169) no Hoare annotation was computed. [2021-08-26 08:31:19,044 INFO L857 garLoopResultBuilder]: For program point L158-3(lines 158 169) no Hoare annotation was computed. [2021-08-26 08:31:19,044 INFO L857 garLoopResultBuilder]: For program point L2669(lines 2669 2681) no Hoare annotation was computed. [2021-08-26 08:31:19,044 INFO L853 garLoopResultBuilder]: At program point L489(lines 1 2757) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:31:19,044 INFO L853 garLoopResultBuilder]: At program point L93(lines 80 98) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 0))) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse4 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse5 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= ~rjh~0 2)) (.cse9 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse10 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse11 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_setEmailTo_~handle 1) .cse8 .cse9 .cse10 .cse11) (and .cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~__ste_email_to0~0 2) .cse6 .cse7 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse8 .cse9 .cse10 .cse11 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,044 INFO L860 garLoopResultBuilder]: At program point L93-1(lines 80 98) the Hoare annotation is: true [2021-08-26 08:31:19,044 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 08:31:19,044 INFO L857 garLoopResultBuilder]: For program point L2737-1(line 2737) no Hoare annotation was computed. [2021-08-26 08:31:19,044 INFO L857 garLoopResultBuilder]: For program point L2737(line 2737) no Hoare annotation was computed. [2021-08-26 08:31:19,045 INFO L853 garLoopResultBuilder]: At program point L2738(lines 870 887) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 0))) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse4 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse5 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= ~rjh~0 2)) (.cse9 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse10 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse11 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_setEmailTo_~handle 1) .cse8 .cse9 .cse10 .cse11) (and .cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~__ste_email_to0~0 2) .cse6 .cse7 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse8 .cse9 .cse10 .cse11 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,045 INFO L857 garLoopResultBuilder]: For program point L2672(lines 2672 2680) no Hoare annotation was computed. [2021-08-26 08:31:19,045 INFO L860 garLoopResultBuilder]: At program point L2738-1(lines 870 887) the Hoare annotation is: true [2021-08-26 08:31:19,045 INFO L857 garLoopResultBuilder]: For program point L162(lines 162 168) no Hoare annotation was computed. [2021-08-26 08:31:19,045 INFO L857 garLoopResultBuilder]: For program point L162-1(lines 162 168) no Hoare annotation was computed. [2021-08-26 08:31:19,045 INFO L857 garLoopResultBuilder]: For program point L162-2(lines 162 168) no Hoare annotation was computed. [2021-08-26 08:31:19,045 INFO L857 garLoopResultBuilder]: For program point L162-3(lines 162 168) no Hoare annotation was computed. [2021-08-26 08:31:19,045 INFO L857 garLoopResultBuilder]: For program point L2608(lines 2608 2632) no Hoare annotation was computed. [2021-08-26 08:31:19,045 INFO L857 garLoopResultBuilder]: For program point L2608-2(lines 2608 2632) no Hoare annotation was computed. [2021-08-26 08:31:19,045 INFO L857 garLoopResultBuilder]: For program point L2608-1(lines 2608 2632) no Hoare annotation was computed. [2021-08-26 08:31:19,046 INFO L857 garLoopResultBuilder]: For program point L2608-4(lines 2608 2632) no Hoare annotation was computed. [2021-08-26 08:31:19,046 INFO L857 garLoopResultBuilder]: For program point L2608-3(lines 2608 2632) no Hoare annotation was computed. [2021-08-26 08:31:19,046 INFO L857 garLoopResultBuilder]: For program point L2410(lines 2410 2426) no Hoare annotation was computed. [2021-08-26 08:31:19,046 INFO L857 garLoopResultBuilder]: For program point L2675(lines 2675 2679) no Hoare annotation was computed. [2021-08-26 08:31:19,046 INFO L857 garLoopResultBuilder]: For program point L2609(lines 2609 2617) no Hoare annotation was computed. [2021-08-26 08:31:19,046 INFO L853 garLoopResultBuilder]: At program point L2675-2(lines 1 2757) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~op6~0 0)) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse4 (= ~rjh~0 2)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse6 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_test_~op2~0 1) .cse4 .cse5 .cse6))) [2021-08-26 08:31:19,046 INFO L857 garLoopResultBuilder]: For program point L2609-2(lines 2609 2617) no Hoare annotation was computed. [2021-08-26 08:31:19,046 INFO L857 garLoopResultBuilder]: For program point L2609-4(lines 2609 2617) no Hoare annotation was computed. [2021-08-26 08:31:19,046 INFO L857 garLoopResultBuilder]: For program point L2411(lines 2411 2422) no Hoare annotation was computed. [2021-08-26 08:31:19,047 INFO L853 garLoopResultBuilder]: At program point L1354(lines 1341 1457) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,047 INFO L857 garLoopResultBuilder]: For program point L2609-6(lines 2609 2617) no Hoare annotation was computed. [2021-08-26 08:31:19,047 INFO L857 garLoopResultBuilder]: For program point L2609-8(lines 2609 2617) no Hoare annotation was computed. [2021-08-26 08:31:19,047 INFO L853 garLoopResultBuilder]: At program point L1421(lines 1408 1452) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse1 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= ~rjh~0 2)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse5 (not (= ~__ste_email_to0~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_test_~op2~0 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op2~0 1) .cse3 .cse4 .cse5))) [2021-08-26 08:31:19,047 INFO L853 garLoopResultBuilder]: At program point L497(lines 492 500) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:31:19,048 INFO L857 garLoopResultBuilder]: For program point L2281(lines 2281 2293) no Hoare annotation was computed. [2021-08-26 08:31:19,048 INFO L853 garLoopResultBuilder]: At program point L167(lines 154 172) the Hoare annotation is: (and (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-08-26 08:31:19,048 INFO L857 garLoopResultBuilder]: For program point L2281-2(lines 2281 2293) no Hoare annotation was computed. [2021-08-26 08:31:19,048 INFO L853 garLoopResultBuilder]: At program point L167-1(lines 154 172) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 0))) (.cse1 (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0)) (.cse2 (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (.cse3 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= ~rjh~0 2)) (.cse8 (not (= ULTIMATE.start_setClientId_~handle 2))) (.cse9 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse10 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_setEmailTo_~handle 1) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~__ste_email_to0~0 2) .cse5 .cse6 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:31:19,049 INFO L853 garLoopResultBuilder]: At program point L167-2(lines 154 172) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= |ULTIMATE.start_createEmail_#res| 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:31:19,049 INFO L857 garLoopResultBuilder]: For program point L2281-4(lines 2281 2293) no Hoare annotation was computed. [2021-08-26 08:31:19,049 INFO L860 garLoopResultBuilder]: At program point L167-3(lines 154 172) the Hoare annotation is: true [2021-08-26 08:31:19,049 INFO L857 garLoopResultBuilder]: For program point L2281-6(lines 2281 2293) no Hoare annotation was computed. [2021-08-26 08:31:19,052 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 08:31:19,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:31:19 BoogieIcfgContainer [2021-08-26 08:31:19,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 08:31:19,081 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 08:31:19,081 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 08:31:19,082 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 08:31:19,082 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:30:49" (3/4) ... [2021-08-26 08:31:19,084 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 08:31:19,103 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 125 nodes and edges [2021-08-26 08:31:19,104 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 66 nodes and edges [2021-08-26 08:31:19,113 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-08-26 08:31:19,114 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-08-26 08:31:19,116 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-26 08:31:19,117 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 08:31:19,147 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1 [2021-08-26 08:31:19,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1 [2021-08-26 08:31:19,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1 [2021-08-26 08:31:19,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 == \result && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1 [2021-08-26 08:31:19,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((2 == \result && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client [2021-08-26 08:31:19,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 == \result && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client [2021-08-26 08:31:19,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:31:19,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == chuck___0 && !(rjh___0 == 1)) && handle == 1) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((2 == \result && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:31:19,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:31:19,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:31:19,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == chuck___0 && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:31:19,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:31:19,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((((!(tmp == 0) && 2 == \result) && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:31:19,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) || ((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && 2 == client) [2021-08-26 08:31:19,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((((!(tmp == 0) && 2 == \result) && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:31:19,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) || ((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && 2 == client) [2021-08-26 08:31:19,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((((!(tmp == 0) && 2 == \result) && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:31:19,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && !(handle == 1)) && 2 == to) && rjh == 2) && !(handle == 2)) && msg == 1 [2021-08-26 08:31:19,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:31:19,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && !(handle == 1)) && 2 == to) && rjh == 2) && !(handle == 2)) && msg == 1 [2021-08-26 08:31:19,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(rjh == 1)) && !(handle == 1)) && !(to == 1)) && !(handle == 2)) && \result == 0) || (((((((((handle == chuck___0 && !(rjh___0 == 1)) && !(rjh == 1)) && \result == 1) && !(handle == 1)) && 2 == to) && !(to == 1)) && rjh == 2) && !(handle == 2)) && msg == 1) [2021-08-26 08:31:19,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:31:19,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:31:19,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && !(handle == 1)) && 2 == to) && rjh == 2) && !(handle == 2)) && msg == 1 [2021-08-26 08:31:19,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && rjh == 2) && !(handle == 2)) && msg == 1 [2021-08-26 08:31:19,224 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 08:31:19,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 08:31:19,226 INFO L168 Benchmark]: Toolchain (without parser) took 31278.70 ms. Allocated memory was 56.6 MB in the beginning and 2.4 GB in the end (delta: 2.4 GB). Free memory was 32.6 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. [2021-08-26 08:31:19,226 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 56.6 MB. Free memory was 37.9 MB in the beginning and 37.8 MB in the end (delta: 59.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 08:31:19,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.37 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 32.4 MB in the beginning and 42.9 MB in the end (delta: -10.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. [2021-08-26 08:31:19,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.03 ms. Allocated memory is still 69.2 MB. Free memory was 42.9 MB in the beginning and 35.6 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-26 08:31:19,227 INFO L168 Benchmark]: Boogie Preprocessor took 71.96 ms. Allocated memory is still 69.2 MB. Free memory was 35.6 MB in the beginning and 30.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 08:31:19,227 INFO L168 Benchmark]: RCFGBuilder took 1253.86 ms. Allocated memory was 69.2 MB in the beginning and 113.2 MB in the end (delta: 44.0 MB). Free memory was 44.3 MB in the beginning and 79.8 MB in the end (delta: -35.4 MB). Peak memory consumption was 36.2 MB. Max. memory is 16.1 GB. [2021-08-26 08:31:19,228 INFO L168 Benchmark]: TraceAbstraction took 29165.11 ms. Allocated memory was 113.2 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 78.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.1 GB. [2021-08-26 08:31:19,228 INFO L168 Benchmark]: Witness Printer took 143.48 ms. Allocated memory is still 2.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-08-26 08:31:19,229 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 56.6 MB. Free memory was 37.9 MB in the beginning and 37.8 MB in the end (delta: 59.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 528.37 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 32.4 MB in the beginning and 42.9 MB in the end (delta: -10.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.03 ms. Allocated memory is still 69.2 MB. Free memory was 42.9 MB in the beginning and 35.6 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.96 ms. Allocated memory is still 69.2 MB. Free memory was 35.6 MB in the beginning and 30.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1253.86 ms. Allocated memory was 69.2 MB in the beginning and 113.2 MB in the end (delta: 44.0 MB). Free memory was 44.3 MB in the beginning and 79.8 MB in the end (delta: -35.4 MB). Peak memory consumption was 36.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 29165.11 ms. Allocated memory was 113.2 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 78.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.1 GB. * Witness Printer took 143.48 ms. Allocated memory is still 2.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2737]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2737]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 329 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 29098.3ms, OverallIterations: 22, TraceHistogramMax: 3, EmptinessCheckTime: 69.3ms, AutomataDifference: 6017.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 15935.7ms, InitialAbstractionConstructionTime: 16.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 13785 SDtfs, 20184 SDslu, 25151 SDs, 0 SdLazy, 920 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1083.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 787.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=19667occurred in iteration=20, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3952.1ms AutomataMinimizationTime, 22 MinimizatonAttempts, 7216 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 5039 NumberOfFragments, 4380 HoareAnnotationTreeSize, 88 FomulaSimplifications, 3260638253 FormulaSimplificationTreeSizeReduction, 6119.6ms HoareSimplificationTime, 88 FomulaSimplificationsInter, 64580784 FormulaSimplificationTreeSizeReductionInter, 9776.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 193.4ms SsaConstructionTime, 579.5ms SatisfiabilityAnalysisTime, 1334.5ms InterpolantComputationTime, 1379 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1355 ConstructedInterpolants, 0 QuantifiedInterpolants, 2121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1726 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 81/97 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 2324]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op5 == 0) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) && op5 == 0) - InvariantResult [Line: 1369]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 2300]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && !(handle == 1)) && 2 == to) && rjh == 2) && !(handle == 2)) && msg == 1 - InvariantResult [Line: 1302]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 2344]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op5 == 0) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) && op5 == 0) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && !(handle == 1)) && 2 == to) && rjh == 2) && !(handle == 2)) && msg == 1 - InvariantResult [Line: 2432]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 2641]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(rjh == 1)) && !(handle == 1)) && !(to == 1)) && !(handle == 2)) && \result == 0) || (((((((((handle == chuck___0 && !(rjh___0 == 1)) && !(rjh == 1)) && \result == 1) && !(handle == 1)) && 2 == to) && !(to == 1)) && rjh == 2) && !(handle == 2)) && msg == 1) - InvariantResult [Line: 1605]: Loop Invariant Derived loop invariant: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 2593]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && !(rjh___0 == 1)) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1 - InvariantResult [Line: 2378]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && 2 == to) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && msg == 1 - InvariantResult [Line: 2300]: Loop Invariant Derived loop invariant: (((((((op4 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) || (((((((op4 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1 - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((op6 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || (((((((op6 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: ((((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((((!(tmp == 0) && 2 == \result) && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 2324]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 1422]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 2344]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 1341]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((handle == rjh___0 && __ste_client_forwardReceiver1 == 0) && rjh == 2) && !(handle == 1)) && !(__ste_email_to0 == 1)) && handle == 2 - InvariantResult [Line: 2300]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op5 == 0) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) && op5 == 0) - InvariantResult [Line: 1294]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 1293]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((((((((((2 == \result && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1 - InvariantResult [Line: 746]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 2344]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 1587]: Loop Invariant Derived loop invariant: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 2324]: Loop Invariant Derived loop invariant: (((((((op4 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) || (((((((op4 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 2344]: Loop Invariant Derived loop invariant: (((((((op4 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) || (((((((op4 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: (((((((((((handle == chuck___0 && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 2432]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && !(handle == 1)) && 2 == to) && rjh == 2) && !(handle == 2)) && msg == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 1355]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((op4 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) || (((((((op4 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: ((((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((((!(tmp == 0) && 2 == \result) && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((op3 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(handle == 1)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((((op3 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(handle == 1)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 2432]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 1408]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 2324]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 848]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(handle == 1)) && !(__ste_email_to0 == 1)) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(handle == 1)) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && rjh == 2) && !(handle == 2)) && msg == 1 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2485]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 2688]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1 - InvariantResult [Line: 2432]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op5 == 0) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) && op5 == 0) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2300]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && !(rjh___0 == 1)) && handle == 1) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((2 == \result && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((2 == \result && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client - InvariantResult [Line: 838]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 2324]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && __ste_client_forwardReceiver1 == 0) && rjh == 2) && !(handle == 2)) && !(handle == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) || ((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && 2 == client) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == rjh___0 && __ste_client_forwardReceiver1 == 0) && rjh == 2) && !(__ste_email_to0 == 1)) && handle == 2 - InvariantResult [Line: 1316]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 1327]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 2432]: Loop Invariant Derived loop invariant: (((((((op4 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) || (((((((op4 == 0 && handle == chuck___0) && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 725]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(handle == 2)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op5 == 0) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) && op5 == 0) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((((((!(tmp == 0) && 2 == \result) && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2344]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2641]: Loop Invariant Derived loop invariant: ((((((((((((((2 == \result && handle == chuck___0) && !(rjh___0 == 1)) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && value == 2) && 2 == to) && handle == 1) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && __ste_client_forwardReceiver1 == 0) && rjh == 2) && !(handle == 2)) && !(handle == 1)) && !(__ste_email_to0 == 1)) && !(handle == 2) - InvariantResult [Line: 702]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && __ste_client_forwardReceiver1 == 0) && rjh == 2) && !(handle == 2)) && !(handle == 1)) && !(__ste_email_to0 == 1)) && !(handle == 2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(handle == 2)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1596]: Loop Invariant Derived loop invariant: (((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) || (((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 2300]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) || (((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) - InvariantResult [Line: 735]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1397]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 2688]: Loop Invariant Derived loop invariant: ((((((((((!(tmp == 0) && handle == chuck___0) && !(rjh___0 == 1)) && !(\result == 0)) && \result == 1) && !(handle == 1)) && 2 == to) && handle == 1) && rjh == 2) && !(handle == 2)) && msg == 1) || ((((((((((handle == chuck___0 && !(rjh___0 == 1)) && \result == 1) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && 2 == handle) && rjh == 2) && !(handle == 2)) && msg == 1) && 2 == client) - InvariantResult [Line: 1383]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((((handle == chuck___0 && !(rjh___0 == 1)) && !(handle == 1)) && op2 == 1) && rjh == 2) && !(handle == 2)) && !(__ste_email_to0 == 1)) RESULT: Ultimate proved your program to be correct! [2021-08-26 08:31:19,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...