./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX --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 de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 08:37:00,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 08:37:00,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 08:37:01,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 08:37:01,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 08:37:01,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 08:37:01,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 08:37:01,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 08:37:01,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 08:37:01,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 08:37:01,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 08:37:01,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 08:37:01,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 08:37:01,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 08:37:01,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 08:37:01,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 08:37:01,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 08:37:01,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 08:37:01,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 08:37:01,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 08:37:01,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 08:37:01,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 08:37:01,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 08:37:01,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 08:37:01,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 08:37:01,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 08:37:01,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 08:37:01,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 08:37:01,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 08:37:01,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 08:37:01,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 08:37:01,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 08:37:01,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 08:37:01,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 08:37:01,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 08:37:01,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 08:37:01,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 08:37:01,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 08:37:01,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 08:37:01,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 08:37:01,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 08:37:01,096 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-09 08:37:01,122 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 08:37:01,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 08:37:01,123 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 08:37:01,123 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 08:37:01,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 08:37:01,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 08:37:01,125 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 08:37:01,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 08:37:01,125 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 08:37:01,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 08:37:01,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 08:37:01,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 08:37:01,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 08:37:01,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 08:37:01,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 08:37:01,127 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 08:37:01,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 08:37:01,127 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 08:37:01,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 08:37:01,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 08:37:01,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 08:37:01,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 08:37:01,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 08:37:01,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 08:37:01,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 08:37:01,129 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 08:37:01,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 08:37:01,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 08:37:01,130 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 08:37:01,130 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 08:37:01,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 08:37:01,130 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 08:37:01,131 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_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/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_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX 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 -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 [2021-11-09 08:37:01,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 08:37:01,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 08:37:01,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 08:37:01,414 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 08:37:01,415 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 08:37:01,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2021-11-09 08:37:01,506 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/data/d0ca892df/40d4c6de24ce405cad6757c95ac2572d/FLAG56e9945c1 [2021-11-09 08:37:02,042 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 08:37:02,043 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/sv-benchmarks/c/systemc/bist_cell.cil.c [2021-11-09 08:37:02,069 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/data/d0ca892df/40d4c6de24ce405cad6757c95ac2572d/FLAG56e9945c1 [2021-11-09 08:37:02,374 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/data/d0ca892df/40d4c6de24ce405cad6757c95ac2572d [2021-11-09 08:37:02,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 08:37:02,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 08:37:02,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 08:37:02,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 08:37:02,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 08:37:02,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:37:02" (1/1) ... [2021-11-09 08:37:02,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dafc44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02, skipping insertion in model container [2021-11-09 08:37:02,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:37:02" (1/1) ... [2021-11-09 08:37:02,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 08:37:02,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 08:37:02,627 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_e97821c9-c06a-4e60-9885-10a59a83fd26/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2021-11-09 08:37:02,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 08:37:02,690 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 08:37:02,703 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_e97821c9-c06a-4e60-9885-10a59a83fd26/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2021-11-09 08:37:02,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 08:37:02,770 INFO L208 MainTranslator]: Completed translation [2021-11-09 08:37:02,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02 WrapperNode [2021-11-09 08:37:02,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 08:37:02,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 08:37:02,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 08:37:02,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 08:37:02,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02" (1/1) ... [2021-11-09 08:37:02,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02" (1/1) ... [2021-11-09 08:37:02,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 08:37:02,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 08:37:02,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 08:37:02,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 08:37:02,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02" (1/1) ... [2021-11-09 08:37:02,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02" (1/1) ... [2021-11-09 08:37:02,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02" (1/1) ... [2021-11-09 08:37:02,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02" (1/1) ... [2021-11-09 08:37:02,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02" (1/1) ... [2021-11-09 08:37:02,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02" (1/1) ... [2021-11-09 08:37:02,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02" (1/1) ... [2021-11-09 08:37:02,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 08:37:02,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 08:37:02,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 08:37:02,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 08:37:02,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02" (1/1) ... [2021-11-09 08:37:02,944 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 08:37:02,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:37:02,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 08:37:02,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 08:37:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 08:37:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 08:37:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 08:37:03,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 08:37:03,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 08:37:03,590 INFO L299 CfgBuilder]: Removed 64 assume(true) statements. [2021-11-09 08:37:03,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:37:03 BoogieIcfgContainer [2021-11-09 08:37:03,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 08:37:03,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 08:37:03,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 08:37:03,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 08:37:03,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:37:02" (1/3) ... [2021-11-09 08:37:03,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239b0ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:37:03, skipping insertion in model container [2021-11-09 08:37:03,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:37:02" (2/3) ... [2021-11-09 08:37:03,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239b0ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:37:03, skipping insertion in model container [2021-11-09 08:37:03,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:37:03" (3/3) ... [2021-11-09 08:37:03,604 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2021-11-09 08:37:03,615 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 08:37:03,615 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-09 08:37:03,692 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 08:37:03,699 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-11-09 08:37:03,699 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-09 08:37:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 107 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-11-09 08:37:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-09 08:37:03,734 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:03,735 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] [2021-11-09 08:37:03,736 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:03,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:03,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2021-11-09 08:37:03,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:03,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558895733] [2021-11-09 08:37:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:03,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:03,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:03,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558895733] [2021-11-09 08:37:03,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558895733] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:03,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:03,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:03,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726069608] [2021-11-09 08:37:03,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:04,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:04,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:04,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:04,036 INFO L87 Difference]: Start difference. First operand has 108 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 107 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) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-11-09 08:37:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:04,141 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2021-11-09 08:37:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:04,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2021-11-09 08:37:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:04,164 INFO L225 Difference]: With dead ends: 210 [2021-11-09 08:37:04,164 INFO L226 Difference]: Without dead ends: 104 [2021-11-09 08:37:04,170 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-11-09 08:37:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-09 08:37:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-11-09 08:37:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 103 states have internal predecessors, (170), 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-11-09 08:37:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2021-11-09 08:37:04,251 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2021-11-09 08:37:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:04,252 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2021-11-09 08:37:04,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-11-09 08:37:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2021-11-09 08:37:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-09 08:37:04,259 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:04,260 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, 1, 1, 1, 1, 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-11-09 08:37:04,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 08:37:04,261 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:04,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:04,267 INFO L85 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2021-11-09 08:37:04,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:04,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963105736] [2021-11-09 08:37:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:04,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:04,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:04,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963105736] [2021-11-09 08:37:04,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963105736] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:04,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:04,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:04,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117997062] [2021-11-09 08:37:04,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:04,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:04,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:04,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:04,372 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-11-09 08:37:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:04,398 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2021-11-09 08:37:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:04,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-11-09 08:37:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:04,401 INFO L225 Difference]: With dead ends: 199 [2021-11-09 08:37:04,401 INFO L226 Difference]: Without dead ends: 104 [2021-11-09 08:37:04,402 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-11-09 08:37:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-09 08:37:04,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-11-09 08:37:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6407766990291262) internal successors, (169), 103 states have internal predecessors, (169), 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-11-09 08:37:04,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2021-11-09 08:37:04,414 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2021-11-09 08:37:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:04,414 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2021-11-09 08:37:04,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-11-09 08:37:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2021-11-09 08:37:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-09 08:37:04,423 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:04,424 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, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:04,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 08:37:04,424 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:04,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:04,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2021-11-09 08:37:04,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:04,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161633717] [2021-11-09 08:37:04,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:04,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:04,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:04,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161633717] [2021-11-09 08:37:04,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161633717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:04,530 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:04,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:04,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947894207] [2021-11-09 08:37:04,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:04,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:04,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:04,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:04,533 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-11-09 08:37:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:04,569 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2021-11-09 08:37:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:04,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-11-09 08:37:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:04,577 INFO L225 Difference]: With dead ends: 196 [2021-11-09 08:37:04,577 INFO L226 Difference]: Without dead ends: 104 [2021-11-09 08:37:04,578 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-11-09 08:37:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-09 08:37:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-11-09 08:37:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6310679611650485) internal successors, (168), 103 states have internal predecessors, (168), 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-11-09 08:37:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2021-11-09 08:37:04,589 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2021-11-09 08:37:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:04,589 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2021-11-09 08:37:04,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-11-09 08:37:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2021-11-09 08:37:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-09 08:37:04,602 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:04,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:04,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 08:37:04,603 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2021-11-09 08:37:04,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:04,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895299837] [2021-11-09 08:37:04,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:04,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:04,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:04,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895299837] [2021-11-09 08:37:04,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895299837] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:04,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:04,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:04,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956237968] [2021-11-09 08:37:04,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:04,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:04,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:04,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:04,733 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-11-09 08:37:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:04,763 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2021-11-09 08:37:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:04,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2021-11-09 08:37:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:04,765 INFO L225 Difference]: With dead ends: 193 [2021-11-09 08:37:04,766 INFO L226 Difference]: Without dead ends: 104 [2021-11-09 08:37:04,767 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-11-09 08:37:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-09 08:37:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-11-09 08:37:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6213592233009708) internal successors, (167), 103 states have internal predecessors, (167), 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-11-09 08:37:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2021-11-09 08:37:04,778 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2021-11-09 08:37:04,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:04,779 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2021-11-09 08:37:04,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-11-09 08:37:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2021-11-09 08:37:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-09 08:37:04,781 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:04,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:04,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 08:37:04,782 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:04,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2021-11-09 08:37:04,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:04,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849869669] [2021-11-09 08:37:04,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:04,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:04,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:04,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849869669] [2021-11-09 08:37:04,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849869669] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:04,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:04,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:04,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789334309] [2021-11-09 08:37:04,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:04,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:04,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:04,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:04,856 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-11-09 08:37:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:04,914 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2021-11-09 08:37:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:04,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-09 08:37:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:04,917 INFO L225 Difference]: With dead ends: 271 [2021-11-09 08:37:04,918 INFO L226 Difference]: Without dead ends: 191 [2021-11-09 08:37:04,921 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-11-09 08:37:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-09 08:37:04,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2021-11-09 08:37:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.6310160427807487) internal successors, (305), 187 states have internal predecessors, (305), 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-11-09 08:37:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2021-11-09 08:37:04,947 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2021-11-09 08:37:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:04,947 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2021-11-09 08:37:04,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-11-09 08:37:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2021-11-09 08:37:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-09 08:37:04,951 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:04,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:04,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 08:37:04,952 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:04,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:04,952 INFO L85 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2021-11-09 08:37:04,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:04,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370578855] [2021-11-09 08:37:04,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:04,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:05,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:05,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370578855] [2021-11-09 08:37:05,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370578855] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:05,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:05,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 08:37:05,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275856093] [2021-11-09 08:37:05,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 08:37:05,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:05,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 08:37:05,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 08:37:05,105 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-11-09 08:37:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:05,256 INFO L93 Difference]: Finished difference Result 444 states and 708 transitions. [2021-11-09 08:37:05,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 08:37:05,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-09 08:37:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:05,267 INFO L225 Difference]: With dead ends: 444 [2021-11-09 08:37:05,267 INFO L226 Difference]: Without dead ends: 261 [2021-11-09 08:37:05,269 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-09 08:37:05,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-11-09 08:37:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 194. [2021-11-09 08:37:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 193 states have internal predecessors, (310), 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-11-09 08:37:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 310 transitions. [2021-11-09 08:37:05,316 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 310 transitions. Word has length 72 [2021-11-09 08:37:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:05,316 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 310 transitions. [2021-11-09 08:37:05,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-11-09 08:37:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 310 transitions. [2021-11-09 08:37:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-09 08:37:05,322 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:05,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:05,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 08:37:05,323 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:05,324 INFO L85 PathProgramCache]: Analyzing trace with hash -333833310, now seen corresponding path program 1 times [2021-11-09 08:37:05,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:05,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776684546] [2021-11-09 08:37:05,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:05,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:05,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:05,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776684546] [2021-11-09 08:37:05,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776684546] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:05,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:05,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:05,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889135557] [2021-11-09 08:37:05,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:05,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:05,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:05,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:05,377 INFO L87 Difference]: Start difference. First operand 194 states and 310 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-11-09 08:37:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:05,425 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2021-11-09 08:37:05,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:05,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-09 08:37:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:05,428 INFO L225 Difference]: With dead ends: 408 [2021-11-09 08:37:05,429 INFO L226 Difference]: Without dead ends: 271 [2021-11-09 08:37:05,429 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-11-09 08:37:05,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-09 08:37:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2021-11-09 08:37:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.591760299625468) internal successors, (425), 267 states have internal predecessors, (425), 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-11-09 08:37:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2021-11-09 08:37:05,447 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 72 [2021-11-09 08:37:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:05,447 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2021-11-09 08:37:05,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-11-09 08:37:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2021-11-09 08:37:05,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-09 08:37:05,449 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:05,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:05,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 08:37:05,450 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:05,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:05,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1594439392, now seen corresponding path program 1 times [2021-11-09 08:37:05,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:05,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894556728] [2021-11-09 08:37:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:05,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:05,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:05,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894556728] [2021-11-09 08:37:05,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894556728] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:05,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:05,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 08:37:05,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865035267] [2021-11-09 08:37:05,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 08:37:05,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:05,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 08:37:05,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 08:37:05,531 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-11-09 08:37:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:05,644 INFO L93 Difference]: Finished difference Result 749 states and 1171 transitions. [2021-11-09 08:37:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 08:37:05,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-09 08:37:05,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:05,649 INFO L225 Difference]: With dead ends: 749 [2021-11-09 08:37:05,649 INFO L226 Difference]: Without dead ends: 554 [2021-11-09 08:37:05,650 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-09 08:37:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-11-09 08:37:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 280. [2021-11-09 08:37:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.5663082437275986) internal successors, (437), 279 states have internal predecessors, (437), 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-11-09 08:37:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 437 transitions. [2021-11-09 08:37:05,672 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 437 transitions. Word has length 72 [2021-11-09 08:37:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:05,672 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 437 transitions. [2021-11-09 08:37:05,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-11-09 08:37:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 437 transitions. [2021-11-09 08:37:05,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-09 08:37:05,674 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:05,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:05,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 08:37:05,675 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:05,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:05,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1043865723, now seen corresponding path program 1 times [2021-11-09 08:37:05,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:05,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053298158] [2021-11-09 08:37:05,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:05,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:05,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:05,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053298158] [2021-11-09 08:37:05,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053298158] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:05,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:05,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:05,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951894397] [2021-11-09 08:37:05,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:05,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:05,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:05,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:05,756 INFO L87 Difference]: Start difference. First operand 280 states and 437 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-11-09 08:37:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:05,803 INFO L93 Difference]: Finished difference Result 563 states and 879 transitions. [2021-11-09 08:37:05,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:05,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 75 [2021-11-09 08:37:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:05,807 INFO L225 Difference]: With dead ends: 563 [2021-11-09 08:37:05,807 INFO L226 Difference]: Without dead ends: 332 [2021-11-09 08:37:05,811 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-11-09 08:37:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-09 08:37:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2021-11-09 08:37:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.5391849529780564) internal successors, (491), 319 states have internal predecessors, (491), 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-11-09 08:37:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 491 transitions. [2021-11-09 08:37:05,831 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 491 transitions. Word has length 75 [2021-11-09 08:37:05,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:05,832 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 491 transitions. [2021-11-09 08:37:05,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-11-09 08:37:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 491 transitions. [2021-11-09 08:37:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-09 08:37:05,834 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:05,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:05,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 08:37:05,835 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:05,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1477594809, now seen corresponding path program 1 times [2021-11-09 08:37:05,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:05,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262517933] [2021-11-09 08:37:05,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:05,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:05,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:05,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262517933] [2021-11-09 08:37:05,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262517933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:05,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:05,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:05,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879208979] [2021-11-09 08:37:05,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:05,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:05,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:05,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:05,898 INFO L87 Difference]: Start difference. First operand 320 states and 491 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-11-09 08:37:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:05,930 INFO L93 Difference]: Finished difference Result 567 states and 864 transitions. [2021-11-09 08:37:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:05,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 75 [2021-11-09 08:37:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:05,933 INFO L225 Difference]: With dead ends: 567 [2021-11-09 08:37:05,933 INFO L226 Difference]: Without dead ends: 284 [2021-11-09 08:37:05,934 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-11-09 08:37:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-09 08:37:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-11-09 08:37:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4946619217081851) internal successors, (420), 281 states have internal predecessors, (420), 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-11-09 08:37:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2021-11-09 08:37:05,955 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 75 [2021-11-09 08:37:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:05,957 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2021-11-09 08:37:05,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-11-09 08:37:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2021-11-09 08:37:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-09 08:37:05,959 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:05,959 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:37:05,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 08:37:05,960 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash 969577782, now seen corresponding path program 1 times [2021-11-09 08:37:05,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:05,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313117763] [2021-11-09 08:37:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:05,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:06,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:06,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313117763] [2021-11-09 08:37:06,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313117763] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:06,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:06,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 08:37:06,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524443860] [2021-11-09 08:37:06,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 08:37:06,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:06,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 08:37:06,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 08:37:06,037 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-11-09 08:37:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:06,108 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2021-11-09 08:37:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 08:37:06,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2021-11-09 08:37:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:06,114 INFO L225 Difference]: With dead ends: 811 [2021-11-09 08:37:06,114 INFO L226 Difference]: Without dead ends: 580 [2021-11-09 08:37:06,115 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 08:37:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-11-09 08:37:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2021-11-09 08:37:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.4764397905759161) internal successors, (846), 573 states have internal predecessors, (846), 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-11-09 08:37:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 846 transitions. [2021-11-09 08:37:06,160 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 846 transitions. Word has length 86 [2021-11-09 08:37:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:06,161 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 846 transitions. [2021-11-09 08:37:06,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-11-09 08:37:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 846 transitions. [2021-11-09 08:37:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-09 08:37:06,163 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:06,163 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:37:06,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 08:37:06,164 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:06,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash -272932917, now seen corresponding path program 1 times [2021-11-09 08:37:06,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:06,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074569823] [2021-11-09 08:37:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:06,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:06,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:06,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074569823] [2021-11-09 08:37:06,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074569823] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:06,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:06,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:37:06,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065425825] [2021-11-09 08:37:06,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:37:06,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:06,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:37:06,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:37:06,264 INFO L87 Difference]: Start difference. First operand 574 states and 846 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-11-09 08:37:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:06,349 INFO L93 Difference]: Finished difference Result 1097 states and 1620 transitions. [2021-11-09 08:37:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 08:37:06,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2021-11-09 08:37:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:06,356 INFO L225 Difference]: With dead ends: 1097 [2021-11-09 08:37:06,356 INFO L226 Difference]: Without dead ends: 574 [2021-11-09 08:37:06,357 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-09 08:37:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-11-09 08:37:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2021-11-09 08:37:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.469458987783595) internal successors, (842), 573 states have internal predecessors, (842), 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-11-09 08:37:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 842 transitions. [2021-11-09 08:37:06,401 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 842 transitions. Word has length 87 [2021-11-09 08:37:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:06,403 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 842 transitions. [2021-11-09 08:37:06,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-11-09 08:37:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 842 transitions. [2021-11-09 08:37:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-09 08:37:06,405 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:06,406 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:37:06,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 08:37:06,406 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:06,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:06,407 INFO L85 PathProgramCache]: Analyzing trace with hash 754091632, now seen corresponding path program 1 times [2021-11-09 08:37:06,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:06,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399928865] [2021-11-09 08:37:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:06,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:06,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:06,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399928865] [2021-11-09 08:37:06,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399928865] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:06,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:06,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:06,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101928759] [2021-11-09 08:37:06,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:06,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:06,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:06,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:06,454 INFO L87 Difference]: Start difference. First operand 574 states and 842 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-11-09 08:37:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:06,555 INFO L93 Difference]: Finished difference Result 1592 states and 2334 transitions. [2021-11-09 08:37:06,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:06,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2021-11-09 08:37:06,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:06,563 INFO L225 Difference]: With dead ends: 1592 [2021-11-09 08:37:06,563 INFO L226 Difference]: Without dead ends: 1069 [2021-11-09 08:37:06,565 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-11-09 08:37:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-11-09 08:37:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 586. [2021-11-09 08:37:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 1.4598290598290597) internal successors, (854), 585 states have internal predecessors, (854), 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-11-09 08:37:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 854 transitions. [2021-11-09 08:37:06,618 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 854 transitions. Word has length 88 [2021-11-09 08:37:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:06,619 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 854 transitions. [2021-11-09 08:37:06,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-11-09 08:37:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 854 transitions. [2021-11-09 08:37:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-09 08:37:06,621 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:06,621 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:37:06,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 08:37:06,622 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:06,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:06,622 INFO L85 PathProgramCache]: Analyzing trace with hash -715020230, now seen corresponding path program 1 times [2021-11-09 08:37:06,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:06,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817384293] [2021-11-09 08:37:06,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:06,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:06,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:06,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817384293] [2021-11-09 08:37:06,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817384293] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:06,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:06,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:37:06,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234853769] [2021-11-09 08:37:06,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:37:06,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:06,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:37:06,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:37:06,701 INFO L87 Difference]: Start difference. First operand 586 states and 854 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-11-09 08:37:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:06,786 INFO L93 Difference]: Finished difference Result 1105 states and 1604 transitions. [2021-11-09 08:37:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 08:37:06,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 89 [2021-11-09 08:37:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:06,790 INFO L225 Difference]: With dead ends: 1105 [2021-11-09 08:37:06,791 INFO L226 Difference]: Without dead ends: 570 [2021-11-09 08:37:06,793 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-09 08:37:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-11-09 08:37:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2021-11-09 08:37:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.437609841827768) internal successors, (818), 569 states have internal predecessors, (818), 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-11-09 08:37:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 818 transitions. [2021-11-09 08:37:06,846 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 818 transitions. Word has length 89 [2021-11-09 08:37:06,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:06,847 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 818 transitions. [2021-11-09 08:37:06,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-11-09 08:37:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 818 transitions. [2021-11-09 08:37:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-09 08:37:06,849 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:06,849 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:37:06,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 08:37:06,850 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:06,850 INFO L85 PathProgramCache]: Analyzing trace with hash -995630559, now seen corresponding path program 1 times [2021-11-09 08:37:06,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:06,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527223831] [2021-11-09 08:37:06,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:06,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:06,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:06,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527223831] [2021-11-09 08:37:06,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527223831] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:06,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:06,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:06,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079122488] [2021-11-09 08:37:06,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:06,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:06,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:06,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:06,898 INFO L87 Difference]: Start difference. First operand 570 states and 818 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-11-09 08:37:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:07,015 INFO L93 Difference]: Finished difference Result 1592 states and 2288 transitions. [2021-11-09 08:37:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 90 [2021-11-09 08:37:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:07,023 INFO L225 Difference]: With dead ends: 1592 [2021-11-09 08:37:07,023 INFO L226 Difference]: Without dead ends: 1073 [2021-11-09 08:37:07,026 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-11-09 08:37:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-11-09 08:37:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 578. [2021-11-09 08:37:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.4315424610051992) internal successors, (826), 577 states have internal predecessors, (826), 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-11-09 08:37:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 826 transitions. [2021-11-09 08:37:07,091 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 826 transitions. Word has length 90 [2021-11-09 08:37:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:07,092 INFO L470 AbstractCegarLoop]: Abstraction has 578 states and 826 transitions. [2021-11-09 08:37:07,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-11-09 08:37:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 826 transitions. [2021-11-09 08:37:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-09 08:37:07,094 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:07,094 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:37:07,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 08:37:07,094 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1893023837, now seen corresponding path program 1 times [2021-11-09 08:37:07,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:07,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126057671] [2021-11-09 08:37:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:07,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:07,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:07,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126057671] [2021-11-09 08:37:07,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126057671] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:07,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:07,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:07,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631221179] [2021-11-09 08:37:07,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:07,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:07,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:07,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:07,148 INFO L87 Difference]: Start difference. First operand 578 states and 826 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-11-09 08:37:07,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:07,230 INFO L93 Difference]: Finished difference Result 1311 states and 1876 transitions. [2021-11-09 08:37:07,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:07,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 90 [2021-11-09 08:37:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:07,236 INFO L225 Difference]: With dead ends: 1311 [2021-11-09 08:37:07,236 INFO L226 Difference]: Without dead ends: 784 [2021-11-09 08:37:07,238 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-11-09 08:37:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-11-09 08:37:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 706. [2021-11-09 08:37:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 1.449645390070922) internal successors, (1022), 705 states have internal predecessors, (1022), 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-11-09 08:37:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1022 transitions. [2021-11-09 08:37:07,335 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1022 transitions. Word has length 90 [2021-11-09 08:37:07,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:07,335 INFO L470 AbstractCegarLoop]: Abstraction has 706 states and 1022 transitions. [2021-11-09 08:37:07,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-11-09 08:37:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1022 transitions. [2021-11-09 08:37:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-09 08:37:07,338 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:07,338 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:37:07,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 08:37:07,338 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:07,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1064241767, now seen corresponding path program 1 times [2021-11-09 08:37:07,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:07,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458014156] [2021-11-09 08:37:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:07,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:07,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:07,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458014156] [2021-11-09 08:37:07,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458014156] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:37:07,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546610805] [2021-11-09 08:37:07,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:07,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:37:07,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:37:07,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 08:37:07,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-09 08:37:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:07,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-09 08:37:07,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:37:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-09 08:37:07,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546610805] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:07,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-09 08:37:07,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-11-09 08:37:07,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274846593] [2021-11-09 08:37:07,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:07,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:07,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:37:07,822 INFO L87 Difference]: Start difference. First operand 706 states and 1022 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-11-09 08:37:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:07,916 INFO L93 Difference]: Finished difference Result 1341 states and 1945 transitions. [2021-11-09 08:37:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 92 [2021-11-09 08:37:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:07,921 INFO L225 Difference]: With dead ends: 1341 [2021-11-09 08:37:07,922 INFO L226 Difference]: Without dead ends: 686 [2021-11-09 08:37:07,923 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:37:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-11-09 08:37:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2021-11-09 08:37:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 1.429197080291971) internal successors, (979), 685 states have internal predecessors, (979), 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-11-09 08:37:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 979 transitions. [2021-11-09 08:37:08,006 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 979 transitions. Word has length 92 [2021-11-09 08:37:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:08,006 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 979 transitions. [2021-11-09 08:37:08,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-11-09 08:37:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 979 transitions. [2021-11-09 08:37:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-09 08:37:08,008 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:08,009 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:08,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-09 08:37:08,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-09 08:37:08,226 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:08,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:08,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1841919225, now seen corresponding path program 1 times [2021-11-09 08:37:08,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:08,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840207230] [2021-11-09 08:37:08,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:08,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:08,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:08,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840207230] [2021-11-09 08:37:08,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840207230] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:37:08,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642869551] [2021-11-09 08:37:08,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:08,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:37:08,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:37:08,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 08:37:08,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-09 08:37:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:08,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-09 08:37:08,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:37:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-09 08:37:08,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642869551] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:08,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-09 08:37:08,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-11-09 08:37:08,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705307867] [2021-11-09 08:37:08,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:08,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:08,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:08,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:37:08,711 INFO L87 Difference]: Start difference. First operand 686 states and 979 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-11-09 08:37:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:08,844 INFO L93 Difference]: Finished difference Result 2025 states and 2894 transitions. [2021-11-09 08:37:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:08,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 93 [2021-11-09 08:37:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:08,853 INFO L225 Difference]: With dead ends: 2025 [2021-11-09 08:37:08,854 INFO L226 Difference]: Without dead ends: 1364 [2021-11-09 08:37:08,855 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:37:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2021-11-09 08:37:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1361. [2021-11-09 08:37:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1360 states have (on average 1.4125) internal successors, (1921), 1360 states have internal predecessors, (1921), 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-11-09 08:37:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1921 transitions. [2021-11-09 08:37:08,995 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1921 transitions. Word has length 93 [2021-11-09 08:37:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:08,996 INFO L470 AbstractCegarLoop]: Abstraction has 1361 states and 1921 transitions. [2021-11-09 08:37:08,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-11-09 08:37:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1921 transitions. [2021-11-09 08:37:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-09 08:37:08,999 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:08,999 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:09,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-09 08:37:09,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-09 08:37:09,223 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:09,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:09,223 INFO L85 PathProgramCache]: Analyzing trace with hash 155739387, now seen corresponding path program 1 times [2021-11-09 08:37:09,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:09,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029374809] [2021-11-09 08:37:09,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:09,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-09 08:37:09,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:09,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029374809] [2021-11-09 08:37:09,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029374809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:09,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:09,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:09,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884870662] [2021-11-09 08:37:09,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:09,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:09,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:09,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:09,258 INFO L87 Difference]: Start difference. First operand 1361 states and 1921 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-11-09 08:37:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:09,384 INFO L93 Difference]: Finished difference Result 2736 states and 3861 transitions. [2021-11-09 08:37:09,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:09,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 93 [2021-11-09 08:37:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:09,394 INFO L225 Difference]: With dead ends: 2736 [2021-11-09 08:37:09,394 INFO L226 Difference]: Without dead ends: 1463 [2021-11-09 08:37:09,396 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-11-09 08:37:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2021-11-09 08:37:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2021-11-09 08:37:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1462 states have (on average 1.4008207934336525) internal successors, (2048), 1462 states have internal predecessors, (2048), 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-11-09 08:37:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2048 transitions. [2021-11-09 08:37:09,524 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2048 transitions. Word has length 93 [2021-11-09 08:37:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:09,524 INFO L470 AbstractCegarLoop]: Abstraction has 1463 states and 2048 transitions. [2021-11-09 08:37:09,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-11-09 08:37:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2048 transitions. [2021-11-09 08:37:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-09 08:37:09,527 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:09,527 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:09,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-09 08:37:09,527 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:09,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:09,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1889843837, now seen corresponding path program 1 times [2021-11-09 08:37:09,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:09,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252579906] [2021-11-09 08:37:09,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:09,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-09 08:37:09,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:09,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252579906] [2021-11-09 08:37:09,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252579906] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:09,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:09,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:09,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269942348] [2021-11-09 08:37:09,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:09,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:09,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:09,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:09,563 INFO L87 Difference]: Start difference. First operand 1463 states and 2048 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-11-09 08:37:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:09,656 INFO L93 Difference]: Finished difference Result 2354 states and 3302 transitions. [2021-11-09 08:37:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:09,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 93 [2021-11-09 08:37:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:09,662 INFO L225 Difference]: With dead ends: 2354 [2021-11-09 08:37:09,663 INFO L226 Difference]: Without dead ends: 973 [2021-11-09 08:37:09,665 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-11-09 08:37:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-11-09 08:37:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2021-11-09 08:37:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 1.389917695473251) internal successors, (1351), 972 states have internal predecessors, (1351), 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-11-09 08:37:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1351 transitions. [2021-11-09 08:37:09,738 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1351 transitions. Word has length 93 [2021-11-09 08:37:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:09,738 INFO L470 AbstractCegarLoop]: Abstraction has 973 states and 1351 transitions. [2021-11-09 08:37:09,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-11-09 08:37:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1351 transitions. [2021-11-09 08:37:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-09 08:37:09,740 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:09,741 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:09,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-09 08:37:09,741 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:09,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:09,742 INFO L85 PathProgramCache]: Analyzing trace with hash 852035983, now seen corresponding path program 1 times [2021-11-09 08:37:09,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:09,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627061175] [2021-11-09 08:37:09,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:09,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-09 08:37:09,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:09,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627061175] [2021-11-09 08:37:09,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627061175] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:09,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:09,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 08:37:09,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115173870] [2021-11-09 08:37:09,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 08:37:09,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:09,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 08:37:09,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 08:37:09,789 INFO L87 Difference]: Start difference. First operand 973 states and 1351 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-11-09 08:37:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:09,855 INFO L93 Difference]: Finished difference Result 1258 states and 1743 transitions. [2021-11-09 08:37:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 08:37:09,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 94 [2021-11-09 08:37:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:09,858 INFO L225 Difference]: With dead ends: 1258 [2021-11-09 08:37:09,858 INFO L226 Difference]: Without dead ends: 373 [2021-11-09 08:37:09,859 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 08:37:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-11-09 08:37:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2021-11-09 08:37:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.3548387096774193) internal successors, (504), 372 states have internal predecessors, (504), 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-11-09 08:37:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2021-11-09 08:37:09,887 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 94 [2021-11-09 08:37:09,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:09,887 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2021-11-09 08:37:09,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-11-09 08:37:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2021-11-09 08:37:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-09 08:37:09,889 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:09,889 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:09,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-09 08:37:09,889 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:09,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:09,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1821155806, now seen corresponding path program 1 times [2021-11-09 08:37:09,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:09,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789840632] [2021-11-09 08:37:09,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:09,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:09,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:09,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789840632] [2021-11-09 08:37:09,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789840632] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:37:09,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147189872] [2021-11-09 08:37:09,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:09,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:37:09,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:37:09,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 08:37:09,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-09 08:37:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:10,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-09 08:37:10,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:37:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-09 08:37:10,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147189872] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:10,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-09 08:37:10,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-11-09 08:37:10,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879551252] [2021-11-09 08:37:10,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:10,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:10,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:10,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:37:10,373 INFO L87 Difference]: Start difference. First operand 373 states and 504 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-11-09 08:37:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:10,447 INFO L93 Difference]: Finished difference Result 1059 states and 1432 transitions. [2021-11-09 08:37:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 94 [2021-11-09 08:37:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:10,452 INFO L225 Difference]: With dead ends: 1059 [2021-11-09 08:37:10,453 INFO L226 Difference]: Without dead ends: 732 [2021-11-09 08:37:10,454 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:37:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-11-09 08:37:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 729. [2021-11-09 08:37:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 1.3365384615384615) internal successors, (973), 728 states have internal predecessors, (973), 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-11-09 08:37:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 973 transitions. [2021-11-09 08:37:10,511 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 973 transitions. Word has length 94 [2021-11-09 08:37:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:10,511 INFO L470 AbstractCegarLoop]: Abstraction has 729 states and 973 transitions. [2021-11-09 08:37:10,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-11-09 08:37:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 973 transitions. [2021-11-09 08:37:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-09 08:37:10,514 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:10,514 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:10,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-09 08:37:10,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:37:10,739 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:10,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:10,739 INFO L85 PathProgramCache]: Analyzing trace with hash 134975968, now seen corresponding path program 1 times [2021-11-09 08:37:10,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:10,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615589257] [2021-11-09 08:37:10,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:10,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-09 08:37:10,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:10,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615589257] [2021-11-09 08:37:10,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615589257] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:10,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:10,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:10,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674478933] [2021-11-09 08:37:10,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:10,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:10,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:10,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:10,779 INFO L87 Difference]: Start difference. First operand 729 states and 973 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-11-09 08:37:10,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:10,869 INFO L93 Difference]: Finished difference Result 1382 states and 1844 transitions. [2021-11-09 08:37:10,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:10,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 94 [2021-11-09 08:37:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:10,875 INFO L225 Difference]: With dead ends: 1382 [2021-11-09 08:37:10,875 INFO L226 Difference]: Without dead ends: 811 [2021-11-09 08:37:10,876 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-11-09 08:37:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-11-09 08:37:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2021-11-09 08:37:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.317283950617284) internal successors, (1067), 810 states have internal predecessors, (1067), 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-11-09 08:37:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1067 transitions. [2021-11-09 08:37:10,938 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1067 transitions. Word has length 94 [2021-11-09 08:37:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:10,939 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1067 transitions. [2021-11-09 08:37:10,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-11-09 08:37:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1067 transitions. [2021-11-09 08:37:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-09 08:37:10,941 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:10,942 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:10,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-09 08:37:10,942 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:10,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:10,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1869080418, now seen corresponding path program 1 times [2021-11-09 08:37:10,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:10,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018142559] [2021-11-09 08:37:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:10,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-09 08:37:10,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:10,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018142559] [2021-11-09 08:37:10,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018142559] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:10,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:10,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:37:10,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768718017] [2021-11-09 08:37:10,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:10,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:10,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:10,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:37:10,972 INFO L87 Difference]: Start difference. First operand 811 states and 1067 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-11-09 08:37:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:11,026 INFO L93 Difference]: Finished difference Result 1208 states and 1594 transitions. [2021-11-09 08:37:11,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:11,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 94 [2021-11-09 08:37:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:11,030 INFO L225 Difference]: With dead ends: 1208 [2021-11-09 08:37:11,030 INFO L226 Difference]: Without dead ends: 551 [2021-11-09 08:37:11,032 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-11-09 08:37:11,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-11-09 08:37:11,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2021-11-09 08:37:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.2945454545454544) internal successors, (712), 550 states have internal predecessors, (712), 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-11-09 08:37:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2021-11-09 08:37:11,071 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 94 [2021-11-09 08:37:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:11,071 INFO L470 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2021-11-09 08:37:11,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-11-09 08:37:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2021-11-09 08:37:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-09 08:37:11,074 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:11,074 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:11,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-09 08:37:11,074 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:11,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash 990151219, now seen corresponding path program 1 times [2021-11-09 08:37:11,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:11,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749089732] [2021-11-09 08:37:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:11,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-09 08:37:11,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:11,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749089732] [2021-11-09 08:37:11,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749089732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:11,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:11,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 08:37:11,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131468638] [2021-11-09 08:37:11,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 08:37:11,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:11,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 08:37:11,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 08:37:11,143 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-11-09 08:37:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:11,192 INFO L93 Difference]: Finished difference Result 820 states and 1062 transitions. [2021-11-09 08:37:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 08:37:11,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 95 [2021-11-09 08:37:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:11,196 INFO L225 Difference]: With dead ends: 820 [2021-11-09 08:37:11,196 INFO L226 Difference]: Without dead ends: 427 [2021-11-09 08:37:11,197 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 08:37:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-11-09 08:37:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2021-11-09 08:37:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.272300469483568) internal successors, (542), 426 states have internal predecessors, (542), 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-11-09 08:37:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 542 transitions. [2021-11-09 08:37:11,242 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 542 transitions. Word has length 95 [2021-11-09 08:37:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:11,242 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 542 transitions. [2021-11-09 08:37:11,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-11-09 08:37:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 542 transitions. [2021-11-09 08:37:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-09 08:37:11,245 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:11,245 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:11,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-09 08:37:11,246 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1943155422, now seen corresponding path program 1 times [2021-11-09 08:37:11,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:11,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760407865] [2021-11-09 08:37:11,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:11,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:11,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:11,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760407865] [2021-11-09 08:37:11,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760407865] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:37:11,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704454221] [2021-11-09 08:37:11,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:11,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:37:11,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:37:11,295 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 08:37:11,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-09 08:37:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:11,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-09 08:37:11,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:37:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-09 08:37:11,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704454221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:11,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-09 08:37:11,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-11-09 08:37:11,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286341321] [2021-11-09 08:37:11,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 08:37:11,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:11,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:37:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:37:11,733 INFO L87 Difference]: Start difference. First operand 427 states and 542 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-11-09 08:37:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:11,808 INFO L93 Difference]: Finished difference Result 1163 states and 1470 transitions. [2021-11-09 08:37:11,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:37:11,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 95 [2021-11-09 08:37:11,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:11,820 INFO L225 Difference]: With dead ends: 1163 [2021-11-09 08:37:11,820 INFO L226 Difference]: Without dead ends: 822 [2021-11-09 08:37:11,821 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:37:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-11-09 08:37:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 819. [2021-11-09 08:37:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.2506112469437654) internal successors, (1023), 818 states have internal predecessors, (1023), 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-11-09 08:37:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1023 transitions. [2021-11-09 08:37:11,886 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1023 transitions. Word has length 95 [2021-11-09 08:37:11,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:11,886 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1023 transitions. [2021-11-09 08:37:11,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-11-09 08:37:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1023 transitions. [2021-11-09 08:37:11,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-09 08:37:11,889 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:11,889 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:11,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-09 08:37:12,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-09 08:37:12,103 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2021-11-09 08:37:12,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:12,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266010616] [2021-11-09 08:37:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:12,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:12,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:12,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266010616] [2021-11-09 08:37:12,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266010616] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:37:12,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056778953] [2021-11-09 08:37:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:12,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:37:12,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:37:12,153 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 08:37:12,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-09 08:37:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:12,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-09 08:37:12,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:37:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:12,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056778953] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:12,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-09 08:37:12,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-09 08:37:12,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899499848] [2021-11-09 08:37:12,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 08:37:12,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:12,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 08:37:12,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:37:12,734 INFO L87 Difference]: Start difference. First operand 819 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-11-09 08:37:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:12,839 INFO L93 Difference]: Finished difference Result 1704 states and 2152 transitions. [2021-11-09 08:37:12,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 08:37:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 95 [2021-11-09 08:37:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:12,847 INFO L225 Difference]: With dead ends: 1704 [2021-11-09 08:37:12,847 INFO L226 Difference]: Without dead ends: 1054 [2021-11-09 08:37:12,849 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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-11-09 08:37:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-11-09 08:37:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1012. [2021-11-09 08:37:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.2542037586547972) internal successors, (1268), 1011 states have internal predecessors, (1268), 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-11-09 08:37:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1268 transitions. [2021-11-09 08:37:12,940 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1268 transitions. Word has length 95 [2021-11-09 08:37:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:12,941 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 1268 transitions. [2021-11-09 08:37:12,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-11-09 08:37:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1268 transitions. [2021-11-09 08:37:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-09 08:37:12,944 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:12,944 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:12,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-09 08:37:13,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-09 08:37:13,159 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:13,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:13,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2021-11-09 08:37:13,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:13,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660209000] [2021-11-09 08:37:13,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:13,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:13,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:13,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660209000] [2021-11-09 08:37:13,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660209000] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:13,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:13,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 08:37:13,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067776805] [2021-11-09 08:37:13,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 08:37:13,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:13,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 08:37:13,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 08:37:13,209 INFO L87 Difference]: Start difference. First operand 1012 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-11-09 08:37:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:13,375 INFO L93 Difference]: Finished difference Result 2540 states and 3200 transitions. [2021-11-09 08:37:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 08:37:13,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 95 [2021-11-09 08:37:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:13,386 INFO L225 Difference]: With dead ends: 2540 [2021-11-09 08:37:13,386 INFO L226 Difference]: Without dead ends: 1698 [2021-11-09 08:37:13,388 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 08:37:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2021-11-09 08:37:13,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1030. [2021-11-09 08:37:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.249757045675413) internal successors, (1286), 1029 states have internal predecessors, (1286), 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-11-09 08:37:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1286 transitions. [2021-11-09 08:37:13,486 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1286 transitions. Word has length 95 [2021-11-09 08:37:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:13,486 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1286 transitions. [2021-11-09 08:37:13,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-11-09 08:37:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1286 transitions. [2021-11-09 08:37:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-09 08:37:13,489 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 08:37:13,489 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 08:37:13,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-09 08:37:13,490 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 08:37:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:37:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2021-11-09 08:37:13,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:37:13,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868116265] [2021-11-09 08:37:13,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:37:13,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:37:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:37:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:37:13,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:37:13,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868116265] [2021-11-09 08:37:13,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868116265] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:37:13,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:37:13,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:37:13,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889468703] [2021-11-09 08:37:13,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:37:13,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:37:13,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:37:13,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:37:13,551 INFO L87 Difference]: Start difference. First operand 1030 states and 1286 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-11-09 08:37:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:37:13,619 INFO L93 Difference]: Finished difference Result 1285 states and 1598 transitions. [2021-11-09 08:37:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 08:37:13,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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 95 [2021-11-09 08:37:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 08:37:13,620 INFO L225 Difference]: With dead ends: 1285 [2021-11-09 08:37:13,620 INFO L226 Difference]: Without dead ends: 0 [2021-11-09 08:37:13,623 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-09 08:37:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-09 08:37:13,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-09 08:37:13,624 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-11-09 08:37:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-09 08:37:13,624 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-11-09 08:37:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 08:37:13,625 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-09 08:37:13,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-11-09 08:37:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-09 08:37:13,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-09 08:37:13,628 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 08:37:13,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-09 08:37:13,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-09 08:37:13,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:13,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:13,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:13,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:13,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:13,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:13,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:14,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 08:37:17,737 INFO L853 garLoopResultBuilder]: At program point L432-1(lines 350 454) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-11-09 08:37:17,737 INFO L857 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2021-11-09 08:37:17,737 INFO L857 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2021-11-09 08:37:17,737 INFO L857 garLoopResultBuilder]: For program point L268-1(lines 268 273) no Hoare annotation was computed. [2021-11-09 08:37:17,737 INFO L857 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2021-11-09 08:37:17,737 INFO L857 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2021-11-09 08:37:17,738 INFO L857 garLoopResultBuilder]: For program point L137-3(lines 137 142) no Hoare annotation was computed. [2021-11-09 08:37:17,738 INFO L857 garLoopResultBuilder]: For program point L137-5(lines 137 142) no Hoare annotation was computed. [2021-11-09 08:37:17,738 INFO L860 garLoopResultBuilder]: At program point L501(lines 501 507) the Hoare annotation is: true [2021-11-09 08:37:17,738 INFO L857 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2021-11-09 08:37:17,738 INFO L857 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2021-11-09 08:37:17,738 INFO L857 garLoopResultBuilder]: For program point L369-3(lines 353 381) no Hoare annotation was computed. [2021-11-09 08:37:17,738 INFO L857 garLoopResultBuilder]: For program point L336-3(lines 320 348) no Hoare annotation was computed. [2021-11-09 08:37:17,738 INFO L857 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2021-11-09 08:37:17,739 INFO L857 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2021-11-09 08:37:17,739 INFO L857 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2021-11-09 08:37:17,739 INFO L857 garLoopResultBuilder]: For program point L107-1(lines 107 127) no Hoare annotation was computed. [2021-11-09 08:37:17,739 INFO L853 garLoopResultBuilder]: At program point L240(lines 255 259) the Hoare annotation is: (let ((.cse8 (= ~b1_ev~0 0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse17 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~d0_ev~0 0)) (.cse7 (not (= ~d0_val~0 0))) (.cse9 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (not (= ~b0_req_up~0 1))) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-11-09 08:37:17,740 INFO L853 garLoopResultBuilder]: At program point L240-1(lines 208 250) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~d0_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-09 08:37:17,740 INFO L857 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2021-11-09 08:37:17,740 INFO L853 garLoopResultBuilder]: At program point L341-1(lines 317 349) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse15 (= ~b1_ev~0 1)) (.cse9 (not (= ~d1_val~0 0))) (.cse10 (= ~z_val~0 0)) (.cse11 (= ~d0_ev~0 1)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse16 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-09 08:37:17,741 INFO L853 garLoopResultBuilder]: At program point L275(lines 267 277) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (not (= ~d0_val~0 0))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse7 (<= 2 ~d0_ev~0)) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= 0 ~z_val_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-09 08:37:17,741 INFO L853 garLoopResultBuilder]: At program point L374-3(lines 350 382) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-11-09 08:37:17,741 INFO L853 garLoopResultBuilder]: At program point L341-3(lines 317 349) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) .cse10 .cse11 .cse12 .cse13))) [2021-11-09 08:37:17,742 INFO L853 garLoopResultBuilder]: At program point L275-1(lines 267 277) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-11-09 08:37:17,742 INFO L853 garLoopResultBuilder]: At program point L276(lines 264 278) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (not (= ~d0_val~0 0))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse7 (<= 2 ~d0_ev~0)) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 (= 0 ~z_val_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-09 08:37:17,744 INFO L853 garLoopResultBuilder]: At program point L276-1(lines 264 278) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-11-09 08:37:17,744 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2021-11-09 08:37:17,744 INFO L857 garLoopResultBuilder]: For program point L111-1(lines 111 126) no Hoare annotation was computed. [2021-11-09 08:37:17,745 INFO L857 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2021-11-09 08:37:17,745 INFO L860 garLoopResultBuilder]: At program point L509(lines 493 511) the Hoare annotation is: true [2021-11-09 08:37:17,745 INFO L853 garLoopResultBuilder]: At program point L311(lines 279 316) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-11-09 08:37:17,745 INFO L857 garLoopResultBuilder]: For program point L212(lines 212 218) no Hoare annotation was computed. [2021-11-09 08:37:17,745 INFO L853 garLoopResultBuilder]: At program point L212-1(lines 211 249) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (<= 2 ~d1_ev~0) (not (= ~b1_val_t~0 0)) (= ~d0_req_up~0 1) (<= 2 ~d0_ev~0) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (= ~d1_req_up~0 1) (not (= ~b0_req_up~0 1)) (= ~b0_ev~0 0) (= 1 ~b1_req_up~0)) [2021-11-09 08:37:17,746 INFO L857 garLoopResultBuilder]: For program point L212-2(lines 212 218) no Hoare annotation was computed. [2021-11-09 08:37:17,746 INFO L853 garLoopResultBuilder]: At program point L212-3(lines 211 249) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-11-09 08:37:17,746 INFO L857 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2021-11-09 08:37:17,746 INFO L857 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2021-11-09 08:37:17,746 INFO L857 garLoopResultBuilder]: For program point L115-1(lines 115 125) no Hoare annotation was computed. [2021-11-09 08:37:17,747 INFO L857 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2021-11-09 08:37:17,747 INFO L857 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2021-11-09 08:37:17,747 INFO L857 garLoopResultBuilder]: For program point L182-3(lines 182 187) no Hoare annotation was computed. [2021-11-09 08:37:17,747 INFO L857 garLoopResultBuilder]: For program point L182-5(lines 182 187) no Hoare annotation was computed. [2021-11-09 08:37:17,747 INFO L853 garLoopResultBuilder]: At program point L414(lines 403 416) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-11-09 08:37:17,748 INFO L853 garLoopResultBuilder]: At program point L415(lines 399 417) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-11-09 08:37:17,748 INFO L857 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2021-11-09 08:37:17,748 INFO L857 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2021-11-09 08:37:17,748 INFO L857 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2021-11-09 08:37:17,748 INFO L857 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2021-11-09 08:37:17,749 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-09 08:37:17,749 INFO L857 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2021-11-09 08:37:17,750 INFO L857 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2021-11-09 08:37:17,750 INFO L857 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2021-11-09 08:37:17,750 INFO L857 garLoopResultBuilder]: For program point L119-1(lines 119 124) no Hoare annotation was computed. [2021-11-09 08:37:17,750 INFO L857 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2021-11-09 08:37:17,750 INFO L857 garLoopResultBuilder]: For program point L152-3(lines 152 157) no Hoare annotation was computed. [2021-11-09 08:37:17,751 INFO L857 garLoopResultBuilder]: For program point L152-5(lines 152 157) no Hoare annotation was computed. [2021-11-09 08:37:17,751 INFO L853 garLoopResultBuilder]: At program point L219(lines 211 249) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (<= 2 ~d1_ev~0)) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (= ~d0_req_up~0 1)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (= ~z_val~0 0)) (.cse11 (not (= ~d0_val_t~0 0))) (.cse12 (not (= ~b1_val~0 0))) (.cse13 (= ~d1_req_up~0 1)) (.cse14 (not (= ~b0_req_up~0 1))) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~b1_ev~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~b1_ev~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-11-09 08:37:17,751 INFO L853 garLoopResultBuilder]: At program point L219-1(lines 211 249) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-11-09 08:37:17,751 INFO L857 garLoopResultBuilder]: For program point L286(line 286) no Hoare annotation was computed. [2021-11-09 08:37:17,752 INFO L857 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2021-11-09 08:37:17,752 INFO L857 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2021-11-09 08:37:17,752 INFO L857 garLoopResultBuilder]: For program point L321-2(lines 321 325) no Hoare annotation was computed. [2021-11-09 08:37:17,752 INFO L857 garLoopResultBuilder]: For program point L354-3(lines 353 381) no Hoare annotation was computed. [2021-11-09 08:37:17,752 INFO L853 garLoopResultBuilder]: At program point L255-1(lines 321 325) the Hoare annotation is: (let ((.cse6 (= ~b1_ev~0 0)) (.cse8 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse16 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse15 (= ~d0_ev~0 0)) (.cse5 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~d1_val~0 0))) (.cse10 (= ~z_val~0 0)) (.cse11 (not (= ~d0_val_t~0 0))) (.cse12 (not (= ~b1_val~0 0))) (.cse13 (not (= ~b0_req_up~0 1))) (.cse14 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse15 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-09 08:37:17,753 INFO L857 garLoopResultBuilder]: For program point L321-4(lines 320 348) no Hoare annotation was computed. [2021-11-09 08:37:17,753 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-09 08:37:17,753 INFO L857 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-11-09 08:37:17,753 INFO L857 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2021-11-09 08:37:17,753 INFO L853 garLoopResultBuilder]: At program point L455(lines 501 507) the Hoare annotation is: (and (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-11-09 08:37:17,754 INFO L857 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2021-11-09 08:37:17,754 INFO L857 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2021-11-09 08:37:17,754 INFO L857 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2021-11-09 08:37:17,754 INFO L853 garLoopResultBuilder]: At program point L390-2(lines 354 358) the Hoare annotation is: (let ((.cse10 (<= 2 ~d0_ev~0)) (.cse9 (= ~b1_ev~0 1)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse16 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (= ~z_val~0 0)) (.cse17 (= ~d0_ev~0 1)) (.cse13 (not (= ~d0_val_t~0 0))) (.cse14 (not (= ~b1_val~0 0))) (.cse15 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse17 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse17 .cse13 .cse14 .cse15))) [2021-11-09 08:37:17,755 INFO L857 garLoopResultBuilder]: For program point L390-3(lines 390 394) no Hoare annotation was computed. [2021-11-09 08:37:17,755 INFO L853 garLoopResultBuilder]: At program point L390-5(lines 354 358) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) (not (= ULTIMATE.start_activate_threads_~tmp~1 0)) .cse10 .cse11 .cse12 .cse13))) [2021-11-09 08:37:17,755 INFO L853 garLoopResultBuilder]: At program point L490(lines 461 492) the Hoare annotation is: (and (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (= ~d0_val_t~0 ~b0_val_t~0) (= ~z_ev~0 2) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (= ~d1_val_t~0 ~b0_val_t~0) (<= 2 ~d0_ev~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (= 1 ~b1_req_up~0) (= ~b1_val_t~0 ~b0_val_t~0)) [2021-11-09 08:37:17,755 INFO L853 garLoopResultBuilder]: At program point L226(lines 211 249) the Hoare annotation is: (let ((.cse10 (<= 2 ~d0_ev~0)) (.cse17 (= ~b1_ev~0 0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (<= 2 ~b1_ev~0)) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse18 (= ~d0_ev~0 0)) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (<= 2 ~d1_ev~0)) (.cse9 (not (= ~b1_val_t~0 0))) (.cse11 (= ~z_val~0 0)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (= ~d1_req_up~0 1)) (.cse15 (not (= ~b0_req_up~0 1))) (.cse16 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse18 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-11-09 08:37:17,756 INFO L853 garLoopResultBuilder]: At program point L226-1(lines 211 249) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~d0_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-09 08:37:17,756 INFO L857 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2021-11-09 08:37:17,756 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-09 08:37:17,756 INFO L857 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2021-11-09 08:37:17,756 INFO L857 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2021-11-09 08:37:17,757 INFO L857 garLoopResultBuilder]: For program point L359-3(lines 353 381) no Hoare annotation was computed. [2021-11-09 08:37:17,757 INFO L857 garLoopResultBuilder]: For program point L326-3(lines 320 348) no Hoare annotation was computed. [2021-11-09 08:37:17,757 INFO L857 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2021-11-09 08:37:17,758 INFO L853 garLoopResultBuilder]: At program point L129(lines 106 131) the Hoare annotation is: (let ((.cse9 (= ~b1_ev~0 1)) (.cse12 (= ~d0_ev~0 1)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse17 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0))) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse16 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse13 (not (= ~d0_val_t~0 0))) (.cse14 (not (= ~b1_val~0 0))) (.cse15 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse13 .cse14 .cse15))) [2021-11-09 08:37:17,758 INFO L853 garLoopResultBuilder]: At program point L129-1(lines 106 131) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0)) .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-09 08:37:17,758 INFO L853 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (not (= ~d0_val~0 0))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse7 (<= 2 ~d0_ev~0)) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= 0 ~z_val_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-09 08:37:17,759 INFO L853 garLoopResultBuilder]: At program point L130(lines 103 132) the Hoare annotation is: (let ((.cse17 (= ~b1_ev~0 1)) (.cse12 (= ~d0_ev~0 1)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0))) (.cse8 (not (= ~d0_val~0 0))) (.cse9 (not (= ~b1_val_t~0 0))) (.cse18 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse13 (not (= |ULTIMATE.start_is_method1_triggered_#res| 0))) (.cse14 (not (= ~d0_val_t~0 0))) (.cse15 (not (= ~b1_val~0 0))) (.cse16 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16))) [2021-11-09 08:37:17,759 INFO L853 garLoopResultBuilder]: At program point L130-1(lines 103 132) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0)) .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) (not (= |ULTIMATE.start_is_method1_triggered_#res| 0)) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-09 08:37:17,759 INFO L857 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2021-11-09 08:37:17,759 INFO L857 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2021-11-09 08:37:17,759 INFO L857 garLoopResultBuilder]: For program point L197-3(lines 197 202) no Hoare annotation was computed. [2021-11-09 08:37:17,760 INFO L857 garLoopResultBuilder]: For program point L197-5(lines 197 202) no Hoare annotation was computed. [2021-11-09 08:37:17,760 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-09 08:37:17,761 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-09 08:37:17,761 INFO L857 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2021-11-09 08:37:17,761 INFO L857 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2021-11-09 08:37:17,761 INFO L857 garLoopResultBuilder]: For program point L364-3(lines 353 381) no Hoare annotation was computed. [2021-11-09 08:37:17,761 INFO L857 garLoopResultBuilder]: For program point L331-3(lines 320 348) no Hoare annotation was computed. [2021-11-09 08:37:17,762 INFO L857 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2021-11-09 08:37:17,762 INFO L853 garLoopResultBuilder]: At program point L233(lines 211 249) the Hoare annotation is: (let ((.cse8 (= ~b1_ev~0 0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse17 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~d0_ev~0 0)) (.cse7 (not (= ~d0_val~0 0))) (.cse9 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (not (= ~b0_req_up~0 1))) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-11-09 08:37:17,762 INFO L853 garLoopResultBuilder]: At program point L233-1(lines 211 249) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~d0_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-09 08:37:17,762 INFO L857 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2021-11-09 08:37:17,763 INFO L857 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2021-11-09 08:37:17,763 INFO L857 garLoopResultBuilder]: For program point L167-3(lines 167 172) no Hoare annotation was computed. [2021-11-09 08:37:17,764 INFO L857 garLoopResultBuilder]: For program point L167-5(lines 167 172) no Hoare annotation was computed. [2021-11-09 08:37:17,767 INFO L731 BasicCegarLoop]: Path program 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] [2021-11-09 08:37:17,769 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 08:37:17,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:37:17 BoogieIcfgContainer [2021-11-09 08:37:17,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 08:37:17,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 08:37:17,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 08:37:17,854 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 08:37:17,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:37:03" (3/4) ... [2021-11-09 08:37:17,861 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-09 08:37:17,886 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-11-09 08:37:17,887 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-09 08:37:17,888 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-09 08:37:17,889 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-09 08:37:17,925 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-09 08:37:17,929 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && !(__retres1 == 0)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(\result == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) [2021-11-09 08:37:17,930 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) [2021-11-09 08:37:18,022 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 08:37:18,022 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 08:37:18,025 INFO L168 Benchmark]: Toolchain (without parser) took 15645.83 ms. Allocated memory was 100.7 MB in the beginning and 218.1 MB in the end (delta: 117.4 MB). Free memory was 67.5 MB in the beginning and 134.6 MB in the end (delta: -67.1 MB). Peak memory consumption was 49.3 MB. Max. memory is 16.1 GB. [2021-11-09 08:37:18,025 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 100.7 MB. Free memory is still 54.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 08:37:18,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.51 ms. Allocated memory is still 100.7 MB. Free memory was 67.3 MB in the beginning and 73.8 MB in the end (delta: -6.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-09 08:37:18,026 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.95 ms. Allocated memory is still 100.7 MB. Free memory was 73.8 MB in the beginning and 71.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 08:37:18,027 INFO L168 Benchmark]: Boogie Preprocessor took 71.91 ms. Allocated memory is still 100.7 MB. Free memory was 71.4 MB in the beginning and 69.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 08:37:18,027 INFO L168 Benchmark]: RCFGBuilder took 657.30 ms. Allocated memory is still 100.7 MB. Free memory was 69.4 MB in the beginning and 51.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-11-09 08:37:18,028 INFO L168 Benchmark]: TraceAbstraction took 14259.06 ms. Allocated memory was 100.7 MB in the beginning and 218.1 MB in the end (delta: 117.4 MB). Free memory was 50.9 MB in the beginning and 145.1 MB in the end (delta: -94.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 16.1 GB. [2021-11-09 08:37:18,028 INFO L168 Benchmark]: Witness Printer took 168.70 ms. Allocated memory is still 218.1 MB. Free memory was 145.1 MB in the beginning and 134.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-09 08:37:18,034 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.30 ms. Allocated memory is still 100.7 MB. Free memory is still 54.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 392.51 ms. Allocated memory is still 100.7 MB. Free memory was 67.3 MB in the beginning and 73.8 MB in the end (delta: -6.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 87.95 ms. Allocated memory is still 100.7 MB. Free memory was 73.8 MB in the beginning and 71.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.91 ms. Allocated memory is still 100.7 MB. Free memory was 71.4 MB in the beginning and 69.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 657.30 ms. Allocated memory is still 100.7 MB. Free memory was 69.4 MB in the beginning and 51.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14259.06 ms. Allocated memory was 100.7 MB in the beginning and 218.1 MB in the end (delta: 117.4 MB). Free memory was 50.9 MB in the beginning and 145.1 MB in the end (delta: -94.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 16.1 GB. * Witness Printer took 168.70 ms. Allocated memory is still 218.1 MB. Free memory was 145.1 MB in the beginning and 134.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 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: 19]: 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, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4786 SDtfs, 2809 SDslu, 5283 SDs, 0 SdLazy, 418 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1463occurred in iteration=19, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 2142 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 193 NumberOfFragments, 3769 HoareAnnotationTreeSize, 33 FomulaSimplifications, 63912 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 33 FomulaSimplificationsInter, 4734 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2890 NumberOfCodeBlocks, 2890 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2856 ConstructedInterpolants, 0 QuantifiedInterpolants, 5233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1744 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 114/144 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 1 specifications checked. All of them hold - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && !(__retres1 == 0)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(\result == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: (((((((0 == z_val_t && !(1 == b1_req_up)) && !(d0_val == 0)) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && !(__retres1 == 0)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && 2 <= d1_ev) && !(b1_val_t == 0)) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && 2 <= d1_ev) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && 2 <= d1_ev) && b1_ev == 0) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && 2 <= d1_ev) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: (((((((((((((((b0_req_up == 1 && 0 == z_val_t) && comp_m1_st == 0) && 2 <= b1_ev) && d0_val_t == b0_val_t) && z_ev == 2) && b0_val_t == 1) && 2 <= d1_ev) && d0_req_up == 1) && b0_val == 0) && d1_val_t == b0_val_t) && 2 <= d0_ev) && z_val == 0) && 2 <= b0_ev) && d1_req_up == 1) && 1 == b1_req_up) && b1_val_t == b0_val_t - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(tmp == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && 2 <= d1_ev) && b1_ev == 0) && !(b1_val_t == 0)) && d0_req_up == 1) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && 2 <= d1_ev) && !(b1_val_t == 0)) && d0_req_up == 1) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && 2 <= d1_ev) && !(b1_val_t == 0)) && d0_req_up == 1) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) && 1 == b1_req_up - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) RESULT: Ultimate proved your program to be correct! [2021-11-09 08:37:18,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e97821c9-c06a-4e60-9885-10a59a83fd26/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE