./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg --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 74a12e124f66b10df64ef68155d31c3be83012aab827a45870f5335a6569b75a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:41:13,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:41:13,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:41:13,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:41:13,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:41:13,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:41:13,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:41:13,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:41:13,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:41:13,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:41:13,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:41:13,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:41:13,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:41:13,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:41:13,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:41:13,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:41:13,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:41:13,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:41:13,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:41:13,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:41:13,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:41:13,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:41:13,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:41:13,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:41:13,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:41:13,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:41:13,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:41:13,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:41:13,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:41:13,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:41:13,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:41:13,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:41:13,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:41:13,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:41:13,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:41:13,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:41:13,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:41:13,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:41:13,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:41:13,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:41:13,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:41:13,610 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:41:13,651 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:41:13,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:41:13,652 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:41:13,653 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:41:13,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:41:13,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:41:13,661 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:41:13,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:41:13,661 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:41:13,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:41:13,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:41:13,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:41:13,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:41:13,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:41:13,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:41:13,663 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:41:13,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:41:13,664 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:41:13,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:41:13,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:41:13,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:41:13,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:41:13,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:41:13,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:41:13,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:41:13,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:41:13,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:41:13,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:41:13,666 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:41:13,668 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:41:13,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:41:13,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:41:13,669 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg 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 -> 74a12e124f66b10df64ef68155d31c3be83012aab827a45870f5335a6569b75a [2021-10-28 09:41:13,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:41:13,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:41:13,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:41:13,963 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:41:13,963 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:41:13,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2021-10-28 09:41:14,039 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/data/f985f4cd5/cd3c290ca12841899604f70e35c9b6ad/FLAGd7fd63870 [2021-10-28 09:41:14,637 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:41:14,638 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2021-10-28 09:41:14,665 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/data/f985f4cd5/cd3c290ca12841899604f70e35c9b6ad/FLAGd7fd63870 [2021-10-28 09:41:14,934 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/data/f985f4cd5/cd3c290ca12841899604f70e35c9b6ad [2021-10-28 09:41:14,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:41:14,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:41:14,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:41:14,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:41:14,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:41:14,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:41:14" (1/1) ... [2021-10-28 09:41:14,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e16416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:14, skipping insertion in model container [2021-10-28 09:41:14,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:41:14" (1/1) ... [2021-10-28 09:41:14,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:41:15,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:41:15,279 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/sv-benchmarks/c/product-lines/email_spec0_product05.cil.c[4289,4302] [2021-10-28 09:41:15,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:41:15,532 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:41:15,550 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/sv-benchmarks/c/product-lines/email_spec0_product05.cil.c[4289,4302] [2021-10-28 09:41:15,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:41:15,699 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:41:15,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:15 WrapperNode [2021-10-28 09:41:15,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:41:15,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:41:15,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:41:15,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:41:15,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:15" (1/1) ... [2021-10-28 09:41:15,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:15" (1/1) ... [2021-10-28 09:41:15,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:41:15,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:41:15,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:41:15,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:41:15,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:15" (1/1) ... [2021-10-28 09:41:15,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:15" (1/1) ... [2021-10-28 09:41:15,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:15" (1/1) ... [2021-10-28 09:41:15,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:15" (1/1) ... [2021-10-28 09:41:15,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:15" (1/1) ... [2021-10-28 09:41:15,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:15" (1/1) ... [2021-10-28 09:41:15,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:15" (1/1) ... [2021-10-28 09:41:15,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:41:15,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:41:15,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:41:15,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:41:15,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:15" (1/1) ... [2021-10-28 09:41:15,896 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:41:15,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:15,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:41:15,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:41:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2021-10-28 09:41:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:41:15,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:41:15,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:41:15,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:41:17,218 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:41:17,219 INFO L299 CfgBuilder]: Removed 127 assume(true) statements. [2021-10-28 09:41:17,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:41:17 BoogieIcfgContainer [2021-10-28 09:41:17,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:41:17,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:41:17,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:41:17,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:41:17,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:41:14" (1/3) ... [2021-10-28 09:41:17,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8f5938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:41:17, skipping insertion in model container [2021-10-28 09:41:17,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:15" (2/3) ... [2021-10-28 09:41:17,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8f5938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:41:17, skipping insertion in model container [2021-10-28 09:41:17,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:41:17" (3/3) ... [2021-10-28 09:41:17,229 INFO L111 eAbstractionObserver]: Analyzing ICFG email_spec0_product05.cil.c [2021-10-28 09:41:17,234 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:41:17,234 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 09:41:17,280 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:41:17,286 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, mAutomataTypeConcurrency=PETRI_NET, 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-10-28 09:41:17,286 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-28 09:41:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 131 states have (on average 1.6488549618320612) internal successors, (216), 133 states have internal predecessors, (216), 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-10-28 09:41:17,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 09:41:17,311 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:17,311 INFO L513 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] [2021-10-28 09:41:17,312 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:17,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:17,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1721357046, now seen corresponding path program 1 times [2021-10-28 09:41:17,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:17,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752156760] [2021-10-28 09:41:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:17,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:17,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:17,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752156760] [2021-10-28 09:41:17,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752156760] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:17,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:17,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:41:17,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115002857] [2021-10-28 09:41:17,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-28 09:41:17,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-28 09:41:17,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 09:41:17,646 INFO L87 Difference]: Start difference. First operand has 134 states, 131 states have (on average 1.6488549618320612) internal successors, (216), 133 states have internal predecessors, (216), 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 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-10-28 09:41:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:17,674 INFO L93 Difference]: Finished difference Result 221 states and 347 transitions. [2021-10-28 09:41:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-28 09:41:17,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 34 [2021-10-28 09:41:17,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:17,685 INFO L225 Difference]: With dead ends: 221 [2021-10-28 09:41:17,685 INFO L226 Difference]: Without dead ends: 118 [2021-10-28 09:41:17,688 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 09:41:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-28 09:41:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-10-28 09:41:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 116 states have (on average 1.6120689655172413) internal successors, (187), 117 states have internal predecessors, (187), 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-10-28 09:41:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 187 transitions. [2021-10-28 09:41:17,728 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 187 transitions. Word has length 34 [2021-10-28 09:41:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:17,728 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 187 transitions. [2021-10-28 09:41:17,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-10-28 09:41:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2021-10-28 09:41:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 09:41:17,731 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:17,731 INFO L513 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] [2021-10-28 09:41:17,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:41:17,731 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:17,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:17,732 INFO L85 PathProgramCache]: Analyzing trace with hash -122239248, now seen corresponding path program 1 times [2021-10-28 09:41:17,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:17,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946055905] [2021-10-28 09:41:17,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:17,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:17,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:17,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946055905] [2021-10-28 09:41:17,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946055905] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:17,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:17,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:41:17,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278363939] [2021-10-28 09:41:17,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:41:17,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:17,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:41:17,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:17,872 INFO L87 Difference]: Start difference. First operand 118 states and 187 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10-28 09:41:17,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:17,926 INFO L93 Difference]: Finished difference Result 327 states and 519 transitions. [2021-10-28 09:41:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:41:17,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2021-10-28 09:41:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:17,931 INFO L225 Difference]: With dead ends: 327 [2021-10-28 09:41:17,934 INFO L226 Difference]: Without dead ends: 220 [2021-10-28 09:41:17,936 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-10-28 09:41:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 117. [2021-10-28 09:41:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.5913043478260869) internal successors, (183), 116 states have internal predecessors, (183), 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-10-28 09:41:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2021-10-28 09:41:17,973 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 183 transitions. Word has length 35 [2021-10-28 09:41:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:17,974 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 183 transitions. [2021-10-28 09:41:17,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10-28 09:41:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2021-10-28 09:41:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 09:41:17,981 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:17,981 INFO L513 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] [2021-10-28 09:41:17,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:41:17,982 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:17,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2107249571, now seen corresponding path program 1 times [2021-10-28 09:41:17,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:17,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075035499] [2021-10-28 09:41:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:17,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:18,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:18,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075035499] [2021-10-28 09:41:18,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075035499] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:18,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:18,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:41:18,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987076858] [2021-10-28 09:41:18,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:41:18,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:18,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:41:18,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:18,128 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-28 09:41:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:18,173 INFO L93 Difference]: Finished difference Result 220 states and 346 transitions. [2021-10-28 09:41:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:41:18,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2021-10-28 09:41:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:18,176 INFO L225 Difference]: With dead ends: 220 [2021-10-28 09:41:18,177 INFO L226 Difference]: Without dead ends: 118 [2021-10-28 09:41:18,178 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-28 09:41:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2021-10-28 09:41:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.565217391304348) internal successors, (180), 116 states have internal predecessors, (180), 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-10-28 09:41:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2021-10-28 09:41:18,194 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 36 [2021-10-28 09:41:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:18,194 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2021-10-28 09:41:18,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-28 09:41:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2021-10-28 09:41:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 09:41:18,197 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:18,197 INFO L513 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] [2021-10-28 09:41:18,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:41:18,197 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:18,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1032935230, now seen corresponding path program 1 times [2021-10-28 09:41:18,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:18,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294363214] [2021-10-28 09:41:18,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:18,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:18,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:18,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294363214] [2021-10-28 09:41:18,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294363214] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:18,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:18,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:41:18,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439397599] [2021-10-28 09:41:18,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:41:18,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:18,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:41:18,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:18,282 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-28 09:41:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:18,301 INFO L93 Difference]: Finished difference Result 191 states and 289 transitions. [2021-10-28 09:41:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:41:18,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2021-10-28 09:41:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:18,303 INFO L225 Difference]: With dead ends: 191 [2021-10-28 09:41:18,303 INFO L226 Difference]: Without dead ends: 120 [2021-10-28 09:41:18,304 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:18,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-10-28 09:41:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2021-10-28 09:41:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 118 states have internal predecessors, (182), 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-10-28 09:41:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 182 transitions. [2021-10-28 09:41:18,317 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 182 transitions. Word has length 38 [2021-10-28 09:41:18,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:18,317 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 182 transitions. [2021-10-28 09:41:18,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-28 09:41:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 182 transitions. [2021-10-28 09:41:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-28 09:41:18,319 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:18,319 INFO L513 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] [2021-10-28 09:41:18,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:41:18,320 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1719269101, now seen corresponding path program 1 times [2021-10-28 09:41:18,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:18,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237009518] [2021-10-28 09:41:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:18,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:18,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:18,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237009518] [2021-10-28 09:41:18,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237009518] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:18,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191063899] [2021-10-28 09:41:18,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:18,456 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:41:18,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:18,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:41:18,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 09:41:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:18,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-28 09:41:18,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:41:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:18,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191063899] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:18,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:41:18,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-28 09:41:18,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007838764] [2021-10-28 09:41:18,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:41:18,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:18,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:41:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:41:18,917 INFO L87 Difference]: Start difference. First operand 119 states and 182 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-10-28 09:41:18,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:18,943 INFO L93 Difference]: Finished difference Result 291 states and 448 transitions. [2021-10-28 09:41:18,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:41:18,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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 43 [2021-10-28 09:41:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:18,947 INFO L225 Difference]: With dead ends: 291 [2021-10-28 09:41:18,947 INFO L226 Difference]: Without dead ends: 220 [2021-10-28 09:41:18,949 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:41:18,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-10-28 09:41:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 148. [2021-10-28 09:41:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 146 states have (on average 1.6164383561643836) internal successors, (236), 147 states have internal predecessors, (236), 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-10-28 09:41:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 236 transitions. [2021-10-28 09:41:18,975 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 236 transitions. Word has length 43 [2021-10-28 09:41:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:18,977 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 236 transitions. [2021-10-28 09:41:18,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-10-28 09:41:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 236 transitions. [2021-10-28 09:41:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-28 09:41:18,982 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:18,982 INFO L513 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] [2021-10-28 09:41:19,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-28 09:41:19,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:41:19,201 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:19,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:19,202 INFO L85 PathProgramCache]: Analyzing trace with hash 196922526, now seen corresponding path program 2 times [2021-10-28 09:41:19,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:19,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605979537] [2021-10-28 09:41:19,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:19,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:19,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:19,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605979537] [2021-10-28 09:41:19,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605979537] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:19,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:19,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:41:19,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473469709] [2021-10-28 09:41:19,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:41:19,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:19,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:41:19,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:41:19,267 INFO L87 Difference]: Start difference. First operand 148 states and 236 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-28 09:41:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:19,306 INFO L93 Difference]: Finished difference Result 373 states and 603 transitions. [2021-10-28 09:41:19,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:41:19,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 48 [2021-10-28 09:41:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:19,309 INFO L225 Difference]: With dead ends: 373 [2021-10-28 09:41:19,309 INFO L226 Difference]: Without dead ends: 273 [2021-10-28 09:41:19,309 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:41:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-28 09:41:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 202. [2021-10-28 09:41:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 1.685) internal successors, (337), 201 states have internal predecessors, (337), 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-10-28 09:41:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 337 transitions. [2021-10-28 09:41:19,323 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 337 transitions. Word has length 48 [2021-10-28 09:41:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:19,323 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 337 transitions. [2021-10-28 09:41:19,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-28 09:41:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 337 transitions. [2021-10-28 09:41:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-28 09:41:19,324 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:19,325 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:41:19,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:41:19,325 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash -867360645, now seen corresponding path program 1 times [2021-10-28 09:41:19,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:19,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357136882] [2021-10-28 09:41:19,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:19,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 09:41:19,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:19,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357136882] [2021-10-28 09:41:19,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357136882] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:19,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:19,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:41:19,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793987940] [2021-10-28 09:41:19,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:41:19,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:19,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:41:19,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:41:19,448 INFO L87 Difference]: Start difference. First operand 202 states and 337 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 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-10-28 09:41:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:20,108 INFO L93 Difference]: Finished difference Result 645 states and 945 transitions. [2021-10-28 09:41:20,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-28 09:41:20,109 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 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 49 [2021-10-28 09:41:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:20,113 INFO L225 Difference]: With dead ends: 645 [2021-10-28 09:41:20,113 INFO L226 Difference]: Without dead ends: 596 [2021-10-28 09:41:20,114 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2021-10-28 09:41:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-10-28 09:41:20,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 236. [2021-10-28 09:41:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 234 states have (on average 1.641025641025641) internal successors, (384), 235 states have internal predecessors, (384), 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-10-28 09:41:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 384 transitions. [2021-10-28 09:41:20,137 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 384 transitions. Word has length 49 [2021-10-28 09:41:20,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:20,138 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 384 transitions. [2021-10-28 09:41:20,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 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-10-28 09:41:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 384 transitions. [2021-10-28 09:41:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 09:41:20,139 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:20,139 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:41:20,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:41:20,140 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:20,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1932642042, now seen corresponding path program 1 times [2021-10-28 09:41:20,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:20,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710965187] [2021-10-28 09:41:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:20,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 09:41:20,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:20,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710965187] [2021-10-28 09:41:20,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710965187] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:20,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:20,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:41:20,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269662698] [2021-10-28 09:41:20,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:41:20,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:20,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:41:20,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:41:20,212 INFO L87 Difference]: Start difference. First operand 236 states and 384 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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-10-28 09:41:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:20,290 INFO L93 Difference]: Finished difference Result 368 states and 565 transitions. [2021-10-28 09:41:20,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:41:20,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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 50 [2021-10-28 09:41:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:20,293 INFO L225 Difference]: With dead ends: 368 [2021-10-28 09:41:20,293 INFO L226 Difference]: Without dead ends: 279 [2021-10-28 09:41:20,294 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:41:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-10-28 09:41:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 232. [2021-10-28 09:41:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 230 states have (on average 1.6391304347826088) internal successors, (377), 231 states have internal predecessors, (377), 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-10-28 09:41:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 377 transitions. [2021-10-28 09:41:20,326 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 377 transitions. Word has length 50 [2021-10-28 09:41:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:20,327 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 377 transitions. [2021-10-28 09:41:20,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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-10-28 09:41:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 377 transitions. [2021-10-28 09:41:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 09:41:20,328 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:20,328 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:41:20,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:41:20,329 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:20,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1701439479, now seen corresponding path program 1 times [2021-10-28 09:41:20,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:20,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102557944] [2021-10-28 09:41:20,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:20,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 09:41:20,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:20,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102557944] [2021-10-28 09:41:20,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102557944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:20,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:20,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:41:20,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366859249] [2021-10-28 09:41:20,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:41:20,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:20,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:41:20,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:41:20,397 INFO L87 Difference]: Start difference. First operand 232 states and 377 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 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-10-28 09:41:20,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:20,501 INFO L93 Difference]: Finished difference Result 550 states and 851 transitions. [2021-10-28 09:41:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:41:20,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 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 50 [2021-10-28 09:41:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:20,505 INFO L225 Difference]: With dead ends: 550 [2021-10-28 09:41:20,505 INFO L226 Difference]: Without dead ends: 468 [2021-10-28 09:41:20,506 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:41:20,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-10-28 09:41:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 388. [2021-10-28 09:41:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 386 states have (on average 1.616580310880829) internal successors, (624), 387 states have internal predecessors, (624), 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-10-28 09:41:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 624 transitions. [2021-10-28 09:41:20,547 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 624 transitions. Word has length 50 [2021-10-28 09:41:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:20,548 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 624 transitions. [2021-10-28 09:41:20,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 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-10-28 09:41:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 624 transitions. [2021-10-28 09:41:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-28 09:41:20,549 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:20,549 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:41:20,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:41:20,550 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:20,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:20,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1663962474, now seen corresponding path program 1 times [2021-10-28 09:41:20,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:20,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456366109] [2021-10-28 09:41:20,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:20,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 09:41:20,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:20,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456366109] [2021-10-28 09:41:20,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456366109] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:20,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:20,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:41:20,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945470014] [2021-10-28 09:41:20,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:41:20,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:20,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:41:20,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:41:20,646 INFO L87 Difference]: Start difference. First operand 388 states and 624 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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-10-28 09:41:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:21,204 INFO L93 Difference]: Finished difference Result 917 states and 1348 transitions. [2021-10-28 09:41:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 09:41:21,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 51 [2021-10-28 09:41:21,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:21,209 INFO L225 Difference]: With dead ends: 917 [2021-10-28 09:41:21,209 INFO L226 Difference]: Without dead ends: 759 [2021-10-28 09:41:21,210 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2021-10-28 09:41:21,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2021-10-28 09:41:21,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 467. [2021-10-28 09:41:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.578494623655914) internal successors, (734), 466 states have internal predecessors, (734), 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-10-28 09:41:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 734 transitions. [2021-10-28 09:41:21,267 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 734 transitions. Word has length 51 [2021-10-28 09:41:21,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:21,267 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 734 transitions. [2021-10-28 09:41:21,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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-10-28 09:41:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 734 transitions. [2021-10-28 09:41:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-28 09:41:21,269 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:21,269 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:41:21,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:41:21,269 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:21,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1224175828, now seen corresponding path program 1 times [2021-10-28 09:41:21,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:21,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823355861] [2021-10-28 09:41:21,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:21,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 09:41:21,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:21,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823355861] [2021-10-28 09:41:21,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823355861] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:21,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:21,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:41:21,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381403089] [2021-10-28 09:41:21,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:41:21,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:21,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:41:21,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:41:21,325 INFO L87 Difference]: Start difference. First operand 467 states and 734 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-10-28 09:41:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:21,382 INFO L93 Difference]: Finished difference Result 558 states and 850 transitions. [2021-10-28 09:41:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:41:21,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 52 [2021-10-28 09:41:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:21,386 INFO L225 Difference]: With dead ends: 558 [2021-10-28 09:41:21,386 INFO L226 Difference]: Without dead ends: 374 [2021-10-28 09:41:21,387 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:41:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-10-28 09:41:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 339. [2021-10-28 09:41:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 337 states have (on average 1.6112759643916914) internal successors, (543), 338 states have internal predecessors, (543), 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-10-28 09:41:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 543 transitions. [2021-10-28 09:41:21,423 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 543 transitions. Word has length 52 [2021-10-28 09:41:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:21,423 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 543 transitions. [2021-10-28 09:41:21,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-10-28 09:41:21,424 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 543 transitions. [2021-10-28 09:41:21,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-28 09:41:21,425 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:21,425 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:41:21,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:41:21,425 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:21,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash -944544913, now seen corresponding path program 1 times [2021-10-28 09:41:21,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:21,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007800355] [2021-10-28 09:41:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:21,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-28 09:41:21,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:21,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007800355] [2021-10-28 09:41:21,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007800355] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:21,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:21,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:41:21,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125464201] [2021-10-28 09:41:21,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:41:21,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:21,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:41:21,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:21,517 INFO L87 Difference]: Start difference. First operand 339 states and 543 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-10-28 09:41:21,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:21,583 INFO L93 Difference]: Finished difference Result 911 states and 1459 transitions. [2021-10-28 09:41:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:41:21,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 57 [2021-10-28 09:41:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:21,589 INFO L225 Difference]: With dead ends: 911 [2021-10-28 09:41:21,590 INFO L226 Difference]: Without dead ends: 598 [2021-10-28 09:41:21,590 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-10-28 09:41:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 453. [2021-10-28 09:41:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 451 states have (on average 1.6563192904656319) internal successors, (747), 452 states have internal predecessors, (747), 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-10-28 09:41:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 747 transitions. [2021-10-28 09:41:21,634 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 747 transitions. Word has length 57 [2021-10-28 09:41:21,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:21,635 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 747 transitions. [2021-10-28 09:41:21,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-10-28 09:41:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 747 transitions. [2021-10-28 09:41:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-28 09:41:21,636 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:21,636 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:41:21,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:41:21,637 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:21,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1173566898, now seen corresponding path program 1 times [2021-10-28 09:41:21,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:21,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939004139] [2021-10-28 09:41:21,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:21,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-28 09:41:21,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:21,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939004139] [2021-10-28 09:41:21,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939004139] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:21,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:21,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:41:21,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19409435] [2021-10-28 09:41:21,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:41:21,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:21,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:41:21,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:21,686 INFO L87 Difference]: Start difference. First operand 453 states and 747 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-10-28 09:41:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:21,748 INFO L93 Difference]: Finished difference Result 855 states and 1347 transitions. [2021-10-28 09:41:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:41:21,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 58 [2021-10-28 09:41:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:21,753 INFO L225 Difference]: With dead ends: 855 [2021-10-28 09:41:21,753 INFO L226 Difference]: Without dead ends: 569 [2021-10-28 09:41:21,753 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-10-28 09:41:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 424. [2021-10-28 09:41:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 422 states have (on average 1.6374407582938388) internal successors, (691), 423 states have internal predecessors, (691), 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-10-28 09:41:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 691 transitions. [2021-10-28 09:41:21,796 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 691 transitions. Word has length 58 [2021-10-28 09:41:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:21,796 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 691 transitions. [2021-10-28 09:41:21,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-10-28 09:41:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 691 transitions. [2021-10-28 09:41:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-28 09:41:21,798 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:21,798 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:41:21,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:41:21,798 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash 328528683, now seen corresponding path program 1 times [2021-10-28 09:41:21,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:21,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486135354] [2021-10-28 09:41:21,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:21,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-28 09:41:21,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:21,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486135354] [2021-10-28 09:41:21,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486135354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:21,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:21,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:41:21,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356063214] [2021-10-28 09:41:21,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:41:21,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:21,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:41:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:21,877 INFO L87 Difference]: Start difference. First operand 424 states and 691 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-10-28 09:41:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:21,973 INFO L93 Difference]: Finished difference Result 1181 states and 1941 transitions. [2021-10-28 09:41:21,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:41:21,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 58 [2021-10-28 09:41:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:21,978 INFO L225 Difference]: With dead ends: 1181 [2021-10-28 09:41:21,978 INFO L226 Difference]: Without dead ends: 787 [2021-10-28 09:41:21,979 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2021-10-28 09:41:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 642. [2021-10-28 09:41:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 640 states have (on average 1.6875) internal successors, (1080), 641 states have internal predecessors, (1080), 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-10-28 09:41:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1080 transitions. [2021-10-28 09:41:22,037 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1080 transitions. Word has length 58 [2021-10-28 09:41:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:22,037 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 1080 transitions. [2021-10-28 09:41:22,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-10-28 09:41:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1080 transitions. [2021-10-28 09:41:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-28 09:41:22,044 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:22,044 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:41:22,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:41:22,045 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:22,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:22,046 INFO L85 PathProgramCache]: Analyzing trace with hash 87613521, now seen corresponding path program 1 times [2021-10-28 09:41:22,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:22,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479869894] [2021-10-28 09:41:22,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:22,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-28 09:41:22,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:22,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479869894] [2021-10-28 09:41:22,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479869894] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:22,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:22,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:41:22,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426583048] [2021-10-28 09:41:22,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:41:22,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:22,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:41:22,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:22,105 INFO L87 Difference]: Start difference. First operand 642 states and 1080 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-10-28 09:41:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:22,216 INFO L93 Difference]: Finished difference Result 1821 states and 3086 transitions. [2021-10-28 09:41:22,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:41:22,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 59 [2021-10-28 09:41:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:22,224 INFO L225 Difference]: With dead ends: 1821 [2021-10-28 09:41:22,224 INFO L226 Difference]: Without dead ends: 1213 [2021-10-28 09:41:22,225 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:22,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2021-10-28 09:41:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1068. [2021-10-28 09:41:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1066 states have (on average 1.7195121951219512) internal successors, (1833), 1067 states have internal predecessors, (1833), 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-10-28 09:41:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1833 transitions. [2021-10-28 09:41:22,327 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1833 transitions. Word has length 59 [2021-10-28 09:41:22,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:22,327 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 1833 transitions. [2021-10-28 09:41:22,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-10-28 09:41:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1833 transitions. [2021-10-28 09:41:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-28 09:41:22,330 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:22,330 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:41:22,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:41:22,331 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:22,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:22,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1318592951, now seen corresponding path program 1 times [2021-10-28 09:41:22,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:22,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10024662] [2021-10-28 09:41:22,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:22,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-28 09:41:22,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:22,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10024662] [2021-10-28 09:41:22,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10024662] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:22,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:22,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:41:22,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512353740] [2021-10-28 09:41:22,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:41:22,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:41:22,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:22,376 INFO L87 Difference]: Start difference. First operand 1068 states and 1833 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-10-28 09:41:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:22,534 INFO L93 Difference]: Finished difference Result 3077 states and 5307 transitions. [2021-10-28 09:41:22,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:41:22,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-10-28 09:41:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:22,546 INFO L225 Difference]: With dead ends: 3077 [2021-10-28 09:41:22,546 INFO L226 Difference]: Without dead ends: 2047 [2021-10-28 09:41:22,548 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:41:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2021-10-28 09:41:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1902. [2021-10-28 09:41:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1900 states have (on average 1.731578947368421) internal successors, (3290), 1901 states have internal predecessors, (3290), 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-10-28 09:41:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 3290 transitions. [2021-10-28 09:41:22,718 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 3290 transitions. Word has length 60 [2021-10-28 09:41:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:22,718 INFO L470 AbstractCegarLoop]: Abstraction has 1902 states and 3290 transitions. [2021-10-28 09:41:22,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-10-28 09:41:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 3290 transitions. [2021-10-28 09:41:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-28 09:41:22,722 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:41:22,722 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:41:22,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:41:22,723 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:41:22,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1559369011, now seen corresponding path program 1 times [2021-10-28 09:41:22,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:22,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064387404] [2021-10-28 09:41:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:22,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 09:41:22,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:22,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064387404] [2021-10-28 09:41:22,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064387404] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:22,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:22,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:41:22,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412070544] [2021-10-28 09:41:22,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:41:22,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:22,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:41:22,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:41:22,790 INFO L87 Difference]: Start difference. First operand 1902 states and 3290 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-10-28 09:41:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:22,943 INFO L93 Difference]: Finished difference Result 1933 states and 3332 transitions. [2021-10-28 09:41:22,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:41:22,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-10-28 09:41:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:41:22,944 INFO L225 Difference]: With dead ends: 1933 [2021-10-28 09:41:22,945 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 09:41:22,947 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:41:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 09:41:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 09:41:22,947 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-10-28 09:41:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 09:41:22,948 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2021-10-28 09:41:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:41:22,948 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 09:41:22,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-10-28 09:41:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 09:41:22,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 09:41:22,951 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:41:22,951 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:41:22,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:41:22,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 09:41:22,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:22,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:23,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:24,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:25,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:26,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:26,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:26,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:26,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:41:31,765 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2021-10-28 09:41:31,765 INFO L853 garLoopResultBuilder]: At program point L2546(lines 2541 2549) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,765 INFO L857 garLoopResultBuilder]: For program point L2216(lines 2216 2228) no Hoare annotation was computed. [2021-10-28 09:41:31,766 INFO L853 garLoopResultBuilder]: At program point L168(lines 148 170) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_client_forwardReceiver1~0 0) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,766 INFO L853 garLoopResultBuilder]: At program point L302(lines 292 390) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,766 INFO L853 garLoopResultBuilder]: At program point L269(lines 259 393) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,766 INFO L853 garLoopResultBuilder]: At program point L2417(lines 2412 2420) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ULTIMATE.start_main_~tmp~1 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-10-28 09:41:31,766 INFO L853 garLoopResultBuilder]: At program point L2252(lines 2235 2258) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-28 09:41:31,766 INFO L857 garLoopResultBuilder]: For program point L2219(lines 2219 2227) no Hoare annotation was computed. [2021-10-28 09:41:31,766 INFO L853 garLoopResultBuilder]: At program point L2252-1(lines 2235 2258) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ULTIMATE.start_main_~tmp~1 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1))) (or (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_incoming_~client)))) [2021-10-28 09:41:31,766 INFO L857 garLoopResultBuilder]: For program point L503(lines 503 511) no Hoare annotation was computed. [2021-10-28 09:41:31,767 INFO L857 garLoopResultBuilder]: For program point L503-2(lines 503 511) no Hoare annotation was computed. [2021-10-28 09:41:31,767 INFO L853 garLoopResultBuilder]: At program point L371(lines 361 384) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,767 INFO L857 garLoopResultBuilder]: For program point L503-4(lines 503 511) no Hoare annotation was computed. [2021-10-28 09:41:31,767 INFO L853 garLoopResultBuilder]: At program point L338(lines 328 387) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,767 INFO L857 garLoopResultBuilder]: For program point L2222(lines 2222 2226) no Hoare annotation was computed. [2021-10-28 09:41:31,767 INFO L857 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2021-10-28 09:41:31,767 INFO L857 garLoopResultBuilder]: For program point L207-1(line 207) no Hoare annotation was computed. [2021-10-28 09:41:31,767 INFO L853 garLoopResultBuilder]: At program point L2222-2(lines 1 2549) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,767 INFO L853 garLoopResultBuilder]: At program point L2487-1(lines 2482 2490) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ULTIMATE.start_main_~tmp~1 1)) (.cse6 (= ~rjh~0 2)) (.cse7 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse8 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse9 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-28 09:41:31,768 INFO L853 garLoopResultBuilder]: At program point L2487(lines 2482 2490) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse2 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ULTIMATE.start_main_~tmp~1 1)) (.cse6 (= ~rjh~0 2)) (.cse7 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse8 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse9 (= ULTIMATE.start_outgoing_~msg 1))) (or (and (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse0 .cse1 .cse2 .cse3 (= ~__ste_email_to0~0 2) .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-28 09:41:31,768 INFO L860 garLoopResultBuilder]: At program point L2487-3(lines 2482 2490) the Hoare annotation is: true [2021-10-28 09:41:31,768 INFO L853 garLoopResultBuilder]: At program point L2487-2(lines 2482 2490) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-28 09:41:31,768 INFO L857 garLoopResultBuilder]: For program point L307(lines 307 311) no Hoare annotation was computed. [2021-10-28 09:41:31,768 INFO L853 garLoopResultBuilder]: At program point L2322(lines 1 2549) the Hoare annotation is: (and (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1) (= 2 ULTIMATE.start_incoming_~client)) [2021-10-28 09:41:31,768 INFO L857 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2021-10-28 09:41:31,768 INFO L853 garLoopResultBuilder]: At program point L208(lines 1183 1200) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse2 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= ULTIMATE.start_main_~tmp~1 1)) (.cse7 (= ~rjh~0 2)) (.cse8 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse9 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse10 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_setEmailTo_~handle 1) .cse6 .cse7 .cse8 .cse9 .cse10) (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 .cse10 (= 2 ULTIMATE.start_incoming_~client)))) [2021-10-28 09:41:31,768 INFO L853 garLoopResultBuilder]: At program point L2322-1(lines 1 2549) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-28 09:41:31,768 INFO L860 garLoopResultBuilder]: At program point L208-1(lines 1183 1200) the Hoare annotation is: true [2021-10-28 09:41:31,768 INFO L857 garLoopResultBuilder]: For program point L506(lines 506 510) no Hoare annotation was computed. [2021-10-28 09:41:31,769 INFO L853 garLoopResultBuilder]: At program point L506-2(lines 499 514) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1)) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-28 09:41:31,769 INFO L857 garLoopResultBuilder]: For program point L506-3(lines 506 510) no Hoare annotation was computed. [2021-10-28 09:41:31,769 INFO L853 garLoopResultBuilder]: At program point L506-5(lines 499 514) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-28 09:41:31,769 INFO L857 garLoopResultBuilder]: For program point L506-6(lines 506 510) no Hoare annotation was computed. [2021-10-28 09:41:31,769 INFO L853 garLoopResultBuilder]: At program point L506-8(lines 499 514) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ULTIMATE.start_main_~tmp~1 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1))) (or (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_incoming_~client)))) [2021-10-28 09:41:31,769 INFO L857 garLoopResultBuilder]: For program point L540(lines 540 548) no Hoare annotation was computed. [2021-10-28 09:41:31,769 INFO L857 garLoopResultBuilder]: For program point L540-2(lines 540 548) no Hoare annotation was computed. [2021-10-28 09:41:31,769 INFO L857 garLoopResultBuilder]: For program point L540-4(lines 540 548) no Hoare annotation was computed. [2021-10-28 09:41:31,769 INFO L857 garLoopResultBuilder]: For program point L2192(lines 2192 2208) no Hoare annotation was computed. [2021-10-28 09:41:31,769 INFO L857 garLoopResultBuilder]: For program point L2192-1(lines 2192 2208) no Hoare annotation was computed. [2021-10-28 09:41:31,770 INFO L857 garLoopResultBuilder]: For program point L376(lines 376 380) no Hoare annotation was computed. [2021-10-28 09:41:31,770 INFO L857 garLoopResultBuilder]: For program point L343(lines 343 347) no Hoare annotation was computed. [2021-10-28 09:41:31,770 INFO L853 garLoopResultBuilder]: At program point L376-1(lines 251 394) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,770 INFO L857 garLoopResultBuilder]: For program point L543(lines 543 547) no Hoare annotation was computed. [2021-10-28 09:41:31,770 INFO L853 garLoopResultBuilder]: At program point L543-2(lines 536 551) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-28 09:41:31,770 INFO L857 garLoopResultBuilder]: For program point L543-3(lines 543 547) no Hoare annotation was computed. [2021-10-28 09:41:31,770 INFO L853 garLoopResultBuilder]: At program point L543-5(lines 536 551) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= ULTIMATE.start_main_~tmp~1 1)) (.cse5 (= ~rjh~0 2)) (.cse6 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse7 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse8 (= ULTIMATE.start_outgoing_~msg 1))) (or (and (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_setEmailTo_~handle 1) .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-10-28 09:41:31,770 INFO L857 garLoopResultBuilder]: For program point L543-6(lines 543 547) no Hoare annotation was computed. [2021-10-28 09:41:31,770 INFO L853 garLoopResultBuilder]: At program point L543-8(lines 536 551) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-28 09:41:31,770 INFO L853 garLoopResultBuilder]: At program point L313(lines 303 389) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,771 INFO L853 garLoopResultBuilder]: At program point L280(lines 270 392) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,771 INFO L857 garLoopResultBuilder]: For program point L181(lines 181 188) no Hoare annotation was computed. [2021-10-28 09:41:31,771 INFO L857 garLoopResultBuilder]: For program point L2196(lines 2196 2207) no Hoare annotation was computed. [2021-10-28 09:41:31,771 INFO L860 garLoopResultBuilder]: At program point L181-1(lines 181 188) the Hoare annotation is: true [2021-10-28 09:41:31,771 INFO L857 garLoopResultBuilder]: For program point L2196-1(lines 2196 2207) no Hoare annotation was computed. [2021-10-28 09:41:31,771 INFO L857 garLoopResultBuilder]: For program point L2263(lines 2263 2275) no Hoare annotation was computed. [2021-10-28 09:41:31,771 INFO L857 garLoopResultBuilder]: For program point L2263-2(lines 2263 2275) no Hoare annotation was computed. [2021-10-28 09:41:31,771 INFO L857 garLoopResultBuilder]: For program point L2263-4(lines 2263 2275) no Hoare annotation was computed. [2021-10-28 09:41:31,771 INFO L857 garLoopResultBuilder]: For program point L447(lines 447 458) no Hoare annotation was computed. [2021-10-28 09:41:31,771 INFO L857 garLoopResultBuilder]: For program point L447-1(lines 447 458) no Hoare annotation was computed. [2021-10-28 09:41:31,771 INFO L853 garLoopResultBuilder]: At program point L349(lines 339 386) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,771 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 09:41:31,772 INFO L857 garLoopResultBuilder]: For program point L2266(lines 2266 2274) no Hoare annotation was computed. [2021-10-28 09:41:31,772 INFO L857 garLoopResultBuilder]: For program point L2266-2(lines 2266 2274) no Hoare annotation was computed. [2021-10-28 09:41:31,772 INFO L857 garLoopResultBuilder]: For program point L2200(lines 2200 2206) no Hoare annotation was computed. [2021-10-28 09:41:31,772 INFO L857 garLoopResultBuilder]: For program point L2266-4(lines 2266 2274) no Hoare annotation was computed. [2021-10-28 09:41:31,772 INFO L857 garLoopResultBuilder]: For program point L2200-1(lines 2200 2206) no Hoare annotation was computed. [2021-10-28 09:41:31,772 INFO L857 garLoopResultBuilder]: For program point L318(lines 318 325) no Hoare annotation was computed. [2021-10-28 09:41:31,772 INFO L853 garLoopResultBuilder]: At program point L2399(lines 2394 2402) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ULTIMATE.start_main_~tmp~1 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-10-28 09:41:31,772 INFO L857 garLoopResultBuilder]: For program point L285(lines 285 289) no Hoare annotation was computed. [2021-10-28 09:41:31,772 INFO L857 garLoopResultBuilder]: For program point L252(lines 251 394) no Hoare annotation was computed. [2021-10-28 09:41:31,772 INFO L857 garLoopResultBuilder]: For program point L484(lines 484 495) no Hoare annotation was computed. [2021-10-28 09:41:31,772 INFO L857 garLoopResultBuilder]: For program point L451(lines 451 457) no Hoare annotation was computed. [2021-10-28 09:41:31,773 INFO L857 garLoopResultBuilder]: For program point L484-1(lines 484 495) no Hoare annotation was computed. [2021-10-28 09:41:31,773 INFO L857 garLoopResultBuilder]: For program point L451-1(lines 451 457) no Hoare annotation was computed. [2021-10-28 09:41:31,773 INFO L857 garLoopResultBuilder]: For program point L253(lines 253 257) no Hoare annotation was computed. [2021-10-28 09:41:31,773 INFO L857 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2021-10-28 09:41:31,773 INFO L857 garLoopResultBuilder]: For program point L2269-3(lines 2269 2273) no Hoare annotation was computed. [2021-10-28 09:41:31,773 INFO L853 garLoopResultBuilder]: At program point L2269-2(lines 1 2549) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (= ULTIMATE.start_main_~tmp~1 1) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,773 INFO L853 garLoopResultBuilder]: At program point L2269-5(lines 1 2549) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1)) (= ULTIMATE.start_setClientId_~handle 2)) [2021-10-28 09:41:31,773 INFO L857 garLoopResultBuilder]: For program point L2269-6(lines 2269 2273) no Hoare annotation was computed. [2021-10-28 09:41:31,773 INFO L853 garLoopResultBuilder]: At program point L2269-8(lines 1 2549) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_client_forwardReceiver1~0 0) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,773 INFO L857 garLoopResultBuilder]: For program point L354(lines 354 358) no Hoare annotation was computed. [2021-10-28 09:41:31,773 INFO L860 garLoopResultBuilder]: At program point L189(lines 171 191) the Hoare annotation is: true [2021-10-28 09:41:31,773 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 09:41:31,774 INFO L853 garLoopResultBuilder]: At program point L2205-1(lines 2188 2211) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (not (= ~rjh~0 1))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start_createEmail_~to 1))) (.cse4 (= ULTIMATE.start_main_~tmp~1 1)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_getClientForwardReceiver_#res| 0)) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_createEmail_~to) .cse3 .cse4 (= ~rjh~0 2) .cse5 .cse6))) [2021-10-28 09:41:31,774 INFO L853 garLoopResultBuilder]: At program point L2205(lines 2188 2211) the Hoare annotation is: (and (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1) (= 2 ULTIMATE.start_incoming_~client)) [2021-10-28 09:41:31,774 INFO L857 garLoopResultBuilder]: For program point L521(lines 521 532) no Hoare annotation was computed. [2021-10-28 09:41:31,774 INFO L857 garLoopResultBuilder]: For program point L488(lines 488 494) no Hoare annotation was computed. [2021-10-28 09:41:31,774 INFO L857 garLoopResultBuilder]: For program point L521-1(lines 521 532) no Hoare annotation was computed. [2021-10-28 09:41:31,774 INFO L857 garLoopResultBuilder]: For program point L521-2(lines 521 532) no Hoare annotation was computed. [2021-10-28 09:41:31,774 INFO L857 garLoopResultBuilder]: For program point L488-1(lines 488 494) no Hoare annotation was computed. [2021-10-28 09:41:31,774 INFO L857 garLoopResultBuilder]: For program point L521-3(lines 521 532) no Hoare annotation was computed. [2021-10-28 09:41:31,774 INFO L857 garLoopResultBuilder]: For program point L2239-1(lines 2239 2255) no Hoare annotation was computed. [2021-10-28 09:41:31,774 INFO L857 garLoopResultBuilder]: For program point L2239(lines 2239 2255) no Hoare annotation was computed. [2021-10-28 09:41:31,774 INFO L857 garLoopResultBuilder]: For program point L125(lines 125 133) no Hoare annotation was computed. [2021-10-28 09:41:31,775 INFO L853 garLoopResultBuilder]: At program point L456(lines 443 461) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse2 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= ULTIMATE.start_main_~tmp~1 1)) (.cse7 (= ~rjh~0 2)) (.cse8 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse9 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse10 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_setEmailTo_~handle 1) .cse6 .cse7 .cse8 .cse9 .cse10) (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 .cse10 (= 2 ULTIMATE.start_incoming_~client)))) [2021-10-28 09:41:31,775 INFO L860 garLoopResultBuilder]: At program point L456-1(lines 443 461) the Hoare annotation is: true [2021-10-28 09:41:31,775 INFO L853 garLoopResultBuilder]: At program point L291(lines 281 391) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,775 INFO L853 garLoopResultBuilder]: At program point L2538(lines 1 2549) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,775 INFO L857 garLoopResultBuilder]: For program point L259(lines 259 393) no Hoare annotation was computed. [2021-10-28 09:41:31,775 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 09:41:31,775 INFO L857 garLoopResultBuilder]: For program point L525(lines 525 531) no Hoare annotation was computed. [2021-10-28 09:41:31,775 INFO L857 garLoopResultBuilder]: For program point L525-1(lines 525 531) no Hoare annotation was computed. [2021-10-28 09:41:31,775 INFO L857 garLoopResultBuilder]: For program point L525-2(lines 525 531) no Hoare annotation was computed. [2021-10-28 09:41:31,775 INFO L857 garLoopResultBuilder]: For program point L525-3(lines 525 531) no Hoare annotation was computed. [2021-10-28 09:41:31,776 INFO L853 garLoopResultBuilder]: At program point L2408(lines 2403 2411) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ULTIMATE.start_main_~tmp~1 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-10-28 09:41:31,776 INFO L853 garLoopResultBuilder]: At program point L360(lines 350 385) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,776 INFO L853 garLoopResultBuilder]: At program point L327(lines 314 388) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,776 INFO L857 garLoopResultBuilder]: For program point L2243-1(lines 2243 2254) no Hoare annotation was computed. [2021-10-28 09:41:31,776 INFO L857 garLoopResultBuilder]: For program point L2243(lines 2243 2254) no Hoare annotation was computed. [2021-10-28 09:41:31,776 INFO L853 garLoopResultBuilder]: At program point L493(lines 480 498) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse2 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= ULTIMATE.start_main_~tmp~1 1)) (.cse7 (= ~rjh~0 2)) (.cse8 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse9 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse10 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_setEmailTo_~handle 1) .cse6 .cse7 .cse8 .cse9 .cse10) (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 .cse10 (= 2 ULTIMATE.start_incoming_~client)))) [2021-10-28 09:41:31,776 INFO L860 garLoopResultBuilder]: At program point L493-1(lines 480 498) the Hoare annotation is: true [2021-10-28 09:41:31,776 INFO L853 garLoopResultBuilder]: At program point L395(lines 250 396) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-10-28 09:41:31,776 INFO L857 garLoopResultBuilder]: For program point L296(lines 296 300) no Hoare annotation was computed. [2021-10-28 09:41:31,776 INFO L857 garLoopResultBuilder]: For program point L263(lines 263 267) no Hoare annotation was computed. [2021-10-28 09:41:31,777 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 09:41:31,777 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2021-10-28 09:41:31,777 INFO L853 garLoopResultBuilder]: At program point L2345-1(lines 1 2549) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ULTIMATE.start_main_~tmp~1 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-10-28 09:41:31,777 INFO L857 garLoopResultBuilder]: For program point L2345(lines 2345 2352) no Hoare annotation was computed. [2021-10-28 09:41:31,777 INFO L857 garLoopResultBuilder]: For program point L2345-2(lines 2345 2352) no Hoare annotation was computed. [2021-10-28 09:41:31,777 INFO L853 garLoopResultBuilder]: At program point L2511(lines 2500 2514) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-28 09:41:31,777 INFO L857 garLoopResultBuilder]: For program point L2247-1(lines 2247 2253) no Hoare annotation was computed. [2021-10-28 09:41:31,777 INFO L857 garLoopResultBuilder]: For program point L2247(lines 2247 2253) no Hoare annotation was computed. [2021-10-28 09:41:31,777 INFO L853 garLoopResultBuilder]: At program point L530(lines 517 535) the Hoare annotation is: (and (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-28 09:41:31,777 INFO L853 garLoopResultBuilder]: At program point L530-1(lines 517 535) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ULTIMATE.start_main_~tmp~1 1)) (.cse6 (= ~rjh~0 2)) (.cse7 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse8 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse9 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-28 09:41:31,778 INFO L853 garLoopResultBuilder]: At program point L530-2(lines 517 535) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-28 09:41:31,778 INFO L860 garLoopResultBuilder]: At program point L530-3(lines 517 535) the Hoare annotation is: true [2021-10-28 09:41:31,778 INFO L860 garLoopResultBuilder]: At program point L2479-1(lines 2454 2481) the Hoare annotation is: true [2021-10-28 09:41:31,778 INFO L853 garLoopResultBuilder]: At program point L2479(lines 2454 2481) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ULTIMATE.start_main_~tmp~1 1)) (.cse6 (= ~rjh~0 2)) (.cse7 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse8 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse9 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-28 09:41:31,778 INFO L857 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2021-10-28 09:41:31,778 INFO L857 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2021-10-28 09:41:31,778 INFO L857 garLoopResultBuilder]: For program point L1191(lines 1191 1197) no Hoare annotation was computed. [2021-10-28 09:41:31,778 INFO L857 garLoopResultBuilder]: For program point L1191-2(lines 1191 1197) no Hoare annotation was computed. [2021-10-28 09:41:31,797 INFO L731 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:41:31,798 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:41:31,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:41:31 BoogieIcfgContainer [2021-10-28 09:41:31,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:41:31,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:41:31,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:41:31,839 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:41:31,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:41:17" (3/4) ... [2021-10-28 09:41:31,842 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 09:41:31,864 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2021-10-28 09:41:31,866 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2021-10-28 09:41:31,867 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-28 09:41:31,869 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-28 09:41:31,871 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:41:31,872 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:41:31,897 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,898 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && tmp == 1) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,898 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((__ste_client_forwardReceiver1 == 0 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1)) && handle == 2 [2021-10-28 09:41:31,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && __ste_client_forwardReceiver1 == 0) && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && __ste_client_forwardReceiver1 == 0) && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,900 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,900 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,900 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,900 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,900 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,902 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,902 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,902 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,903 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-10-28 09:41:31,903 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == 3 && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1)) && msg == 1 [2021-10-28 09:41:31,903 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 [2021-10-28 09:41:31,903 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 [2021-10-28 09:41:31,904 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1 [2021-10-28 09:41:31,904 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1 [2021-10-28 09:41:31,904 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1 [2021-10-28 09:41:31,905 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client [2021-10-28 09:41:31,905 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client [2021-10-28 09:41:31,905 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-10-28 09:41:31,906 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || (((((((((handle == 3 && handle == 1) && \result == 1) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-10-28 09:41:31,906 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-10-28 09:41:31,906 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-10-28 09:41:31,906 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-10-28 09:41:31,907 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-10-28 09:41:31,907 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) [2021-10-28 09:41:31,907 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) || (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && 2 == client) [2021-10-28 09:41:31,908 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) [2021-10-28 09:41:31,908 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) || (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && 2 == client) [2021-10-28 09:41:31,908 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) [2021-10-28 09:41:31,908 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == 3 && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 [2021-10-28 09:41:31,909 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == 3 && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-10-28 09:41:31,909 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == 3 && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 [2021-10-28 09:41:31,909 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && !(rjh == 1)) && \result == 1) && !(to == 1)) && tmp == 1) && \result == 1) && msg == 1) && \result == 0) || ((((((((handle == 3 && !(rjh == 1)) && \result == 1) && 2 == to) && !(to == 1)) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) [2021-10-28 09:41:31,909 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == 3 && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-10-28 09:41:31,910 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == 3 && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-10-28 09:41:31,910 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == 3 && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 [2021-10-28 09:41:31,910 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == 3 && !(\result == 0)) && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 [2021-10-28 09:41:31,984 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:41:31,984 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:41:31,985 INFO L168 Benchmark]: Toolchain (without parser) took 17047.10 ms. Allocated memory was 142.6 MB in the beginning and 268.4 MB in the end (delta: 125.8 MB). Free memory was 99.3 MB in the beginning and 90.6 MB in the end (delta: 8.7 MB). Peak memory consumption was 134.6 MB. Max. memory is 16.1 GB. [2021-10-28 09:41:31,985 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.6 MB. Free memory was 117.7 MB in the beginning and 117.7 MB in the end (delta: 80.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:41:31,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.93 ms. Allocated memory is still 142.6 MB. Free memory was 99.1 MB in the beginning and 92.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-28 09:41:31,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.64 ms. Allocated memory is still 142.6 MB. Free memory was 92.8 MB in the beginning and 87.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:41:31,987 INFO L168 Benchmark]: Boogie Preprocessor took 48.00 ms. Allocated memory is still 142.6 MB. Free memory was 87.7 MB in the beginning and 84.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:41:31,987 INFO L168 Benchmark]: RCFGBuilder took 1332.58 ms. Allocated memory was 142.6 MB in the beginning and 184.5 MB in the end (delta: 41.9 MB). Free memory was 84.4 MB in the beginning and 124.5 MB in the end (delta: -40.1 MB). Peak memory consumption was 41.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:41:31,987 INFO L168 Benchmark]: TraceAbstraction took 14615.90 ms. Allocated memory was 184.5 MB in the beginning and 268.4 MB in the end (delta: 83.9 MB). Free memory was 124.5 MB in the beginning and 106.3 MB in the end (delta: 18.2 MB). Peak memory consumption was 137.3 MB. Max. memory is 16.1 GB. [2021-10-28 09:41:31,988 INFO L168 Benchmark]: Witness Printer took 144.90 ms. Allocated memory is still 268.4 MB. Free memory was 106.3 MB in the beginning and 90.6 MB in the end (delta: 15.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-28 09:41:31,990 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.23 ms. Allocated memory is still 142.6 MB. Free memory was 117.7 MB in the beginning and 117.7 MB in the end (delta: 80.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 760.93 ms. Allocated memory is still 142.6 MB. Free memory was 99.1 MB in the beginning and 92.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 138.64 ms. Allocated memory is still 142.6 MB. Free memory was 92.8 MB in the beginning and 87.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.00 ms. Allocated memory is still 142.6 MB. Free memory was 87.7 MB in the beginning and 84.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1332.58 ms. Allocated memory was 142.6 MB in the beginning and 184.5 MB in the end (delta: 41.9 MB). Free memory was 84.4 MB in the beginning and 124.5 MB in the end (delta: -40.1 MB). Peak memory consumption was 41.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14615.90 ms. Allocated memory was 184.5 MB in the beginning and 268.4 MB in the end (delta: 83.9 MB). Free memory was 124.5 MB in the beginning and 106.3 MB in the end (delta: 18.2 MB). Peak memory consumption was 137.3 MB. Max. memory is 16.1 GB. * Witness Printer took 144.90 ms. Allocated memory is still 268.4 MB. Free memory was 106.3 MB in the beginning and 90.6 MB in the end (delta: 15.7 MB). Peak memory consumption was 16.8 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: 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, 134 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3584 SDtfs, 5529 SDslu, 5942 SDs, 0 SdLazy, 519 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1902occurred in iteration=16, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 1787 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 54 PreInvPairs, 936 NumberOfFragments, 1830 HoareAnnotationTreeSize, 54 FomulaSimplifications, 23999192 FormulaSimplificationTreeSizeReduction, 3.2s HoareSimplificationTime, 54 FomulaSimplificationsInter, 732586 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 882 NumberOfCodeBlocks, 882 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 864 ConstructedInterpolants, 0 QuantifiedInterpolants, 1328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 734 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 98/102 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: 480]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((__ste_client_forwardReceiver1 == 0 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1)) && handle == 2 - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: (((((handle == 3 && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((handle == 3 && __ste_client_forwardReceiver1 == 0) && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: ((((((((((((handle == 3 && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 2412]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: ((((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || (((((((((handle == 3 && handle == 1) && \result == 1) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2188]: Loop Invariant Derived loop invariant: (((((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2482]: Loop Invariant Derived loop invariant: ((((((((((((handle == 3 && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 2454]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((handle == 3 && __ste_client_forwardReceiver1 == 0) && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2188]: Loop Invariant Derived loop invariant: (((((((handle == 3 && !(rjh == 1)) && \result == 1) && !(to == 1)) && tmp == 1) && \result == 1) && msg == 1) && \result == 0) || ((((((((handle == 3 && !(rjh == 1)) && \result == 1) && 2 == to) && !(to == 1)) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client - InvariantResult [Line: 2454]: Loop Invariant Derived loop invariant: ((((((((((((handle == 3 && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: ((!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 2500]: Loop Invariant Derived loop invariant: ((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 - InvariantResult [Line: 1183]: Loop Invariant Derived loop invariant: (((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 2482]: Loop Invariant Derived loop invariant: (((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: (((((handle == 3 && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1)) && msg == 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: (((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 2403]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 2482]: Loop Invariant Derived loop invariant: ((((((handle == 3 && !(\result == 0)) && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((handle == 3 && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: (((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) || (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 2482]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && tmp == 1) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1183]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2235]: Loop Invariant Derived loop invariant: (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2394]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: (((((((handle == 3 && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: (((((handle == 3 && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2235]: Loop Invariant Derived loop invariant: (((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) || (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) RESULT: Ultimate proved your program to be correct! [2021-10-28 09:41:32,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa519823-2a66-4196-86f1-d4488ecc1470/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...