./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 06:33:45,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:33:45,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:33:45,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:33:45,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:33:45,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:33:45,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:33:45,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:33:45,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:33:45,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:33:45,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:33:45,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:33:45,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:33:45,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:33:45,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:33:45,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:33:45,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:33:45,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:33:45,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:33:45,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:33:45,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:33:45,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:33:45,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:33:45,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:33:45,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:33:45,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:33:45,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:33:45,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:33:45,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:33:45,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:33:45,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:33:45,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:33:45,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:33:45,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:33:45,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:33:45,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:33:45,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:33:45,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:33:45,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:33:45,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:33:45,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:33:45,873 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 06:33:45,887 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:33:45,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:33:45,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:33:45,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:33:45,888 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:33:45,888 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:33:45,888 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:33:45,888 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:33:45,888 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:33:45,888 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 06:33:45,893 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:33:45,893 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:33:45,893 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 06:33:45,893 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 06:33:45,894 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:33:45,894 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 06:33:45,894 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 06:33:45,894 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 06:33:45,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:33:45,895 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:33:45,895 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 06:33:45,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 06:33:45,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:33:45,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:33:45,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 06:33:45,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:33:45,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 06:33:45,897 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 06:33:45,897 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:33:45,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 06:33:45,897 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:33:45,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 06:33:45,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:33:45,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:33:45,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:33:45,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:33:45,898 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 06:33:45,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:33:45,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 06:33:45,899 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 06:33:45,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 06:33:45,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 06:33:45,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:33:45,899 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_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/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_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2022-12-14 06:33:46,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:33:46,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:33:46,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:33:46,114 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:33:46,115 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:33:46,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-12-14 06:33:48,678 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:33:48,863 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:33:48,864 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-12-14 06:33:48,872 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/data/5f9a84bfd/3036586f98f94a1a9693aa56c4980952/FLAGf9bf6e14f [2022-12-14 06:33:49,231 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/data/5f9a84bfd/3036586f98f94a1a9693aa56c4980952 [2022-12-14 06:33:49,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:33:49,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:33:49,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:33:49,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:33:49,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:33:49,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dcc467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49, skipping insertion in model container [2022-12-14 06:33:49,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:33:49,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:33:49,372 WARN L237 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_068d3857-b3ef-48b4-9200-92a01e13ebfd/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-12-14 06:33:49,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:33:49,430 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:33:49,441 WARN L237 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_068d3857-b3ef-48b4-9200-92a01e13ebfd/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-12-14 06:33:49,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:33:49,480 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:33:49,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49 WrapperNode [2022-12-14 06:33:49,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:33:49,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:33:49,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:33:49,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:33:49,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,518 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 231 [2022-12-14 06:33:49,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:33:49,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:33:49,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:33:49,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:33:49,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,541 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:33:49,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:33:49,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:33:49,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:33:49,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49" (1/1) ... [2022-12-14 06:33:49,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:33:49,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:33:49,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:33:49,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:33:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:33:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-14 06:33:49,608 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-14 06:33:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-14 06:33:49,608 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-14 06:33:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-14 06:33:49,609 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-14 06:33:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-14 06:33:49,609 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-14 06:33:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-14 06:33:49,609 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-14 06:33:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-14 06:33:49,609 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-14 06:33:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 06:33:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-14 06:33:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-14 06:33:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:33:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:33:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-14 06:33:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-14 06:33:49,674 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:33:49,676 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:33:49,938 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2022-12-14 06:33:49,938 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-12-14 06:33:49,952 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:33:50,022 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:33:50,022 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 06:33:50,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:33:50 BoogieIcfgContainer [2022-12-14 06:33:50,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:33:50,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:33:50,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:33:50,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:33:50,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:33:49" (1/3) ... [2022-12-14 06:33:50,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbefa79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:33:50, skipping insertion in model container [2022-12-14 06:33:50,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:33:49" (2/3) ... [2022-12-14 06:33:50,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbefa79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:33:50, skipping insertion in model container [2022-12-14 06:33:50,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:33:50" (3/3) ... [2022-12-14 06:33:50,031 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2022-12-14 06:33:50,045 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:33:50,046 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-14 06:33:50,089 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:33:50,096 INFO L357 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@548bd811, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:33:50,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-14 06:33:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 70 states have internal predecessors, (93), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 06:33:50,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 06:33:50,110 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:50,111 INFO L195 NwaCegarLoop]: 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] [2022-12-14 06:33:50,111 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:50,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:50,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1709637818, now seen corresponding path program 1 times [2022-12-14 06:33:50,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:50,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281224812] [2022-12-14 06:33:50,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:50,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:50,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:50,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281224812] [2022-12-14 06:33:50,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281224812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:50,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:50,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:33:50,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725546815] [2022-12-14 06:33:50,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:50,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:33:50,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:50,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:33:50,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:33:50,373 INFO L87 Difference]: Start difference. First operand has 92 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 70 states have internal predecessors, (93), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:33:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:50,571 INFO L93 Difference]: Finished difference Result 254 states and 349 transitions. [2022-12-14 06:33:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:33:50,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 41 [2022-12-14 06:33:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:50,579 INFO L225 Difference]: With dead ends: 254 [2022-12-14 06:33:50,580 INFO L226 Difference]: Without dead ends: 157 [2022-12-14 06:33:50,582 INFO L412 NwaCegarLoop]: 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 [2022-12-14 06:33:50,584 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 199 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:50,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 279 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:33:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-14 06:33:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2022-12-14 06:33:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 114 states have internal predecessors, (152), 24 states have call successors, (24), 14 states have call predecessors, (24), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-12-14 06:33:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 200 transitions. [2022-12-14 06:33:50,623 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 200 transitions. Word has length 41 [2022-12-14 06:33:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:50,623 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 200 transitions. [2022-12-14 06:33:50,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:33:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2022-12-14 06:33:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 06:33:50,625 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:50,625 INFO L195 NwaCegarLoop]: 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] [2022-12-14 06:33:50,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 06:33:50,625 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:50,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:50,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1840015740, now seen corresponding path program 1 times [2022-12-14 06:33:50,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:50,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64104126] [2022-12-14 06:33:50,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:50,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:50,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:50,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64104126] [2022-12-14 06:33:50,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64104126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:50,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:50,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:33:50,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258338682] [2022-12-14 06:33:50,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:50,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:33:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:33:50,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:33:50,698 INFO L87 Difference]: Start difference. First operand 152 states and 200 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-14 06:33:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:50,840 INFO L93 Difference]: Finished difference Result 431 states and 569 transitions. [2022-12-14 06:33:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:33:50,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 42 [2022-12-14 06:33:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:50,843 INFO L225 Difference]: With dead ends: 431 [2022-12-14 06:33:50,843 INFO L226 Difference]: Without dead ends: 284 [2022-12-14 06:33:50,844 INFO L412 NwaCegarLoop]: 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 [2022-12-14 06:33:50,845 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 193 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:50,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 280 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:33:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-12-14 06:33:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2022-12-14 06:33:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 200 states have (on average 1.36) internal successors, (272), 206 states have internal predecessors, (272), 44 states have call successors, (44), 28 states have call predecessors, (44), 28 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-12-14 06:33:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 360 transitions. [2022-12-14 06:33:50,882 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 360 transitions. Word has length 42 [2022-12-14 06:33:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:50,883 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 360 transitions. [2022-12-14 06:33:50,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-14 06:33:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 360 transitions. [2022-12-14 06:33:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 06:33:50,885 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:50,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:50,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 06:33:50,885 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:50,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1690418325, now seen corresponding path program 1 times [2022-12-14 06:33:50,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:50,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286079441] [2022-12-14 06:33:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:50,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 06:33:51,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:51,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286079441] [2022-12-14 06:33:51,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286079441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:51,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:51,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 06:33:51,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166546577] [2022-12-14 06:33:51,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:51,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:33:51,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:51,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:33:51,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:33:51,104 INFO L87 Difference]: Start difference. First operand 278 states and 360 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 06:33:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:51,434 INFO L93 Difference]: Finished difference Result 693 states and 891 transitions. [2022-12-14 06:33:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 06:33:51,435 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 54 [2022-12-14 06:33:51,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:51,438 INFO L225 Difference]: With dead ends: 693 [2022-12-14 06:33:51,438 INFO L226 Difference]: Without dead ends: 421 [2022-12-14 06:33:51,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-12-14 06:33:51,440 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 266 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:51,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 307 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:33:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-12-14 06:33:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 399. [2022-12-14 06:33:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 287 states have (on average 1.348432055749129) internal successors, (387), 293 states have internal predecessors, (387), 64 states have call successors, (64), 42 states have call predecessors, (64), 42 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-12-14 06:33:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 515 transitions. [2022-12-14 06:33:51,476 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 515 transitions. Word has length 54 [2022-12-14 06:33:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:51,476 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 515 transitions. [2022-12-14 06:33:51,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 06:33:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 515 transitions. [2022-12-14 06:33:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 06:33:51,478 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:51,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:51,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 06:33:51,478 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:51,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:51,478 INFO L85 PathProgramCache]: Analyzing trace with hash -287970387, now seen corresponding path program 1 times [2022-12-14 06:33:51,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:51,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580390977] [2022-12-14 06:33:51,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:51,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:33:51,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:51,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580390977] [2022-12-14 06:33:51,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580390977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:51,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:51,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:33:51,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856870974] [2022-12-14 06:33:51,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:51,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:33:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:51,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:33:51,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:33:51,529 INFO L87 Difference]: Start difference. First operand 399 states and 515 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 06:33:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:51,605 INFO L93 Difference]: Finished difference Result 737 states and 951 transitions. [2022-12-14 06:33:51,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:33:51,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2022-12-14 06:33:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:51,611 INFO L225 Difference]: With dead ends: 737 [2022-12-14 06:33:51,611 INFO L226 Difference]: Without dead ends: 527 [2022-12-14 06:33:51,612 INFO L412 NwaCegarLoop]: 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 [2022-12-14 06:33:51,614 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 58 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:51,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 242 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:33:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-12-14 06:33:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 437. [2022-12-14 06:33:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 319 states have (on average 1.3510971786833856) internal successors, (431), 325 states have internal predecessors, (431), 67 states have call successors, (67), 45 states have call predecessors, (67), 45 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-12-14 06:33:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 565 transitions. [2022-12-14 06:33:51,663 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 565 transitions. Word has length 56 [2022-12-14 06:33:51,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:51,664 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 565 transitions. [2022-12-14 06:33:51,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 06:33:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 565 transitions. [2022-12-14 06:33:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 06:33:51,667 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:51,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:51,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 06:33:51,668 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:51,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:51,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1519626549, now seen corresponding path program 1 times [2022-12-14 06:33:51,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:51,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778489356] [2022-12-14 06:33:51,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:51,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:33:51,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:51,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778489356] [2022-12-14 06:33:51,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778489356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:51,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:51,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 06:33:51,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592464051] [2022-12-14 06:33:51,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:51,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:33:51,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:51,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:33:51,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:33:51,829 INFO L87 Difference]: Start difference. First operand 437 states and 565 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 06:33:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:52,168 INFO L93 Difference]: Finished difference Result 1073 states and 1380 transitions. [2022-12-14 06:33:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 06:33:52,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 56 [2022-12-14 06:33:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:52,171 INFO L225 Difference]: With dead ends: 1073 [2022-12-14 06:33:52,171 INFO L226 Difference]: Without dead ends: 642 [2022-12-14 06:33:52,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-12-14 06:33:52,173 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 254 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:52,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 382 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:33:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-12-14 06:33:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 617. [2022-12-14 06:33:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 448 states have (on average 1.3415178571428572) internal successors, (601), 454 states have internal predecessors, (601), 97 states have call successors, (97), 66 states have call predecessors, (97), 66 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2022-12-14 06:33:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 795 transitions. [2022-12-14 06:33:52,220 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 795 transitions. Word has length 56 [2022-12-14 06:33:52,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:52,220 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 795 transitions. [2022-12-14 06:33:52,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 06:33:52,220 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 795 transitions. [2022-12-14 06:33:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 06:33:52,221 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:52,221 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:52,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 06:33:52,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash -209620956, now seen corresponding path program 1 times [2022-12-14 06:33:52,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:52,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38525894] [2022-12-14 06:33:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:52,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:33:52,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:52,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38525894] [2022-12-14 06:33:52,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38525894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:52,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:52,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:33:52,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597795618] [2022-12-14 06:33:52,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:52,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:33:52,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:52,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:33:52,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:33:52,273 INFO L87 Difference]: Start difference. First operand 617 states and 795 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 06:33:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:52,374 INFO L93 Difference]: Finished difference Result 1138 states and 1470 transitions. [2022-12-14 06:33:52,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:33:52,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2022-12-14 06:33:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:52,380 INFO L225 Difference]: With dead ends: 1138 [2022-12-14 06:33:52,380 INFO L226 Difference]: Without dead ends: 722 [2022-12-14 06:33:52,382 INFO L412 NwaCegarLoop]: 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 [2022-12-14 06:33:52,383 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 40 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:52,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 225 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:33:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-12-14 06:33:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 660. [2022-12-14 06:33:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 483 states have (on average 1.339544513457557) internal successors, (647), 489 states have internal predecessors, (647), 101 states have call successors, (101), 70 states have call predecessors, (101), 70 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2022-12-14 06:33:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 849 transitions. [2022-12-14 06:33:52,447 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 849 transitions. Word has length 57 [2022-12-14 06:33:52,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:52,448 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 849 transitions. [2022-12-14 06:33:52,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 06:33:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 849 transitions. [2022-12-14 06:33:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-14 06:33:52,449 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:52,449 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:52,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 06:33:52,449 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:52,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash -50695601, now seen corresponding path program 1 times [2022-12-14 06:33:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:52,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881275164] [2022-12-14 06:33:52,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:52,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 06:33:52,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:52,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881275164] [2022-12-14 06:33:52,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881275164] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:33:52,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987606659] [2022-12-14 06:33:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:52,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:33:52,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:33:52,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:33:52,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 06:33:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:52,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 06:33:52,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:33:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 06:33:52,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:33:52,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987606659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:52,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:33:52,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [11] total 12 [2022-12-14 06:33:52,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007044892] [2022-12-14 06:33:52,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:52,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:33:52,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:52,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:33:52,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-14 06:33:52,836 INFO L87 Difference]: Start difference. First operand 660 states and 849 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-14 06:33:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:52,903 INFO L93 Difference]: Finished difference Result 660 states and 849 transitions. [2022-12-14 06:33:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:33:52,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2022-12-14 06:33:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:52,907 INFO L225 Difference]: With dead ends: 660 [2022-12-14 06:33:52,908 INFO L226 Difference]: Without dead ends: 659 [2022-12-14 06:33:52,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-14 06:33:52,909 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:52,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 92 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:33:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-12-14 06:33:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2022-12-14 06:33:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 483 states have (on average 1.320910973084886) internal successors, (638), 488 states have internal predecessors, (638), 101 states have call successors, (101), 70 states have call predecessors, (101), 70 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2022-12-14 06:33:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 840 transitions. [2022-12-14 06:33:52,954 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 840 transitions. Word has length 74 [2022-12-14 06:33:52,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:52,954 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 840 transitions. [2022-12-14 06:33:52,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-14 06:33:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 840 transitions. [2022-12-14 06:33:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 06:33:52,956 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:52,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:52,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 06:33:53,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 06:33:53,157 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:53,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:53,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1571563300, now seen corresponding path program 1 times [2022-12-14 06:33:53,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:53,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514057529] [2022-12-14 06:33:53,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:53,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 06:33:53,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:53,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514057529] [2022-12-14 06:33:53,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514057529] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:33:53,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868367744] [2022-12-14 06:33:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:53,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:33:53,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:33:53,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:33:53,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 06:33:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:53,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 06:33:53,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:33:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 06:33:53,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:33:53,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868367744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:53,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:33:53,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [11] total 12 [2022-12-14 06:33:53,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68980913] [2022-12-14 06:33:53,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:53,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:33:53,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:53,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:33:53,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-14 06:33:53,548 INFO L87 Difference]: Start difference. First operand 659 states and 840 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-14 06:33:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:53,656 INFO L93 Difference]: Finished difference Result 1945 states and 2473 transitions. [2022-12-14 06:33:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:33:53,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 75 [2022-12-14 06:33:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:53,664 INFO L225 Difference]: With dead ends: 1945 [2022-12-14 06:33:53,664 INFO L226 Difference]: Without dead ends: 1292 [2022-12-14 06:33:53,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-14 06:33:53,666 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 57 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:53,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 205 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:33:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-12-14 06:33:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1288. [2022-12-14 06:33:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 946 states have (on average 1.299154334038055) internal successors, (1229), 950 states have internal predecessors, (1229), 198 states have call successors, (198), 140 states have call predecessors, (198), 140 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2022-12-14 06:33:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1625 transitions. [2022-12-14 06:33:53,776 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1625 transitions. Word has length 75 [2022-12-14 06:33:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:53,776 INFO L495 AbstractCegarLoop]: Abstraction has 1288 states and 1625 transitions. [2022-12-14 06:33:53,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-14 06:33:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1625 transitions. [2022-12-14 06:33:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 06:33:53,778 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:53,778 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:53,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 06:33:53,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:33:53,979 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:53,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1587002457, now seen corresponding path program 1 times [2022-12-14 06:33:53,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:53,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401652263] [2022-12-14 06:33:53,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 06:33:54,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:54,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401652263] [2022-12-14 06:33:54,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401652263] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:33:54,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504136958] [2022-12-14 06:33:54,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:54,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:33:54,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:33:54,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:33:54,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 06:33:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:54,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 06:33:54,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:33:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 06:33:54,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:33:54,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504136958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:54,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:33:54,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [13] total 14 [2022-12-14 06:33:54,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15329799] [2022-12-14 06:33:54,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:54,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:33:54,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:54,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:33:54,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:33:54,414 INFO L87 Difference]: Start difference. First operand 1288 states and 1625 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-14 06:33:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:54,606 INFO L93 Difference]: Finished difference Result 3443 states and 4382 transitions. [2022-12-14 06:33:54,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:33:54,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103 [2022-12-14 06:33:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:54,617 INFO L225 Difference]: With dead ends: 3443 [2022-12-14 06:33:54,617 INFO L226 Difference]: Without dead ends: 2543 [2022-12-14 06:33:54,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:33:54,620 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 57 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:54,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 190 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:33:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2022-12-14 06:33:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2539. [2022-12-14 06:33:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2539 states, 1872 states have (on average 1.295940170940171) internal successors, (2426), 1876 states have internal predecessors, (2426), 383 states have call successors, (383), 280 states have call predecessors, (383), 280 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2022-12-14 06:33:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 3192 transitions. [2022-12-14 06:33:54,787 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 3192 transitions. Word has length 103 [2022-12-14 06:33:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:54,788 INFO L495 AbstractCegarLoop]: Abstraction has 2539 states and 3192 transitions. [2022-12-14 06:33:54,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-14 06:33:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 3192 transitions. [2022-12-14 06:33:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-14 06:33:54,789 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:54,789 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:54,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 06:33:54,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:33:54,990 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash 477927440, now seen corresponding path program 1 times [2022-12-14 06:33:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:54,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921516659] [2022-12-14 06:33:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:54,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 06:33:55,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:55,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921516659] [2022-12-14 06:33:55,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921516659] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:33:55,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317530233] [2022-12-14 06:33:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:55,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:33:55,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:33:55,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:33:55,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 06:33:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:55,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 06:33:55,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:33:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-14 06:33:55,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:33:55,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317530233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:55,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:33:55,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [13] total 14 [2022-12-14 06:33:55,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639778087] [2022-12-14 06:33:55,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:55,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:33:55,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:55,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:33:55,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:33:55,403 INFO L87 Difference]: Start difference. First operand 2539 states and 3192 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-14 06:33:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:55,546 INFO L93 Difference]: Finished difference Result 2539 states and 3192 transitions. [2022-12-14 06:33:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:33:55,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2022-12-14 06:33:55,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:55,553 INFO L225 Difference]: With dead ends: 2539 [2022-12-14 06:33:55,553 INFO L226 Difference]: Without dead ends: 2538 [2022-12-14 06:33:55,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:33:55,555 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:55,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 91 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:33:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-12-14 06:33:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-12-14 06:33:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 1872 states have (on average 1.2873931623931625) internal successors, (2410), 1875 states have internal predecessors, (2410), 383 states have call successors, (383), 280 states have call predecessors, (383), 280 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2022-12-14 06:33:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3176 transitions. [2022-12-14 06:33:55,706 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3176 transitions. Word has length 104 [2022-12-14 06:33:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:55,707 INFO L495 AbstractCegarLoop]: Abstraction has 2538 states and 3176 transitions. [2022-12-14 06:33:55,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-14 06:33:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3176 transitions. [2022-12-14 06:33:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-14 06:33:55,708 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:55,708 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:55,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 06:33:55,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 06:33:55,909 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:55,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2071374855, now seen corresponding path program 1 times [2022-12-14 06:33:55,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:55,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932385828] [2022-12-14 06:33:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:55,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 06:33:55,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:55,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932385828] [2022-12-14 06:33:55,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932385828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:55,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:55,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:33:55,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465289368] [2022-12-14 06:33:55,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:55,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:33:55,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:55,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:33:55,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:33:55,972 INFO L87 Difference]: Start difference. First operand 2538 states and 3176 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-12-14 06:33:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:56,200 INFO L93 Difference]: Finished difference Result 4869 states and 6185 transitions. [2022-12-14 06:33:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:33:56,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 104 [2022-12-14 06:33:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:56,208 INFO L225 Difference]: With dead ends: 4869 [2022-12-14 06:33:56,209 INFO L226 Difference]: Without dead ends: 3096 [2022-12-14 06:33:56,212 INFO L412 NwaCegarLoop]: 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 [2022-12-14 06:33:56,212 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 106 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:56,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 198 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:33:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2022-12-14 06:33:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3096. [2022-12-14 06:33:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 2295 states have (on average 1.2762527233115468) internal successors, (2929), 2298 states have internal predecessors, (2929), 437 states have call successors, (437), 361 states have call predecessors, (437), 361 states have return successors, (437), 437 states have call predecessors, (437), 437 states have call successors, (437) [2022-12-14 06:33:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 3803 transitions. [2022-12-14 06:33:56,486 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 3803 transitions. Word has length 104 [2022-12-14 06:33:56,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:56,486 INFO L495 AbstractCegarLoop]: Abstraction has 3096 states and 3803 transitions. [2022-12-14 06:33:56,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-12-14 06:33:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 3803 transitions. [2022-12-14 06:33:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 06:33:56,488 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:56,488 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:56,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 06:33:56,489 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:56,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1930849036, now seen corresponding path program 1 times [2022-12-14 06:33:56,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:56,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343675044] [2022-12-14 06:33:56,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:56,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 06:33:56,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:56,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343675044] [2022-12-14 06:33:56,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343675044] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:33:56,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433324361] [2022-12-14 06:33:56,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:56,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:33:56,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:33:56,726 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:33:56,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 06:33:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:56,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 06:33:56,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:33:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-14 06:33:56,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:33:56,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433324361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:56,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:33:56,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [13] total 14 [2022-12-14 06:33:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260523219] [2022-12-14 06:33:56,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:56,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:33:56,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:56,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:33:56,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:33:56,898 INFO L87 Difference]: Start difference. First operand 3096 states and 3803 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-14 06:33:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:57,194 INFO L93 Difference]: Finished difference Result 5225 states and 6467 transitions. [2022-12-14 06:33:57,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:33:57,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2022-12-14 06:33:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:57,207 INFO L225 Difference]: With dead ends: 5225 [2022-12-14 06:33:57,207 INFO L226 Difference]: Without dead ends: 5224 [2022-12-14 06:33:57,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:33:57,209 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 41 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:57,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 185 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:33:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2022-12-14 06:33:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 5222. [2022-12-14 06:33:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5222 states, 3881 states have (on average 1.2854934295284721) internal successors, (4989), 3884 states have internal predecessors, (4989), 731 states have call successors, (731), 607 states have call predecessors, (731), 607 states have return successors, (731), 731 states have call predecessors, (731), 731 states have call successors, (731) [2022-12-14 06:33:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 6451 transitions. [2022-12-14 06:33:57,629 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 6451 transitions. Word has length 105 [2022-12-14 06:33:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:57,630 INFO L495 AbstractCegarLoop]: Abstraction has 5222 states and 6451 transitions. [2022-12-14 06:33:57,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-14 06:33:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 6451 transitions. [2022-12-14 06:33:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 06:33:57,631 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:57,631 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:57,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 06:33:57,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:33:57,832 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:57,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash 683547271, now seen corresponding path program 1 times [2022-12-14 06:33:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:57,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755293042] [2022-12-14 06:33:57,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 06:33:57,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:57,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755293042] [2022-12-14 06:33:57,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755293042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:57,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:57,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:33:57,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527311218] [2022-12-14 06:33:57,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:57,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:33:57,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:57,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:33:57,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:33:57,866 INFO L87 Difference]: Start difference. First operand 5222 states and 6451 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 4 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-12-14 06:33:58,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:58,459 INFO L93 Difference]: Finished difference Result 12248 states and 15471 transitions. [2022-12-14 06:33:58,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:33:58,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 4 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 105 [2022-12-14 06:33:58,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:58,495 INFO L225 Difference]: With dead ends: 12248 [2022-12-14 06:33:58,495 INFO L226 Difference]: Without dead ends: 8607 [2022-12-14 06:33:58,505 INFO L412 NwaCegarLoop]: 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 [2022-12-14 06:33:58,506 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 175 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:58,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 263 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:33:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8607 states. [2022-12-14 06:33:59,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8607 to 8492. [2022-12-14 06:33:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8492 states, 6243 states have (on average 1.2431523306102834) internal successors, (7761), 6246 states have internal predecessors, (7761), 1225 states have call successors, (1225), 1021 states have call predecessors, (1225), 1021 states have return successors, (1225), 1225 states have call predecessors, (1225), 1225 states have call successors, (1225) [2022-12-14 06:33:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8492 states to 8492 states and 10211 transitions. [2022-12-14 06:33:59,045 INFO L78 Accepts]: Start accepts. Automaton has 8492 states and 10211 transitions. Word has length 105 [2022-12-14 06:33:59,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:59,046 INFO L495 AbstractCegarLoop]: Abstraction has 8492 states and 10211 transitions. [2022-12-14 06:33:59,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 4 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-12-14 06:33:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 8492 states and 10211 transitions. [2022-12-14 06:33:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-14 06:33:59,047 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:59,047 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:59,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 06:33:59,047 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:33:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:59,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1763208267, now seen corresponding path program 1 times [2022-12-14 06:33:59,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:59,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712073493] [2022-12-14 06:33:59,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:59,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 06:33:59,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:59,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712073493] [2022-12-14 06:33:59,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712073493] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:33:59,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401062093] [2022-12-14 06:33:59,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:59,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:33:59,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:33:59,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:33:59,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 06:33:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:59,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 06:33:59,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:33:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 06:33:59,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:33:59,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401062093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:59,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:33:59,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [15] total 16 [2022-12-14 06:33:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859869239] [2022-12-14 06:33:59,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:59,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:33:59,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:33:59,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:33:59,465 INFO L87 Difference]: Start difference. First operand 8492 states and 10211 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-14 06:34:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:34:00,095 INFO L93 Difference]: Finished difference Result 8492 states and 10211 transitions. [2022-12-14 06:34:00,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:34:00,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 106 [2022-12-14 06:34:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:34:00,116 INFO L225 Difference]: With dead ends: 8492 [2022-12-14 06:34:00,116 INFO L226 Difference]: Without dead ends: 8491 [2022-12-14 06:34:00,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:34:00,119 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:34:00,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 90 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:34:00,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2022-12-14 06:34:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 8491. [2022-12-14 06:34:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8491 states, 6243 states have (on average 1.2386673073842704) internal successors, (7733), 6245 states have internal predecessors, (7733), 1225 states have call successors, (1225), 1021 states have call predecessors, (1225), 1021 states have return successors, (1225), 1225 states have call predecessors, (1225), 1225 states have call successors, (1225) [2022-12-14 06:34:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8491 states to 8491 states and 10183 transitions. [2022-12-14 06:34:00,665 INFO L78 Accepts]: Start accepts. Automaton has 8491 states and 10183 transitions. Word has length 106 [2022-12-14 06:34:00,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:34:00,666 INFO L495 AbstractCegarLoop]: Abstraction has 8491 states and 10183 transitions. [2022-12-14 06:34:00,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-14 06:34:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8491 states and 10183 transitions. [2022-12-14 06:34:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 06:34:00,668 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:34:00,669 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:34:00,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 06:34:00,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 06:34:00,871 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:34:00,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:34:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1175118337, now seen corresponding path program 1 times [2022-12-14 06:34:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:34:00,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904167774] [2022-12-14 06:34:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:00,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:34:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 06:34:01,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:34:01,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904167774] [2022-12-14 06:34:01,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904167774] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:01,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878271453] [2022-12-14 06:34:01,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:01,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:01,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:01,196 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:01,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 06:34:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:01,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 06:34:01,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 06:34:01,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:34:01,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878271453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:34:01,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:34:01,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [15] total 16 [2022-12-14 06:34:01,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683676707] [2022-12-14 06:34:01,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:34:01,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:34:01,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:34:01,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:34:01,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:34:01,376 INFO L87 Difference]: Start difference. First operand 8491 states and 10183 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-14 06:34:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:34:02,268 INFO L93 Difference]: Finished difference Result 15401 states and 18491 transitions. [2022-12-14 06:34:02,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:34:02,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 107 [2022-12-14 06:34:02,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:34:02,299 INFO L225 Difference]: With dead ends: 15401 [2022-12-14 06:34:02,299 INFO L226 Difference]: Without dead ends: 15400 [2022-12-14 06:34:02,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:34:02,304 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:34:02,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 182 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:34:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15400 states. [2022-12-14 06:34:03,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15400 to 15399. [2022-12-14 06:34:03,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15399 states, 11335 states have (on average 1.2383767093074547) internal successors, (14037), 11337 states have internal predecessors, (14037), 2213 states have call successors, (2213), 1849 states have call predecessors, (2213), 1849 states have return successors, (2213), 2213 states have call predecessors, (2213), 2213 states have call successors, (2213) [2022-12-14 06:34:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15399 states to 15399 states and 18463 transitions. [2022-12-14 06:34:03,120 INFO L78 Accepts]: Start accepts. Automaton has 15399 states and 18463 transitions. Word has length 107 [2022-12-14 06:34:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:34:03,120 INFO L495 AbstractCegarLoop]: Abstraction has 15399 states and 18463 transitions. [2022-12-14 06:34:03,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-14 06:34:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 15399 states and 18463 transitions. [2022-12-14 06:34:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 06:34:03,126 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:34:03,126 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:34:03,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 06:34:03,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 06:34:03,327 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:34:03,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:34:03,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2033652849, now seen corresponding path program 1 times [2022-12-14 06:34:03,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:34:03,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505090080] [2022-12-14 06:34:03,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:03,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:34:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 37 proven. 32 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-12-14 06:34:03,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:34:03,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505090080] [2022-12-14 06:34:03,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505090080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:03,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638502288] [2022-12-14 06:34:03,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:03,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:03,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:03,700 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:03,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 06:34:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:03,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 06:34:03,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-14 06:34:03,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:34:03,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638502288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:34:03,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:34:03,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-12-14 06:34:03,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130497060] [2022-12-14 06:34:03,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:34:03,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:34:03,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:34:03,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:34:03,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:34:03,865 INFO L87 Difference]: Start difference. First operand 15399 states and 18463 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-12-14 06:34:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:34:04,560 INFO L93 Difference]: Finished difference Result 21444 states and 25939 transitions. [2022-12-14 06:34:04,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:34:04,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 170 [2022-12-14 06:34:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:34:04,577 INFO L225 Difference]: With dead ends: 21444 [2022-12-14 06:34:04,577 INFO L226 Difference]: Without dead ends: 8790 [2022-12-14 06:34:04,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:34:04,591 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:34:04,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 80 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:34:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8790 states. [2022-12-14 06:34:05,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8790 to 8738. [2022-12-14 06:34:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8738 states, 6319 states have (on average 1.1873714195284064) internal successors, (7503), 6320 states have internal predecessors, (7503), 1319 states have call successors, (1319), 1099 states have call predecessors, (1319), 1099 states have return successors, (1319), 1319 states have call predecessors, (1319), 1319 states have call successors, (1319) [2022-12-14 06:34:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8738 states to 8738 states and 10141 transitions. [2022-12-14 06:34:05,095 INFO L78 Accepts]: Start accepts. Automaton has 8738 states and 10141 transitions. Word has length 170 [2022-12-14 06:34:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:34:05,096 INFO L495 AbstractCegarLoop]: Abstraction has 8738 states and 10141 transitions. [2022-12-14 06:34:05,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-12-14 06:34:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 8738 states and 10141 transitions. [2022-12-14 06:34:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-12-14 06:34:05,100 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:34:05,100 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:34:05,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 06:34:05,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 06:34:05,301 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:34:05,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:34:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1987400149, now seen corresponding path program 1 times [2022-12-14 06:34:05,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:34:05,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570916774] [2022-12-14 06:34:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:05,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:34:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 36 proven. 35 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-12-14 06:34:05,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:34:05,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570916774] [2022-12-14 06:34:05,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570916774] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:05,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982269166] [2022-12-14 06:34:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:05,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:05,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:05,573 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:05,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 06:34:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:05,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 06:34:05,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-14 06:34:05,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:34:05,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982269166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:34:05,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:34:05,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2022-12-14 06:34:05,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663581745] [2022-12-14 06:34:05,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:34:05,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:34:05,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:34:05,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:34:05,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:34:05,743 INFO L87 Difference]: Start difference. First operand 8738 states and 10141 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-14 06:34:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:34:06,403 INFO L93 Difference]: Finished difference Result 14675 states and 16993 transitions. [2022-12-14 06:34:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:34:06,404 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), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 174 [2022-12-14 06:34:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:34:06,432 INFO L225 Difference]: With dead ends: 14675 [2022-12-14 06:34:06,432 INFO L226 Difference]: Without dead ends: 10710 [2022-12-14 06:34:06,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:34:06,443 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 31 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:34:06,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 234 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:34:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10710 states. [2022-12-14 06:34:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10710 to 10662. [2022-12-14 06:34:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10662 states, 7703 states have (on average 1.1786317019343113) internal successors, (9079), 7704 states have internal predecessors, (9079), 1613 states have call successors, (1613), 1345 states have call predecessors, (1613), 1345 states have return successors, (1613), 1613 states have call predecessors, (1613), 1613 states have call successors, (1613) [2022-12-14 06:34:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10662 states to 10662 states and 12305 transitions. [2022-12-14 06:34:07,158 INFO L78 Accepts]: Start accepts. Automaton has 10662 states and 12305 transitions. Word has length 174 [2022-12-14 06:34:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:34:07,159 INFO L495 AbstractCegarLoop]: Abstraction has 10662 states and 12305 transitions. [2022-12-14 06:34:07,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-14 06:34:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 10662 states and 12305 transitions. [2022-12-14 06:34:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-12-14 06:34:07,172 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:34:07,172 INFO L195 NwaCegarLoop]: trace histogram [13, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:34:07,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 06:34:07,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 06:34:07,373 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:34:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:34:07,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2143494776, now seen corresponding path program 1 times [2022-12-14 06:34:07,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:34:07,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257807470] [2022-12-14 06:34:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:34:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 59 proven. 51 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-12-14 06:34:07,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:34:07,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257807470] [2022-12-14 06:34:07,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257807470] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:07,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705502099] [2022-12-14 06:34:07,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:07,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:07,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:07,861 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:07,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 06:34:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:07,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 06:34:08,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-12-14 06:34:08,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:34:08,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705502099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:34:08,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:34:08,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2022-12-14 06:34:08,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853652805] [2022-12-14 06:34:08,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:34:08,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:34:08,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:34:08,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:34:08,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:34:08,053 INFO L87 Difference]: Start difference. First operand 10662 states and 12305 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-12-14 06:34:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:34:08,744 INFO L93 Difference]: Finished difference Result 16635 states and 19429 transitions. [2022-12-14 06:34:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:34:08,745 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), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 236 [2022-12-14 06:34:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:34:08,764 INFO L225 Difference]: With dead ends: 16635 [2022-12-14 06:34:08,764 INFO L226 Difference]: Without dead ends: 8802 [2022-12-14 06:34:08,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:34:08,779 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:34:08,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 217 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:34:08,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8802 states. [2022-12-14 06:34:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8802 to 8738. [2022-12-14 06:34:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8738 states, 6319 states have (on average 1.166482038297199) internal successors, (7371), 6320 states have internal predecessors, (7371), 1319 states have call successors, (1319), 1099 states have call predecessors, (1319), 1099 states have return successors, (1319), 1319 states have call predecessors, (1319), 1319 states have call successors, (1319) [2022-12-14 06:34:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8738 states to 8738 states and 10009 transitions. [2022-12-14 06:34:09,504 INFO L78 Accepts]: Start accepts. Automaton has 8738 states and 10009 transitions. Word has length 236 [2022-12-14 06:34:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:34:09,504 INFO L495 AbstractCegarLoop]: Abstraction has 8738 states and 10009 transitions. [2022-12-14 06:34:09,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-12-14 06:34:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8738 states and 10009 transitions. [2022-12-14 06:34:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-12-14 06:34:09,520 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:34:09,520 INFO L195 NwaCegarLoop]: trace histogram [13, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:34:09,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 06:34:09,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 06:34:09,721 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:34:09,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:34:09,722 INFO L85 PathProgramCache]: Analyzing trace with hash 244964471, now seen corresponding path program 1 times [2022-12-14 06:34:09,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:34:09,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833719942] [2022-12-14 06:34:09,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:34:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 59 proven. 51 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-12-14 06:34:10,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:34:10,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833719942] [2022-12-14 06:34:10,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833719942] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:10,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257478249] [2022-12-14 06:34:10,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:10,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:10,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:10,191 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:10,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 06:34:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:10,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 06:34:10,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:10,529 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 278 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-12-14 06:34:10,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:34:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2022-12-14 06:34:10,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257478249] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:34:10,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1482741177] [2022-12-14 06:34:10,739 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2022-12-14 06:34:10,740 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:34:10,743 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:34:10,749 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:34:10,750 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:34:22,547 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 116 for LOIs [2022-12-14 06:34:22,618 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 120 for LOIs [2022-12-14 06:34:22,751 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 143 for LOIs [2022-12-14 06:34:22,869 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 65 for LOIs [2022-12-14 06:34:22,885 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 128 for LOIs [2022-12-14 06:34:23,197 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 83 for LOIs [2022-12-14 06:34:23,257 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 34 for LOIs [2022-12-14 06:34:23,263 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:34:31,677 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '275925#(and (<= ~q_buf_0~0 2147483647) (= ~p_last_write~0 ~q_buf_0~0) (< 2147483646 ~p_num_write~0) (<= 0 (+ ~q_buf_0~0 2147483648)) (or (and (not (= |ULTIMATE.start_eval_~tmp~2#1| 0)) (= ~c_num_read~0 0) (<= 0 |ULTIMATE.start_stop_simulation_~__retres2~0#1|) (= |ULTIMATE.start_start_simulation_~tmp___0~3#1| 0) (<= |ULTIMATE.start_stop_simulation_~__retres2~0#1| 0) (<= |ULTIMATE.start_eval_~tmp~2#1| 2147483647) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_stop_simulation_~tmp~3#1| 1) (<= 0 |ULTIMATE.start_stop_simulation_#res#1|) (<= |ULTIMATE.start_stop_simulation_#res#1| 0) (= 2 ~p_dw_pc~0) (= ~slow_clk_edge~0 2) (<= 0 |ULTIMATE.start_stop_simulation_~tmp~3#1|) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= ~t~0 0) (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (= ~p_dw_st~0 1) (<= ~q_free~0 1) (<= |ULTIMATE.start_start_simulation_~tmp~4#1| 1) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) (= 2 ~fast_clk_edge~0) (= ~a_t~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_start_simulation_~tmp~4#1|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_eval_~tmp~2#1| 2147483648))) (and (not (= |ULTIMATE.start_eval_~tmp~2#1| 0)) (= ~c_num_read~0 0) (<= 0 |ULTIMATE.start_stop_simulation_~__retres2~0#1|) (= |ULTIMATE.start_start_simulation_~tmp___0~3#1| 0) (<= |ULTIMATE.start_stop_simulation_~__retres2~0#1| 0) (<= |ULTIMATE.start_eval_~tmp~2#1| 2147483647) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_stop_simulation_~tmp~3#1| 1) (<= 0 |ULTIMATE.start_stop_simulation_#res#1|) (<= |ULTIMATE.start_stop_simulation_#res#1| 0) (= ~slow_clk_edge~0 2) (not (= ~q_free~0 0)) (<= 0 |ULTIMATE.start_stop_simulation_~tmp~3#1|) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= ~t~0 0) (= ~p_dw_pc~0 1) (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (= ~p_dw_st~0 1) (<= ~q_free~0 1) (<= |ULTIMATE.start_start_simulation_~tmp~4#1| 1) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) (= 2 ~fast_clk_edge~0) (= ~a_t~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_start_simulation_~tmp~4#1|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_eval_~tmp~2#1| 2147483648)))))' at error location [2022-12-14 06:34:31,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 06:34:31,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:34:31,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 2, 3] total 19 [2022-12-14 06:34:31,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606508865] [2022-12-14 06:34:31,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:34:31,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 06:34:31,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:34:31,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 06:34:31,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=4541, Unknown=0, NotChecked=0, Total=4970 [2022-12-14 06:34:31,681 INFO L87 Difference]: Start difference. First operand 8738 states and 10009 transitions. Second operand has 19 states, 16 states have (on average 13.625) internal successors, (218), 16 states have internal predecessors, (218), 10 states have call successors, (57), 4 states have call predecessors, (57), 7 states have return successors, (57), 12 states have call predecessors, (57), 10 states have call successors, (57) [2022-12-14 06:34:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:34:36,169 INFO L93 Difference]: Finished difference Result 17655 states and 20795 transitions. [2022-12-14 06:34:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2022-12-14 06:34:36,169 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 13.625) internal successors, (218), 16 states have internal predecessors, (218), 10 states have call successors, (57), 4 states have call predecessors, (57), 7 states have return successors, (57), 12 states have call predecessors, (57), 10 states have call successors, (57) Word has length 236 [2022-12-14 06:34:36,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:34:36,183 INFO L225 Difference]: With dead ends: 17655 [2022-12-14 06:34:36,183 INFO L226 Difference]: Without dead ends: 8923 [2022-12-14 06:34:36,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 684 SyntacticMatches, 15 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25338 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=4031, Invalid=53809, Unknown=0, NotChecked=0, Total=57840 [2022-12-14 06:34:36,199 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 1523 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 06:34:36,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 1282 Invalid, 2417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 06:34:36,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8923 states. [2022-12-14 06:34:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8923 to 6488. [2022-12-14 06:34:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6488 states, 5031 states have (on average 1.1713377062214272) internal successors, (5893), 5031 states have internal predecessors, (5893), 768 states have call successors, (768), 688 states have call predecessors, (768), 688 states have return successors, (768), 768 states have call predecessors, (768), 768 states have call successors, (768) [2022-12-14 06:34:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6488 states to 6488 states and 7429 transitions. [2022-12-14 06:34:36,682 INFO L78 Accepts]: Start accepts. Automaton has 6488 states and 7429 transitions. Word has length 236 [2022-12-14 06:34:36,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:34:36,683 INFO L495 AbstractCegarLoop]: Abstraction has 6488 states and 7429 transitions. [2022-12-14 06:34:36,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 13.625) internal successors, (218), 16 states have internal predecessors, (218), 10 states have call successors, (57), 4 states have call predecessors, (57), 7 states have return successors, (57), 12 states have call predecessors, (57), 10 states have call successors, (57) [2022-12-14 06:34:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 6488 states and 7429 transitions. [2022-12-14 06:34:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2022-12-14 06:34:36,691 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:34:36,691 INFO L195 NwaCegarLoop]: trace histogram [37, 19, 19, 19, 19, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:34:36,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 06:34:36,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:36,893 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:34:36,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:34:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash -560309545, now seen corresponding path program 1 times [2022-12-14 06:34:36,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:34:36,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495091927] [2022-12-14 06:34:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:34:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3894 backedges. 242 proven. 48 refuted. 0 times theorem prover too weak. 3604 trivial. 0 not checked. [2022-12-14 06:34:37,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:34:37,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495091927] [2022-12-14 06:34:37,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495091927] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:37,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878808041] [2022-12-14 06:34:37,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:37,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:37,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:37,058 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:37,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 06:34:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:37,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 1883 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 06:34:37,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3894 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 3176 trivial. 0 not checked. [2022-12-14 06:34:37,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:34:37,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878808041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:34:37,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:34:37,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-14 06:34:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080374135] [2022-12-14 06:34:37,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:34:37,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:34:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:34:37,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:34:37,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:34:37,313 INFO L87 Difference]: Start difference. First operand 6488 states and 7429 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-12-14 06:34:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:34:37,814 INFO L93 Difference]: Finished difference Result 12893 states and 14906 transitions. [2022-12-14 06:34:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:34:37,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 617 [2022-12-14 06:34:37,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:34:37,824 INFO L225 Difference]: With dead ends: 12893 [2022-12-14 06:34:37,824 INFO L226 Difference]: Without dead ends: 6488 [2022-12-14 06:34:37,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:34:37,832 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 61 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:34:37,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 149 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:34:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6488 states. [2022-12-14 06:34:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6488 to 6488. [2022-12-14 06:34:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6488 states, 5031 states have (on average 1.1574239713774597) internal successors, (5823), 5031 states have internal predecessors, (5823), 768 states have call successors, (768), 688 states have call predecessors, (768), 688 states have return successors, (768), 768 states have call predecessors, (768), 768 states have call successors, (768) [2022-12-14 06:34:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6488 states to 6488 states and 7359 transitions. [2022-12-14 06:34:38,408 INFO L78 Accepts]: Start accepts. Automaton has 6488 states and 7359 transitions. Word has length 617 [2022-12-14 06:34:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:34:38,408 INFO L495 AbstractCegarLoop]: Abstraction has 6488 states and 7359 transitions. [2022-12-14 06:34:38,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-12-14 06:34:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 6488 states and 7359 transitions. [2022-12-14 06:34:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2022-12-14 06:34:38,415 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:34:38,416 INFO L195 NwaCegarLoop]: trace histogram [37, 19, 19, 19, 19, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:34:38,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-14 06:34:38,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:38,617 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:34:38,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:34:38,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1358612246, now seen corresponding path program 1 times [2022-12-14 06:34:38,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:34:38,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542199365] [2022-12-14 06:34:38,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:38,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:34:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3930 backedges. 272 proven. 252 refuted. 0 times theorem prover too weak. 3406 trivial. 0 not checked. [2022-12-14 06:34:40,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:34:40,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542199365] [2022-12-14 06:34:40,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542199365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:40,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449943280] [2022-12-14 06:34:40,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:40,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:40,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:40,632 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:40,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 06:34:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:40,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 1901 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 06:34:40,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3930 backedges. 0 proven. 3374 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-12-14 06:34:41,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:34:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3930 backedges. 0 proven. 1304 refuted. 0 times theorem prover too weak. 2626 trivial. 0 not checked. [2022-12-14 06:34:41,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449943280] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:34:41,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2082598850] [2022-12-14 06:34:41,805 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2022-12-14 06:34:41,805 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:34:41,805 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:34:41,805 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:34:41,805 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:34:55,275 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 117 for LOIs [2022-12-14 06:34:55,387 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 121 for LOIs [2022-12-14 06:34:55,493 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 144 for LOIs [2022-12-14 06:34:55,607 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 60 for LOIs [2022-12-14 06:34:55,616 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 129 for LOIs [2022-12-14 06:34:56,058 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 85 for LOIs [2022-12-14 06:34:56,158 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 33 for LOIs [2022-12-14 06:34:56,221 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:35:11,227 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '343668#(and (<= ~q_buf_0~0 2147483647) (= ~p_last_write~0 ~q_buf_0~0) (< 2147483646 ~p_num_write~0) (<= 0 (+ ~q_buf_0~0 2147483648)) (or (and (<= 1 ~p_dw_i~0) (<= 0 ~t~0) (<= 1 |ULTIMATE.start_start_simulation_~kernel_st~0#1|) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= 1 ~c_dr_i~0) (<= 0 |ULTIMATE.start_stop_simulation_~__retres2~0#1|) (<= 0 ~c_dr_pc~0) (<= ~c_num_read~0 0) (<= ~c_last_read~0 0) (<= ~c_dr_i~0 1) (<= 1 ~p_dw_st~0) (<= |ULTIMATE.start_stop_simulation_~__retres2~0#1| 0) (<= |ULTIMATE.start_eval_~tmp~2#1| 2147483647) (<= |ULTIMATE.start_start_simulation_~tmp___0~3#1| 0) (<= 0 |ULTIMATE.start_start_simulation_~tmp___0~3#1|) (<= ~c_dr_pc~0 1) (<= |ULTIMATE.start_stop_simulation_~tmp~3#1| 1) (<= 0 |ULTIMATE.start_stop_simulation_#res#1|) (<= |ULTIMATE.start_stop_simulation_#res#1| 0) (<= |#NULL.offset| 0) (<= ~p_dw_i~0 1) (<= ~fast_clk_edge~0 2) (<= 0 |ULTIMATE.start_stop_simulation_~tmp~3#1|) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (<= ~q_free~0 1) (<= |ULTIMATE.start_start_simulation_~tmp~4#1| 1) (<= 2 ~p_dw_pc~0) (<= ~t~0 0) (<= 2 ~slow_clk_edge~0) (<= |#NULL.base| 0) (<= 2 ~fast_clk_edge~0) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) (<= ~p_dw_pc~0 2) (<= ~p_dw_st~0 1) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_start_simulation_~tmp~4#1|) (<= 0 ~c_num_read~0) (<= ~slow_clk_edge~0 2) (<= 0 ~c_last_read~0) (<= 0 (+ |ULTIMATE.start_eval_~tmp~2#1| 2147483648))) (and (<= 1 ~p_dw_i~0) (<= 0 ~t~0) (<= 1 |ULTIMATE.start_start_simulation_~kernel_st~0#1|) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= 1 ~c_dr_i~0) (<= ~p_dw_pc~0 1) (<= 0 |ULTIMATE.start_stop_simulation_~__retres2~0#1|) (<= 0 ~c_dr_pc~0) (<= ~c_num_read~0 0) (<= ~c_last_read~0 0) (<= ~c_dr_i~0 1) (<= 1 ~p_dw_st~0) (<= |ULTIMATE.start_stop_simulation_~__retres2~0#1| 0) (<= |ULTIMATE.start_eval_~tmp~2#1| 2147483647) (<= |ULTIMATE.start_start_simulation_~tmp___0~3#1| 0) (<= 0 |ULTIMATE.start_start_simulation_~tmp___0~3#1|) (<= ~c_dr_pc~0 1) (<= |ULTIMATE.start_stop_simulation_~tmp~3#1| 1) (<= 0 |ULTIMATE.start_stop_simulation_#res#1|) (<= |ULTIMATE.start_stop_simulation_#res#1| 0) (<= 1 ~p_dw_pc~0) (<= |#NULL.offset| 0) (<= ~p_dw_i~0 1) (<= ~fast_clk_edge~0 2) (<= 0 |ULTIMATE.start_stop_simulation_~tmp~3#1|) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (<= ~q_free~0 1) (<= |ULTIMATE.start_start_simulation_~tmp~4#1| 1) (<= ~t~0 0) (<= 2 ~slow_clk_edge~0) (<= |#NULL.base| 0) (<= 2 ~fast_clk_edge~0) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) (<= ~p_dw_st~0 1) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_start_simulation_~tmp~4#1|) (<= 0 ~c_num_read~0) (<= ~slow_clk_edge~0 2) (<= 0 ~c_last_read~0) (<= 0 (+ |ULTIMATE.start_eval_~tmp~2#1| 2147483648)))) (or (and (not (= |ULTIMATE.start_eval_~tmp~2#1| 0)) (not (= ~q_free~0 0)) (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (and (not (= |ULTIMATE.start_eval_~tmp~2#1| 0)) (= 2 ~p_dw_pc~0) (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)))))' at error location [2022-12-14 06:35:11,227 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 06:35:11,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:35:11,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 5, 6] total 34 [2022-12-14 06:35:11,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256829820] [2022-12-14 06:35:11,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:35:11,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 06:35:11,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:35:11,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 06:35:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=7258, Unknown=0, NotChecked=0, Total=7832 [2022-12-14 06:35:11,233 INFO L87 Difference]: Start difference. First operand 6488 states and 7359 transitions. Second operand has 34 states, 30 states have (on average 15.033333333333333) internal successors, (451), 28 states have internal predecessors, (451), 18 states have call successors, (112), 8 states have call predecessors, (112), 12 states have return successors, (112), 22 states have call predecessors, (112), 18 states have call successors, (112) [2022-12-14 06:35:53,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:35:53,606 INFO L93 Difference]: Finished difference Result 48400 states and 58593 transitions. [2022-12-14 06:35:53,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 979 states. [2022-12-14 06:35:53,607 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 15.033333333333333) internal successors, (451), 28 states have internal predecessors, (451), 18 states have call successors, (112), 8 states have call predecessors, (112), 12 states have return successors, (112), 22 states have call predecessors, (112), 18 states have call successors, (112) Word has length 626 [2022-12-14 06:35:53,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:35:53,691 INFO L225 Difference]: With dead ends: 48400 [2022-12-14 06:35:53,691 INFO L226 Difference]: Without dead ends: 41995 [2022-12-14 06:35:53,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3071 GetRequests, 1946 SyntacticMatches, 62 SemanticMatches, 1063 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571120 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=66316, Invalid=1066844, Unknown=0, NotChecked=0, Total=1133160 [2022-12-14 06:35:53,790 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 11924 mSDsluCounter, 3736 mSDsCounter, 0 mSdLazyCounter, 24403 mSolverCounterSat, 8502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11931 SdHoareTripleChecker+Valid, 4052 SdHoareTripleChecker+Invalid, 32905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8502 IncrementalHoareTripleChecker+Valid, 24403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:35:53,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11931 Valid, 4052 Invalid, 32905 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8502 Valid, 24403 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2022-12-14 06:35:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41995 states. [2022-12-14 06:35:55,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41995 to 18871. [2022-12-14 06:35:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18871 states, 13662 states have (on average 1.1289708681013029) internal successors, (15424), 14006 states have internal predecessors, (15424), 2561 states have call successors, (2561), 2193 states have call predecessors, (2561), 2647 states have return successors, (3209), 2671 states have call predecessors, (3209), 2561 states have call successors, (3209) [2022-12-14 06:35:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18871 states to 18871 states and 21194 transitions. [2022-12-14 06:35:55,873 INFO L78 Accepts]: Start accepts. Automaton has 18871 states and 21194 transitions. Word has length 626 [2022-12-14 06:35:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:35:55,873 INFO L495 AbstractCegarLoop]: Abstraction has 18871 states and 21194 transitions. [2022-12-14 06:35:55,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 15.033333333333333) internal successors, (451), 28 states have internal predecessors, (451), 18 states have call successors, (112), 8 states have call predecessors, (112), 12 states have return successors, (112), 22 states have call predecessors, (112), 18 states have call successors, (112) [2022-12-14 06:35:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 18871 states and 21194 transitions. [2022-12-14 06:35:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1597 [2022-12-14 06:35:55,911 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:35:55,911 INFO L195 NwaCegarLoop]: trace histogram [85, 43, 43, 43, 43, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 29, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:35:55,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 06:35:56,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:35:56,112 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:35:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:35:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1783938059, now seen corresponding path program 1 times [2022-12-14 06:35:56,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:35:56,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56882434] [2022-12-14 06:35:56,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:35:56,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:35:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:35:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 25465 backedges. 2046 proven. 379 refuted. 0 times theorem prover too weak. 23040 trivial. 0 not checked. [2022-12-14 06:35:57,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:35:57,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56882434] [2022-12-14 06:35:57,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56882434] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:35:57,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205739758] [2022-12-14 06:35:57,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:35:57,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:35:57,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:35:57,428 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:35:57,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 06:35:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:35:57,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 4851 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 06:35:57,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:35:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 25465 backedges. 12111 proven. 0 refuted. 0 times theorem prover too weak. 13354 trivial. 0 not checked. [2022-12-14 06:35:58,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:35:58,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205739758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:35:58,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:35:58,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-12-14 06:35:58,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252110105] [2022-12-14 06:35:58,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:35:58,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:35:58,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:35:58,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:35:58,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:35:58,198 INFO L87 Difference]: Start difference. First operand 18871 states and 21194 transitions. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 4 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2022-12-14 06:35:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:35:59,621 INFO L93 Difference]: Finished difference Result 33088 states and 37218 transitions. [2022-12-14 06:35:59,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:35:59,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 4 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 1596 [2022-12-14 06:35:59,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:35:59,648 INFO L225 Difference]: With dead ends: 33088 [2022-12-14 06:35:59,648 INFO L226 Difference]: Without dead ends: 14338 [2022-12-14 06:35:59,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1603 GetRequests, 1597 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:35:59,666 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 44 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:35:59,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 189 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:35:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14338 states. [2022-12-14 06:36:01,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14338 to 14323. [2022-12-14 06:36:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14323 states, 10278 states have (on average 1.127651294026075) internal successors, (11590), 10582 states have internal predecessors, (11590), 1969 states have call successors, (1969), 1684 states have call predecessors, (1969), 2075 states have return successors, (2533), 2056 states have call predecessors, (2533), 1969 states have call successors, (2533) [2022-12-14 06:36:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14323 states to 14323 states and 16092 transitions. [2022-12-14 06:36:01,039 INFO L78 Accepts]: Start accepts. Automaton has 14323 states and 16092 transitions. Word has length 1596 [2022-12-14 06:36:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:36:01,039 INFO L495 AbstractCegarLoop]: Abstraction has 14323 states and 16092 transitions. [2022-12-14 06:36:01,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 4 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2022-12-14 06:36:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 14323 states and 16092 transitions. [2022-12-14 06:36:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1597 [2022-12-14 06:36:01,069 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:36:01,070 INFO L195 NwaCegarLoop]: trace histogram [85, 43, 43, 43, 43, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 29, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:36:01,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 06:36:01,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 06:36:01,271 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:36:01,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:36:01,273 INFO L85 PathProgramCache]: Analyzing trace with hash -450508821, now seen corresponding path program 2 times [2022-12-14 06:36:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:36:01,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431176447] [2022-12-14 06:36:01,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:36:01,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:36:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:36:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 25465 backedges. 2046 proven. 379 refuted. 0 times theorem prover too weak. 23040 trivial. 0 not checked. [2022-12-14 06:36:02,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:36:02,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431176447] [2022-12-14 06:36:02,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431176447] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:36:02,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576130152] [2022-12-14 06:36:02,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:36:02,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:36:02,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:36:02,626 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:36:02,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 06:36:02,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 06:36:02,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:36:02,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 06:36:02,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:36:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25465 backedges. 2851 proven. 0 refuted. 0 times theorem prover too weak. 22614 trivial. 0 not checked. [2022-12-14 06:36:02,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:36:02,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576130152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:36:02,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:36:02,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-12-14 06:36:02,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394041890] [2022-12-14 06:36:02,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:36:02,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:36:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:36:02,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:36:02,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:36:02,862 INFO L87 Difference]: Start difference. First operand 14323 states and 16092 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-12-14 06:36:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:36:04,120 INFO L93 Difference]: Finished difference Result 26474 states and 30324 transitions. [2022-12-14 06:36:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:36:04,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) Word has length 1596 [2022-12-14 06:36:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:36:04,140 INFO L225 Difference]: With dead ends: 26474 [2022-12-14 06:36:04,141 INFO L226 Difference]: Without dead ends: 12643 [2022-12-14 06:36:04,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1603 GetRequests, 1598 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:36:04,155 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 74 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:36:04,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 169 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:36:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12643 states. [2022-12-14 06:36:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12643 to 11447. [2022-12-14 06:36:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11447 states, 8382 states have (on average 1.1141732283464567) internal successors, (9339), 8506 states have internal predecessors, (9339), 1555 states have call successors, (1555), 1341 states have call predecessors, (1555), 1509 states have return successors, (1801), 1599 states have call predecessors, (1801), 1555 states have call successors, (1801) [2022-12-14 06:36:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11447 states to 11447 states and 12695 transitions. [2022-12-14 06:36:05,324 INFO L78 Accepts]: Start accepts. Automaton has 11447 states and 12695 transitions. Word has length 1596 [2022-12-14 06:36:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:36:05,324 INFO L495 AbstractCegarLoop]: Abstraction has 11447 states and 12695 transitions. [2022-12-14 06:36:05,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-12-14 06:36:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 11447 states and 12695 transitions. [2022-12-14 06:36:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2022-12-14 06:36:05,349 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:36:05,349 INFO L195 NwaCegarLoop]: trace histogram [85, 43, 43, 43, 43, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 28, 28, 27, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:36:05,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 06:36:05,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 06:36:05,551 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 06:36:05,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:36:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1160620283, now seen corresponding path program 3 times [2022-12-14 06:36:05,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:36:05,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285058034] [2022-12-14 06:36:05,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:36:05,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:36:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:36:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 26209 backedges. 1820 proven. 470 refuted. 0 times theorem prover too weak. 23919 trivial. 0 not checked. [2022-12-14 06:36:09,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:36:09,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285058034] [2022-12-14 06:36:09,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285058034] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:36:09,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579533893] [2022-12-14 06:36:09,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:36:09,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:36:09,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:36:09,866 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:36:09,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 06:36:10,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:36:10,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:36:10,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 3659 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 06:36:10,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:36:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 26209 backedges. 6027 proven. 1060 refuted. 0 times theorem prover too weak. 19122 trivial. 0 not checked. [2022-12-14 06:36:10,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:36:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 26209 backedges. 1599 proven. 4 refuted. 0 times theorem prover too weak. 24606 trivial. 0 not checked. [2022-12-14 06:36:12,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579533893] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:36:12,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1032000652] [2022-12-14 06:36:12,037 INFO L159 IcfgInterpreter]: Started Sifa with 75 locations of interest [2022-12-14 06:36:12,037 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:36:12,038 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:36:12,038 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:36:12,038 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:36:18,004 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 62 for LOIs [2022-12-14 06:36:18,013 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 58 for LOIs [2022-12-14 06:36:18,019 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 74 for LOIs [2022-12-14 06:36:18,030 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 32 for LOIs [2022-12-14 06:36:18,032 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 50 for LOIs [2022-12-14 06:36:18,128 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 50 for LOIs [2022-12-14 06:36:18,194 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 50 for LOIs [2022-12-14 06:36:18,240 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:36:42,782 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '582631#(and (<= ~q_buf_0~0 2147483647) (= ~p_last_write~0 ~q_buf_0~0) (< 2147483646 ~p_num_write~0) (<= 0 (+ ~q_buf_0~0 2147483648)) (or (and (<= 0 ~t~0) (not (= |ULTIMATE.start_eval_~tmp~2#1| 0)) (= ~c_num_read~0 0) (<= 0 ~c_dr_pc~0) (<= |ULTIMATE.start_eval_~tmp~2#1| 2147483647) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= 2 ~p_dw_pc~0) (= ~slow_clk_edge~0 2) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (= ~p_dw_st~0 1) (<= ~q_free~0 1) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) (= 2 ~fast_clk_edge~0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_eval_~tmp~2#1| 2147483648))) (and (<= 0 ~t~0) (not (= |ULTIMATE.start_eval_~tmp~2#1| 0)) (= ~c_num_read~0 0) (<= 0 ~c_dr_pc~0) (<= |ULTIMATE.start_eval_~tmp~2#1| 2147483647) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= ~slow_clk_edge~0 2) (not (= ~q_free~0 0)) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= ~p_dw_pc~0 1) (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (= ~p_dw_st~0 1) (<= ~q_free~0 1) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) (= 2 ~fast_clk_edge~0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_eval_~tmp~2#1| 2147483648)))))' at error location [2022-12-14 06:36:42,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 06:36:42,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:36:42,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 12] total 37 [2022-12-14 06:36:42,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798325436] [2022-12-14 06:36:42,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:36:42,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 06:36:42,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:36:42,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 06:36:42,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=7924, Unknown=0, NotChecked=0, Total=8556 [2022-12-14 06:36:42,786 INFO L87 Difference]: Start difference. First operand 11447 states and 12695 transitions. Second operand has 37 states, 29 states have (on average 10.03448275862069) internal successors, (291), 30 states have internal predecessors, (291), 17 states have call successors, (75), 15 states have call predecessors, (75), 21 states have return successors, (81), 19 states have call predecessors, (81), 17 states have call successors, (81) [2022-12-14 06:36:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:36:50,879 INFO L93 Difference]: Finished difference Result 13491 states and 15041 transitions. [2022-12-14 06:36:50,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2022-12-14 06:36:50,880 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 10.03448275862069) internal successors, (291), 30 states have internal predecessors, (291), 17 states have call successors, (75), 15 states have call predecessors, (75), 21 states have return successors, (81), 19 states have call predecessors, (81), 17 states have call successors, (81) Word has length 1644 [2022-12-14 06:36:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:36:50,881 INFO L225 Difference]: With dead ends: 13491 [2022-12-14 06:36:50,881 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 06:36:50,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5175 GetRequests, 4685 SyntacticMatches, 207 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50612 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=6754, Invalid=74186, Unknown=0, NotChecked=0, Total=80940 [2022-12-14 06:36:50,897 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 1801 mSDsluCounter, 3129 mSDsCounter, 0 mSdLazyCounter, 7204 mSolverCounterSat, 1543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 8747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1543 IncrementalHoareTripleChecker+Valid, 7204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:36:50,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 3298 Invalid, 8747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1543 Valid, 7204 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-12-14 06:36:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 06:36:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 06:36:50,898 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) [2022-12-14 06:36:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 06:36:50,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1644 [2022-12-14 06:36:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:36:50,900 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 06:36:50,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 10.03448275862069) internal successors, (291), 30 states have internal predecessors, (291), 17 states have call successors, (75), 15 states have call predecessors, (75), 21 states have return successors, (81), 19 states have call predecessors, (81), 17 states have call successors, (81) [2022-12-14 06:36:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 06:36:50,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 06:36:50,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-12-14 06:36:50,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-12-14 06:36:50,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-12-14 06:36:50,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-12-14 06:36:50,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-12-14 06:36:50,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-12-14 06:36:50,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 06:36:51,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 06:36:51,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 06:37:29,472 WARN L233 SmtUtils]: Spent 5.16s on a formula simplification. DAG size of input: 702 DAG size of output: 67 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 06:37:38,687 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 702 DAG size of output: 67 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 06:37:46,499 INFO L895 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse23 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse24 (= 1 ~c_dr_i~0)) (.cse25 (<= 1 ~p_dw_pc~0))) (let ((.cse22 (not (<= 1 ~t~0))) (.cse16 (not (= |old(~p_dw_st~0)| 2))) (.cse18 (not (= 2 ~p_dw_pc~0))) (.cse14 (not (<= ~t~0 0))) (.cse6 (not (<= ~p_num_write~0 0))) (.cse19 (not (= ~slow_clk_edge~0 1))) (.cse21 (not (= ~fast_clk_edge~0 1))) (.cse15 (= ~q_read_ev~0 1)) (.cse17 (not (= ~q_free~0 0))) (.cse0 (not (= ~p_dw_pc~0 1))) (.cse1 (not (= ~slow_clk_edge~0 2))) (.cse2 (not (= ~c_dr_pc~0 1))) (.cse3 (not (<= ~c_num_read~0 0))) (.cse4 (= ~q_read_ev~0 0)) (.cse5 (not (<= 0 ~c_num_read~0))) (.cse7 (not (<= 0 ~p_num_write~0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse9 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (<= 1 ~c_dr_pc~0) .cse23 .cse24 .cse25)) (.cse10 (not .cse25)) (.cse11 (not (<= 0 ~t~0))) (.cse20 (not (<= ~p_num_write~0 1))) (.cse12 (not (= 2 ~fast_clk_edge~0))) (.cse13 (not .cse24))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse15 .cse16 .cse17 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse20 .cse21 .cse13) (or .cse22 .cse15 .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse20 .cse21 .cse13) (or .cse22 .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse13) (or .cse22 .cse15 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse20 .cse21 .cse13) (or (not (<= ~c_dr_pc~0 0)) .cse14 (not (= |old(~c_dr_st~0)| 0)) (not (<= ~p_dw_pc~0 0)) .cse1 (and .cse23 (= ~p_dw_st~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= |old(~p_dw_st~0)| 0)) .cse11 .cse12 .cse13) (or .cse15 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13) (or .cse14 .cse15 .cse17 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse20 .cse21 .cse13) (or .cse14 .cse15 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse21 .cse13) (or .cse15 .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13)))) [2022-12-14 06:37:46,500 INFO L895 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse23 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse17 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse23)) (.cse15 (not (= 2 ~fast_clk_edge~0))) (.cse20 (not (<= ~t~0 0))) (.cse18 (not (= ~p_dw_pc~0 1))) (.cse19 (not (<= ~p_num_write~0 0))) (.cse21 (not (= ~slow_clk_edge~0 1))) (.cse13 (not (<= 0 ~t~0))) (.cse24 (not (<= 1 ~t~0))) (.cse0 (= ~q_read_ev~0 1)) (.cse1 (and .cse23 (= 2 ~p_dw_st~0))) (.cse2 (not (= |old(~p_dw_st~0)| 2))) (.cse3 (not (= ~q_free~0 0))) (.cse4 (not (= ~slow_clk_edge~0 2))) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse6 (not (<= ~c_num_read~0 0))) (.cse7 (= ~q_read_ev~0 0)) (.cse8 (not (= 2 ~p_dw_pc~0))) (.cse9 (not (<= 0 ~c_num_read~0))) (.cse10 (not (<= 0 ~p_num_write~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (not (<= 1 ~p_dw_pc~0))) (.cse14 (not (<= ~p_num_write~0 1))) (.cse22 (not (= ~fast_clk_edge~0 1))) (.cse16 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse18 .cse4 .cse5 .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse22 .cse16) (or (not (<= ~c_dr_pc~0 0)) .cse20 (not (= |old(~c_dr_st~0)| 0)) (not (<= ~p_dw_pc~0 0)) .cse4 (and .cse23 (= ~p_dw_st~0 0)) .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 (not (= |old(~p_dw_st~0)| 0)) .cse13 .cse15 .cse16) (or .cse20 .cse0 .cse23 .cse3 .cse18 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse22 .cse16) (or .cse24 .cse0 .cse23 .cse18 .cse4 .cse5 .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 .cse12 .cse22 .cse16) (or .cse24 .cse0 .cse23 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse16) (or .cse0 .cse17 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse20 .cse0 .cse23 .cse18 .cse5 .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 .cse21 .cse12 .cse13 .cse22 .cse16) (or .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse16)))) [2022-12-14 06:37:46,500 INFO L899 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2022-12-14 06:37:46,500 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2022-12-14 06:37:46,500 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 379 403) the Hoare annotation is: (let ((.cse23 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse24 (= 1 ~c_dr_i~0)) (.cse25 (<= 1 ~p_dw_pc~0))) (let ((.cse22 (not (<= 1 ~t~0))) (.cse16 (not (= |old(~p_dw_st~0)| 2))) (.cse18 (not (= 2 ~p_dw_pc~0))) (.cse14 (not (<= ~t~0 0))) (.cse6 (not (<= ~p_num_write~0 0))) (.cse19 (not (= ~slow_clk_edge~0 1))) (.cse21 (not (= ~fast_clk_edge~0 1))) (.cse15 (= ~q_read_ev~0 1)) (.cse17 (not (= ~q_free~0 0))) (.cse0 (not (= ~p_dw_pc~0 1))) (.cse1 (not (= ~slow_clk_edge~0 2))) (.cse2 (not (= ~c_dr_pc~0 1))) (.cse3 (not (<= ~c_num_read~0 0))) (.cse4 (= ~q_read_ev~0 0)) (.cse5 (not (<= 0 ~c_num_read~0))) (.cse7 (not (<= 0 ~p_num_write~0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse9 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (<= 1 ~c_dr_pc~0) .cse23 .cse24 .cse25)) (.cse10 (not .cse25)) (.cse11 (not (<= 0 ~t~0))) (.cse20 (not (<= ~p_num_write~0 1))) (.cse12 (not (= 2 ~fast_clk_edge~0))) (.cse13 (not .cse24))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse15 .cse16 .cse17 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse20 .cse21 .cse13) (or .cse22 .cse15 .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse20 .cse21 .cse13) (or .cse22 .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse13) (or .cse22 .cse15 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse20 .cse21 .cse13) (or (not (<= ~c_dr_pc~0 0)) .cse14 (not (= |old(~c_dr_st~0)| 0)) (not (<= ~p_dw_pc~0 0)) .cse1 (and .cse23 (= ~p_dw_st~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= |old(~p_dw_st~0)| 0)) .cse11 .cse12 .cse13) (or .cse15 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13) (or .cse14 .cse15 .cse17 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse20 .cse21 .cse13) (or .cse14 .cse15 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse21 .cse13) (or .cse15 .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13)))) [2022-12-14 06:37:46,500 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2022-12-14 06:37:46,500 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2022-12-14 06:37:46,501 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 287 306) the Hoare annotation is: true [2022-12-14 06:37:46,501 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2022-12-14 06:37:46,501 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2022-12-14 06:37:46,501 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2022-12-14 06:37:46,501 INFO L895 garLoopResultBuilder]: At program point L116(lines 94 118) the Hoare annotation is: (let ((.cse17 (not (= 2 ~p_dw_pc~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse16 (not (= ~q_free~0 0))) (.cse18 (not (<= ~p_num_write~0 1))) (.cse14 (not (= 2 ~p_dw_st~0))) (.cse19 (= is_do_read_c_triggered_~__retres1~1 1)) (.cse20 (not (<= ~t~0 0))) (.cse15 (= ~q_read_ev~0 1)) (.cse21 (not (= ~slow_clk_edge~0 1))) (.cse11 (not (<= 0 ~t~0))) (.cse22 (not (= ~fast_clk_edge~0 1))) (.cse23 (not (<= 1 ~t~0))) (.cse1 (= is_do_read_c_triggered_~__retres1~1 0)) (.cse2 (not (= ~p_dw_pc~0 1))) (.cse3 (not (= ~slow_clk_edge~0 2))) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse5 (not (<= ~c_num_read~0 0))) (.cse6 (= ~q_read_ev~0 0)) (.cse7 (not (<= 0 ~c_num_read~0))) (.cse8 (not (<= ~p_num_write~0 0))) (.cse9 (not (<= 0 ~p_num_write~0))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse12 (not (= 2 ~fast_clk_edge~0))) (.cse13 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse15 .cse16 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse14) (or .cse19 .cse20 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse7 .cse9 .cse10 .cse21 .cse11 .cse18 .cse22 .cse13 .cse14) (or .cse23 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse13) (or .cse19 .cse20 .cse15 .cse16 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 .cse11 .cse18 .cse22 .cse13) (or .cse23 .cse1 .cse15 .cse16 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse9 .cse10 .cse18 .cse22 .cse13 .cse14) (or (not (<= ~c_dr_pc~0 0)) .cse20 (not (= ~p_dw_st~0 0)) (not (<= ~p_dw_pc~0 0)) .cse1 (not .cse0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse14) (or .cse19 .cse20 .cse15 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse22 .cse13) (or .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13))) [2022-12-14 06:37:46,501 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2022-12-14 06:37:46,501 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 91 119) the Hoare annotation is: true [2022-12-14 06:37:46,501 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2022-12-14 06:37:46,501 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2022-12-14 06:37:46,502 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 307 324) the Hoare annotation is: (let ((.cse2 (not (= ~p_dw_pc~0 1))) (.cse16 (not (<= ~p_num_write~0 0))) (.cse0 (= |old(~q_read_ev~0)| 1)) (.cse1 (not (= ~q_free~0 0))) (.cse3 (not (= ~slow_clk_edge~0 2))) (.cse4 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse6 (not (<= ~c_num_read~0 0))) (.cse7 (not (<= 0 ~c_num_read~0))) (.cse8 (not (<= 0 ~p_num_write~0))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse10 (not (<= 1 ~p_dw_pc~0))) (.cse11 (not (<= 0 ~t~0))) (.cse12 (not (<= ~p_num_write~0 1))) (.cse13 (not (= 2 ~fast_clk_edge~0))) (.cse14 (= |old(~q_read_ev~0)| 0)) (.cse15 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15) (or (not (<= ~c_dr_pc~0 0)) (not (<= ~t~0 0)) (not (= ~p_dw_st~0 0)) (not (<= ~p_dw_pc~0 0)) .cse0 (not (= ~c_dr_st~0 0)) .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse11 .cse13 .cse15) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (not (= 2 ~p_dw_pc~0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 2 ~p_dw_st~0))))) [2022-12-14 06:37:46,502 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2022-12-14 06:37:46,502 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2022-12-14 06:37:46,502 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 254 268) the Hoare annotation is: (let ((.cse2 (not (= ~p_dw_pc~0 1))) (.cse16 (not (<= ~p_num_write~0 0))) (.cse0 (= |old(~q_read_ev~0)| 1)) (.cse1 (not (= ~q_free~0 0))) (.cse3 (not (= ~slow_clk_edge~0 2))) (.cse4 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse6 (not (<= ~c_num_read~0 0))) (.cse7 (not (<= 0 ~c_num_read~0))) (.cse8 (not (<= 0 ~p_num_write~0))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse10 (not (<= 1 ~p_dw_pc~0))) (.cse11 (not (<= 0 ~t~0))) (.cse12 (not (<= ~p_num_write~0 1))) (.cse13 (not (= 2 ~fast_clk_edge~0))) (.cse14 (= |old(~q_read_ev~0)| 0)) (.cse15 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or (not (<= ~c_dr_pc~0 0)) (not (<= ~t~0 0)) (not (<= ~p_dw_pc~0 0)) .cse0 (not (= ~c_dr_st~0 0)) .cse3 .cse4 (not (= ~c_dr_st~0 ~p_dw_st~0)) .cse6 .cse7 .cse16 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (not (= 2 ~p_dw_pc~0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 2 ~p_dw_st~0))))) [2022-12-14 06:37:46,502 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2022-12-14 06:37:46,502 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 325 342) the Hoare annotation is: (let ((.cse6 (not (<= ~p_num_write~0 0))) (.cse0 (not (= ~p_dw_pc~0 1))) (.cse13 (= |old(~q_read_ev~0)| 1)) (.cse14 (not (= ~q_free~0 0))) (.cse1 (not (= ~slow_clk_edge~0 2))) (.cse2 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse3 (not (= ~c_dr_pc~0 1))) (.cse4 (not (<= ~c_num_read~0 0))) (.cse5 (not (<= 0 ~c_num_read~0))) (.cse7 (not (<= 0 ~p_num_write~0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse9 (not (<= 0 ~t~0))) (.cse15 (not (<= ~p_num_write~0 1))) (.cse10 (not (= 2 ~fast_clk_edge~0))) (.cse11 (= |old(~q_read_ev~0)| 0)) (.cse12 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (not (<= ~c_dr_pc~0 0)) (not (<= ~t~0 0)) (not (= ~p_dw_st~0 0)) (not (<= ~p_dw_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11 .cse12) (or .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 (not (= 2 ~p_dw_pc~0)) .cse5 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11 .cse12 (not (= 2 ~p_dw_st~0))))) [2022-12-14 06:37:46,502 INFO L895 garLoopResultBuilder]: At program point L514-1(line 514) the Hoare annotation is: (let ((.cse17 (<= ~p_num_write~0 0)) (.cse18 (= ~slow_clk_edge~0 2)) (.cse12 (= ~p_dw_pc~0 1)) (.cse19 (<= 1 ~t~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~q_read_ev~0 1))) (.cse3 (= |ULTIMATE.start_start_simulation_~tmp~4#1| 0)) (.cse4 (= ~slow_clk_edge~0 1)) (.cse5 (<= ~c_num_read~0 0)) (.cse6 (<= 0 ~p_num_write~0)) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (not (= ~q_read_ev~0 0))) (.cse20 (= 2 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (<= ~p_num_write~0 1)) (.cse13 (<= ~t~0 0)) (.cse14 (= ~fast_clk_edge~0 1)) (.cse21 (= 2 ~p_dw_st~0)) (.cse15 (= ~p_dw_i~0 1)) (.cse16 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse18 .cse12 .cse19 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse18 .cse19 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse19 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse13 .cse14 .cse21 .cse15 .cse16))) [2022-12-14 06:37:46,502 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-12-14 06:37:46,502 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 231) no Hoare annotation was computed. [2022-12-14 06:37:46,503 INFO L899 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2022-12-14 06:37:46,503 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2022-12-14 06:37:46,503 INFO L895 garLoopResultBuilder]: At program point L349-2(lines 345 360) the Hoare annotation is: (let ((.cse1 (<= ~p_num_write~0 0)) (.cse15 (= ~slow_clk_edge~0 2)) (.cse10 (= ~p_dw_pc~0 1)) (.cse16 (<= 1 ~t~0)) (.cse0 (<= 0 ~t~0)) (.cse2 (not (= ~q_read_ev~0 1))) (.cse3 (= |ULTIMATE.start_start_simulation_~tmp~4#1| 0)) (.cse4 (= ~slow_clk_edge~0 1)) (.cse5 (<= ~c_num_read~0 0)) (.cse6 (<= 0 ~p_num_write~0)) (.cse7 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse19 (= 2 ~p_dw_pc~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse18 (<= ~p_num_write~0 1)) (.cse11 (<= ~t~0 0)) (.cse12 (= ~fast_clk_edge~0 1)) (.cse20 (= 2 ~p_dw_st~0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse10 .cse16 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse17 .cse8 .cse19 .cse9 .cse18 .cse15 .cse16 .cse12 .cse20 .cse13 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse18 .cse15 .cse10 .cse16 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse19 .cse9 .cse18 .cse11 .cse12 .cse20 .cse13 .cse14))) [2022-12-14 06:37:46,503 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2022-12-14 06:37:46,503 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-12-14 06:37:46,503 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 145 193) the Hoare annotation is: (let ((.cse5 (= ~q_free~0 0)) (.cse8 (<= ~p_num_write~0 1)) (.cse11 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse0 (<= 0 ~t~0)) (.cse16 (<= ~p_num_write~0 0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse9 (= ~slow_clk_edge~0 2)) (.cse10 (= ~p_dw_pc~0 1)) (.cse17 (<= ~t~0 0)) (.cse12 (= 2 ~p_dw_st~0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 2 ~fast_clk_edge~0)) (.cse18 (= |ULTIMATE.start_eval_~tmp___1~0#1| 1)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (<= 1 ~c_dr_pc~0) .cse3 (<= ~c_dr_pc~0 1) .cse4 .cse5 .cse6 (= 2 ~p_dw_pc~0) .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and (= ~c_dr_st~0 0) .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse10 .cse17 .cse12 .cse13 .cse14 (<= ~c_dr_pc~0 0) .cse18 .cse15) (and .cse0 .cse16 .cse1 (= ~c_dr_st~0 2) .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse17 .cse12 .cse13 .cse14 .cse18 .cse15))) [2022-12-14 06:37:46,503 INFO L902 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 476 534) the Hoare annotation is: true [2022-12-14 06:37:46,503 INFO L895 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (let ((.cse12 (= ~p_dw_pc~0 1)) (.cse0 (<= 0 ~t~0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 1 ~p_dw_pc~0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= ~c_dr_pc~0 1)) (.cse10 (<= ~p_num_write~0 1)) (.cse11 (= ~slow_clk_edge~0 2)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 2 ~fast_clk_edge~0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (<= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ~p_dw_pc~0) .cse9 .cse10 .cse11 (= 2 ~p_dw_st~0) .cse13 .cse14 .cse15))) [2022-12-14 06:37:46,503 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2022-12-14 06:37:46,503 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2022-12-14 06:37:46,504 INFO L895 garLoopResultBuilder]: At program point L202(lines 202 206) the Hoare annotation is: (let ((.cse19 (not (= ~c_dr_st~0 0)))) (let ((.cse6 (= ~q_free~0 0)) (.cse9 (<= ~p_num_write~0 1)) (.cse2 (or .cse19 (= |exists_runnable_thread_#res| 1))) (.cse8 (= ~c_dr_pc~0 1)) (.cse12 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse0 (<= 0 ~t~0)) (.cse16 (<= ~p_num_write~0 0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse3 (<= ~c_num_read~0 0)) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse10 (= ~slow_clk_edge~0 2)) (.cse11 (= ~p_dw_pc~0 1)) (.cse17 (<= ~t~0 0)) (.cse20 (= 2 ~p_dw_st~0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 2 ~fast_clk_edge~0)) (.cse18 (= |ULTIMATE.start_eval_~tmp___1~0#1| 1)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse2 .cse3 (<= ~p_dw_pc~0 0) .cse4 (<= ~c_dr_pc~0 1) .cse5 .cse7 .cse10 (= ~p_dw_st~0 0) .cse17 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 (= 2 ~p_dw_pc~0) .cse8 .cse9 .cse10 .cse12 .cse20 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse3 .cse4 .cse19 .cse5 .cse7 .cse10 .cse11 .cse17 .cse20 .cse13 .cse14 (<= ~c_dr_pc~0 0) .cse18 .cse15)))) [2022-12-14 06:37:46,504 INFO L899 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2022-12-14 06:37:46,504 INFO L899 garLoopResultBuilder]: For program point L351-1(line 351) no Hoare annotation was computed. [2022-12-14 06:37:46,504 INFO L895 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (and (<= 0 ~t~0) (<= ~p_num_write~0 0) (not (= ~q_read_ev~0 1)) (<= ~c_num_read~0 0) (<= ~p_dw_pc~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (not (= ~q_read_ev~0 0)) (= ~slow_clk_edge~0 2) (= ~p_dw_st~0 0) (<= ~t~0 0) (= ~p_dw_i~0 1) (= 2 ~fast_clk_edge~0) (<= ~c_dr_pc~0 0) (= ~c_dr_st~0 ~p_dw_st~0) (<= 0 ~c_num_read~0)) [2022-12-14 06:37:46,504 INFO L895 garLoopResultBuilder]: At program point L484-1(line 484) the Hoare annotation is: (and (<= 0 ~t~0) (<= ~p_num_write~0 0) (not (= ~q_read_ev~0 1)) (or (= |old(~q_read_ev~0)| 1) (= ~q_free~0 1) (not (= ~q_read_ev~0 0)) (= |old(~q_read_ev~0)| 0)) (<= ~c_num_read~0 0) (<= ~p_dw_pc~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~slow_clk_edge~0 2) (= ~p_dw_st~0 0) (<= ~t~0 0) (= ~p_dw_i~0 1) (= 2 ~fast_clk_edge~0) (<= ~c_dr_pc~0 0) (= ~c_dr_st~0 ~p_dw_st~0) (<= 0 ~c_num_read~0)) [2022-12-14 06:37:46,504 INFO L895 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (let ((.cse22 (= ~c_dr_pc~0 1)) (.cse21 (= |ULTIMATE.start_eval_~tmp___1~0#1| 1)) (.cse17 (= ~c_dr_st~0 0)) (.cse23 (<= ~p_dw_pc~0 0)) (.cse24 (= ~p_dw_st~0 0)) (.cse19 (<= ~t~0 0)) (.cse20 (<= ~c_dr_pc~0 0)) (.cse0 (<= 0 ~t~0)) (.cse18 (<= ~p_num_write~0 0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (<= ~c_dr_pc~0 1)) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= 2 ~p_dw_pc~0)) (.cse10 (<= ~p_num_write~0 1)) (.cse11 (= ~slow_clk_edge~0 2)) (.cse12 (= 2 ~p_dw_st~0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 2 ~fast_clk_edge~0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse16 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse18 .cse1 .cse2 .cse4 .cse6 .cse8 .cse11 .cse16 .cse19 .cse12 .cse13 .cse14 .cse20 .cse21 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse18 .cse1 (= ~c_dr_st~0 2) .cse2 .cse23 .cse4 .cse6 .cse8 .cse22 .cse11 .cse24 .cse19 .cse13 .cse14 .cse21 .cse15) (and .cse17 .cse0 .cse18 .cse1 .cse2 .cse23 .cse4 .cse6 .cse8 .cse11 .cse24 .cse19 .cse13 .cse14 .cse20 .cse15) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse11 .cse16 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 1 ~t~0) .cse12 .cse13 .cse14 .cse15))) [2022-12-14 06:37:46,504 INFO L895 garLoopResultBuilder]: At program point L171(lines 171 179) the Hoare annotation is: (and (<= 0 ~t~0) (<= ~p_num_write~0 0) (not (= ~q_read_ev~0 1)) (<= ~c_num_read~0 0) (<= 1 ~c_dr_pc~0) (<= 0 ~p_num_write~0) (<= ~c_dr_pc~0 1) (= 1 ~c_dr_i~0) (<= 1 ~p_dw_pc~0) (not (= ~q_read_ev~0 0)) (= ~slow_clk_edge~0 2) (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (= ~p_dw_i~0 1) (or (not (= ~p_dw_st~0 0)) (= |exists_runnable_thread_#res| 1)) (= 2 ~fast_clk_edge~0) (<= 0 ~c_num_read~0)) [2022-12-14 06:37:46,504 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2022-12-14 06:37:46,504 INFO L895 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (and (= ~c_dr_st~0 0) (<= 0 ~t~0) (<= ~p_num_write~0 0) (not (= ~q_read_ev~0 1)) (or (= |old(~q_read_ev~0)| 1) (= ~q_free~0 1) (not (= ~q_read_ev~0 0)) (= |old(~q_read_ev~0)| 0)) (<= ~c_num_read~0 0) (<= ~p_dw_pc~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~slow_clk_edge~0 2) (= ~p_dw_st~0 0) (<= ~t~0 0) (= ~p_dw_i~0 1) (= 2 ~fast_clk_edge~0) (<= ~c_dr_pc~0 0) (<= 0 ~c_num_read~0)) [2022-12-14 06:37:46,505 INFO L895 garLoopResultBuilder]: At program point L486-1(line 486) the Hoare annotation is: (and (= ~c_dr_st~0 0) (<= 0 ~t~0) (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) (<= ~p_dw_pc~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (or (not (= ~q_read_ev~0 1)) (= |old(~q_read_ev~0)| 1) (= ~q_free~0 1) (= |old(~q_read_ev~0)| 0)) (not (= ~q_read_ev~0 0)) (= ~slow_clk_edge~0 2) (= ~p_dw_st~0 0) (<= ~t~0 0) (= ~p_dw_i~0 1) (= 2 ~fast_clk_edge~0) (<= ~c_dr_pc~0 0) (<= 0 ~c_num_read~0)) [2022-12-14 06:37:46,505 INFO L899 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2022-12-14 06:37:46,505 INFO L895 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (let ((.cse12 (= ~p_dw_pc~0 1)) (.cse0 (<= 0 ~t~0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 1 ~p_dw_pc~0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= ~c_dr_pc~0 1)) (.cse10 (<= ~p_num_write~0 1)) (.cse11 (= ~slow_clk_edge~0 2)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 2 ~fast_clk_edge~0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (<= ~p_num_write~0 0) .cse1 (or (= |old(~q_read_ev~0)| 1) (= ~q_free~0 1) .cse8 (= |old(~q_read_ev~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ~p_dw_pc~0) .cse9 .cse10 .cse11 (= 2 ~p_dw_st~0) .cse13 .cse14 .cse15))) [2022-12-14 06:37:46,505 INFO L895 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (let ((.cse6 (= ~q_free~0 0)) (.cse10 (<= ~p_num_write~0 1)) (.cse0 (<= 0 ~t~0)) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse7 (<= 1 ~p_dw_pc~0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= ~c_dr_pc~0 1)) (.cse11 (= ~slow_clk_edge~0 2)) (.cse12 (= ~p_dw_pc~0 1)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 2 ~fast_clk_edge~0)) (.cse15 (<= 0 ~c_num_read~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 .cse6 .cse7 .cse8 (= 2 ~p_dw_pc~0) .cse9 .cse10 .cse11 (= 2 ~p_dw_st~0) .cse13 .cse14 .cse15) (and .cse0 (<= ~p_num_write~0 0) .cse2 .cse3 .cse4 .cse5 (or .cse1 (= |old(~q_read_ev~0)| 1) (= ~q_free~0 1) (= |old(~q_read_ev~0)| 0)) .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-14 06:37:46,505 INFO L902 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: true [2022-12-14 06:37:46,505 INFO L895 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (and (= ~c_dr_st~0 0) (<= 0 ~t~0) (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) (<= ~p_dw_pc~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (or (not (= ~q_read_ev~0 1)) (= |old(~q_read_ev~0)| 1) (= ~q_free~0 1) (= |old(~q_read_ev~0)| 0)) (not (= ~q_read_ev~0 0)) (= ~slow_clk_edge~0 2) (= ~p_dw_st~0 0) (<= ~t~0 0) (= ~p_dw_i~0 1) (= 2 ~fast_clk_edge~0) (<= ~c_dr_pc~0 0) (<= 0 ~c_num_read~0)) [2022-12-14 06:37:46,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 06:37:46,505 INFO L895 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (let ((.cse8 (= ~p_dw_pc~0 1)) (.cse0 (<= 0 ~t~0)) (.cse4 (not (= ~q_read_ev~0 1))) (.cse1 (<= ~c_num_read~0 0)) (.cse2 (<= 0 ~p_num_write~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse12 (= ~q_free~0 0)) (.cse5 (not (= ~q_read_ev~0 0))) (.cse6 (= ~c_dr_pc~0 1)) (.cse13 (<= ~p_num_write~0 1)) (.cse7 (= ~slow_clk_edge~0 2)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= 2 ~fast_clk_edge~0)) (.cse11 (<= 0 ~c_num_read~0))) (or (and .cse0 (<= ~p_num_write~0 0) .cse1 .cse2 .cse3 (or .cse4 (= |old(~q_read_ev~0)| 1) (= ~q_free~0 1) (= |old(~q_read_ev~0)| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse4 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse4 .cse1 .cse2 .cse3 .cse12 .cse5 (= 2 ~p_dw_pc~0) .cse6 .cse13 .cse7 (= 2 ~p_dw_st~0) .cse9 .cse10 .cse11))) [2022-12-14 06:37:46,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 231) no Hoare annotation was computed. [2022-12-14 06:37:46,505 INFO L895 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (let ((.cse5 (= ~q_free~0 0)) (.cse8 (<= ~p_num_write~0 1)) (.cse0 (<= 0 ~t~0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse9 (= ~slow_clk_edge~0 2)) (.cse10 (= ~p_dw_pc~0 1)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= 2 ~fast_clk_edge~0)) (.cse13 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 ~p_dw_pc~0) .cse7 .cse8 .cse9 (= 2 ~p_dw_st~0) .cse11 .cse12 .cse13) (and .cse0 (<= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-12-14 06:37:46,505 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2022-12-14 06:37:46,505 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-12-14 06:37:46,505 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2022-12-14 06:37:46,506 INFO L895 garLoopResultBuilder]: At program point $Ultimate##36(lines 171 179) the Hoare annotation is: (let ((.cse0 (<= 0 ~t~0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse5 (not (= ~q_read_ev~0 0))) (.cse6 (= ~slow_clk_edge~0 2)) (.cse7 (= ~p_dw_pc~0 1)) (.cse8 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (or (not (= ~p_dw_st~0 0)) (= |exists_runnable_thread_#res| 1))) (.cse11 (= 2 ~fast_clk_edge~0)) (.cse12 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 (<= 1 ~c_dr_pc~0) .cse3 (<= ~c_dr_pc~0 1) .cse4 (= ~q_free~0 0) .cse5 (<= ~p_num_write~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_dr_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-12-14 06:37:46,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 183) no Hoare annotation was computed. [2022-12-14 06:37:46,506 INFO L895 garLoopResultBuilder]: At program point L491-1(lines 491 528) the Hoare annotation is: (let ((.cse5 (= ~q_free~0 0)) (.cse14 (= 2 ~p_dw_pc~0)) (.cse8 (<= ~p_num_write~0 1)) (.cse15 (= 2 ~p_dw_st~0)) (.cse16 (= ~c_dr_st~0 0)) (.cse0 (<= 0 ~t~0)) (.cse17 (<= ~p_num_write~0 0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse9 (= ~slow_clk_edge~0 2)) (.cse10 (= ~p_dw_pc~0 1)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= 2 ~fast_clk_edge~0)) (.cse13 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 (= |ULTIMATE.start_start_simulation_~tmp~4#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 (<= 1 ~t~0) .cse15 .cse11 .cse12 .cse13) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse15 .cse11 .cse12 .cse13) (and .cse16 .cse0 .cse17 .cse1 .cse2 (<= ~p_dw_pc~0 0) .cse3 .cse4 .cse6 .cse9 (= ~p_dw_st~0 0) (<= ~t~0 0) .cse11 .cse12 (<= ~c_dr_pc~0 0) .cse13) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-12-14 06:37:46,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 183) no Hoare annotation was computed. [2022-12-14 06:37:46,506 INFO L899 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2022-12-14 06:37:46,506 INFO L902 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: true [2022-12-14 06:37:46,506 INFO L895 garLoopResultBuilder]: At program point L244-1(lines 210 247) the Hoare annotation is: (let ((.cse20 (not (= ~c_dr_st~0 0)))) (let ((.cse6 (= ~q_free~0 0)) (.cse9 (<= ~p_num_write~0 1)) (.cse2 (or .cse20 (= |exists_runnable_thread_#res| 1))) (.cse8 (= ~c_dr_pc~0 1)) (.cse12 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse0 (<= 0 ~t~0)) (.cse16 (<= ~p_num_write~0 0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse3 (<= ~c_num_read~0 0)) (.cse4 (<= 0 ~p_num_write~0)) (.cse17 (<= ~c_dr_pc~0 1)) (.cse5 (= 1 ~c_dr_i~0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse10 (= ~slow_clk_edge~0 2)) (.cse11 (= ~p_dw_pc~0 1)) (.cse18 (<= ~t~0 0)) (.cse21 (= 2 ~p_dw_st~0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 2 ~fast_clk_edge~0)) (.cse19 (= |ULTIMATE.start_eval_~tmp___1~0#1| 1)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse2 .cse3 (<= ~p_dw_pc~0 0) .cse4 .cse17 .cse5 .cse7 .cse10 (= ~p_dw_st~0 0) .cse18 .cse13 .cse14 .cse19 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 (= 2 ~p_dw_pc~0) .cse8 .cse9 .cse10 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse3 .cse4 .cse17 .cse20 .cse5 .cse7 .cse10 .cse11 .cse18 .cse21 .cse13 .cse14 .cse19 .cse15)))) [2022-12-14 06:37:46,506 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2022-12-14 06:37:46,506 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 404 456) the Hoare annotation is: (let ((.cse12 (= ~p_dw_pc~0 1)) (.cse0 (<= 0 ~t~0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 1 ~p_dw_pc~0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= ~c_dr_pc~0 1)) (.cse10 (<= ~p_num_write~0 1)) (.cse11 (= ~slow_clk_edge~0 2)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 2 ~fast_clk_edge~0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (<= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ~p_dw_pc~0) .cse9 .cse10 .cse11 (= 2 ~p_dw_st~0) .cse13 .cse14 .cse15))) [2022-12-14 06:37:46,506 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2022-12-14 06:37:46,506 INFO L899 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2022-12-14 06:37:46,507 INFO L895 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (let ((.cse22 (= ~c_dr_pc~0 1)) (.cse21 (= |ULTIMATE.start_eval_~tmp___1~0#1| 1)) (.cse17 (= ~c_dr_st~0 0)) (.cse23 (<= ~p_dw_pc~0 0)) (.cse24 (= ~p_dw_st~0 0)) (.cse19 (<= ~t~0 0)) (.cse20 (<= ~c_dr_pc~0 0)) (.cse0 (<= 0 ~t~0)) (.cse18 (<= ~p_num_write~0 0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (<= ~c_dr_pc~0 1)) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= 2 ~p_dw_pc~0)) (.cse10 (<= ~p_num_write~0 1)) (.cse11 (= ~slow_clk_edge~0 2)) (.cse12 (= 2 ~p_dw_st~0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 2 ~fast_clk_edge~0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse16 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse18 .cse1 .cse2 .cse4 .cse6 .cse8 .cse11 .cse16 .cse19 .cse12 .cse13 .cse14 .cse20 .cse21 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse18 .cse1 (= ~c_dr_st~0 2) .cse2 .cse23 .cse4 .cse6 .cse8 .cse22 .cse11 .cse24 .cse19 .cse13 .cse14 .cse21 .cse15) (and .cse17 .cse0 .cse18 .cse1 .cse2 .cse23 .cse4 .cse6 .cse8 .cse11 .cse24 .cse19 .cse13 .cse14 .cse20 .cse15) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse11 .cse16 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 1 ~t~0) .cse12 .cse13 .cse14 .cse15))) [2022-12-14 06:37:46,507 INFO L895 garLoopResultBuilder]: At program point L164-1(lines 164 187) the Hoare annotation is: (let ((.cse6 (= ~c_dr_pc~0 1)) (.cse0 (<= 0 ~t~0)) (.cse12 (<= ~p_num_write~0 0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse5 (not (= ~q_read_ev~0 0))) (.cse7 (= ~slow_clk_edge~0 2)) (.cse13 (not (= ~p_dw_pc~0 1))) (.cse14 (<= ~t~0 0)) (.cse8 (= ~p_dw_i~0 1)) (.cse15 (not (= 2 ~p_dw_pc~0))) (.cse9 (or (not (= ~p_dw_st~0 0)) (= |exists_runnable_thread_#res| 1))) (.cse10 (= 2 ~fast_clk_edge~0)) (.cse16 (= |ULTIMATE.start_eval_~tmp___1~0#1| 1)) (.cse11 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~q_free~0 0) .cse5 .cse6 (<= ~p_num_write~0 1) .cse7 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 (= ~c_dr_st~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse14 .cse8 .cse15 .cse9 .cse10 .cse16 .cse11) (and (= ~c_dr_st~0 0) .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse13 .cse14 .cse8 .cse15 .cse9 .cse10 (<= ~c_dr_pc~0 0) .cse16 .cse11))) [2022-12-14 06:37:46,507 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 351) no Hoare annotation was computed. [2022-12-14 06:37:46,507 INFO L899 garLoopResultBuilder]: For program point L231(line 231) no Hoare annotation was computed. [2022-12-14 06:37:46,507 INFO L899 garLoopResultBuilder]: For program point L231-1(line 231) no Hoare annotation was computed. [2022-12-14 06:37:46,507 INFO L899 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2022-12-14 06:37:46,507 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 351) no Hoare annotation was computed. [2022-12-14 06:37:46,507 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2022-12-14 06:37:46,507 INFO L895 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (let ((.cse5 (= ~q_free~0 0)) (.cse14 (= 2 ~p_dw_pc~0)) (.cse8 (<= ~p_num_write~0 1)) (.cse15 (= 2 ~p_dw_st~0)) (.cse0 (<= 0 ~t~0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse9 (= ~slow_clk_edge~0 2)) (.cse10 (= ~p_dw_pc~0 1)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= 2 ~fast_clk_edge~0)) (.cse13 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 (= |ULTIMATE.start_start_simulation_~tmp~4#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 (<= 1 ~t~0) .cse15 .cse11 .cse12 .cse13) (and (= ~c_dr_st~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse15 .cse11 .cse12 .cse13) (and .cse0 (<= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-12-14 06:37:46,507 INFO L895 garLoopResultBuilder]: At program point L463-1(line 463) the Hoare annotation is: (let ((.cse5 (= ~q_free~0 0)) (.cse14 (= 2 ~p_dw_pc~0)) (.cse8 (<= ~p_num_write~0 1)) (.cse15 (= 2 ~p_dw_st~0)) (.cse0 (<= 0 ~t~0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse9 (= ~slow_clk_edge~0 2)) (.cse10 (= ~p_dw_pc~0 1)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= 2 ~fast_clk_edge~0)) (.cse13 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 (= |ULTIMATE.start_start_simulation_~tmp~4#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 (<= 1 ~t~0) .cse15 .cse11 .cse12 .cse13) (and (= ~c_dr_st~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse15 .cse11 .cse12 .cse13) (and .cse0 (<= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-12-14 06:37:46,507 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-12-14 06:37:46,507 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-12-14 06:37:46,507 INFO L899 garLoopResultBuilder]: For program point L183-1(line 183) no Hoare annotation was computed. [2022-12-14 06:37:46,508 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (let ((.cse1 (<= ~p_num_write~0 0)) (.cse15 (= ~slow_clk_edge~0 2)) (.cse10 (= ~p_dw_pc~0 1)) (.cse16 (<= 1 ~t~0)) (.cse0 (<= 0 ~t~0)) (.cse2 (not (= ~q_read_ev~0 1))) (.cse3 (= |ULTIMATE.start_start_simulation_~tmp~4#1| 0)) (.cse4 (= ~slow_clk_edge~0 1)) (.cse5 (<= ~c_num_read~0 0)) (.cse6 (<= 0 ~p_num_write~0)) (.cse7 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse19 (= 2 ~p_dw_pc~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse18 (<= ~p_num_write~0 1)) (.cse11 (<= ~t~0 0)) (.cse12 (= ~fast_clk_edge~0 1)) (.cse20 (= 2 ~p_dw_st~0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse10 .cse16 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse17 .cse8 .cse19 .cse9 .cse18 .cse15 .cse16 .cse12 .cse20 .cse13 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse18 .cse15 .cse10 .cse16 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse19 .cse9 .cse18 .cse11 .cse12 .cse20 .cse13 .cse14))) [2022-12-14 06:37:46,508 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2022-12-14 06:37:46,508 INFO L895 garLoopResultBuilder]: At program point L87(lines 65 89) the Hoare annotation is: (let ((.cse6 (not (= 2 ~p_dw_pc~0))) (.cse13 (not (= ~fast_clk_edge~0 1))) (.cse15 (not (= 2 ~p_dw_st~0))) (.cse20 (not (<= ~t~0 0))) (.cse19 (not (<= ~p_num_write~0 0))) (.cse0 (= ~q_read_ev~0 1)) (.cse1 (not (= ~q_free~0 0))) (.cse18 (not (= ~p_dw_pc~0 1))) (.cse2 (not (= ~slow_clk_edge~0 2))) (.cse3 (not (= ~c_dr_pc~0 1))) (.cse4 (not (<= ~c_num_read~0 0))) (.cse5 (= ~q_read_ev~0 0)) (.cse7 (not (<= 0 ~c_num_read~0))) (.cse8 (not (<= 0 ~p_num_write~0))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse10 (not (<= 1 ~p_dw_pc~0))) (.cse11 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse16 (not (<= 0 ~t~0))) (.cse12 (not (<= ~p_num_write~0 1))) (.cse17 (not (= 2 ~fast_clk_edge~0))) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (or (not (<= 1 ~t~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12 .cse17 .cse14 .cse15) (or .cse18 .cse2 .cse3 .cse4 .cse5 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse14) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~slow_clk_edge~0 1)) .cse10 .cse11 .cse16 .cse12 .cse13 .cse14 .cse15) (or (not (<= ~c_dr_pc~0 0)) .cse20 (not (= ~p_dw_st~0 0)) (not (<= ~p_dw_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse2 .cse4 .cse5 .cse7 .cse19 .cse8 .cse9 .cse11 .cse16 .cse17 .cse14) (or .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12 .cse17 .cse14))) [2022-12-14 06:37:46,508 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2022-12-14 06:37:46,508 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2022-12-14 06:37:46,508 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2022-12-14 06:37:46,508 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 62 90) the Hoare annotation is: true [2022-12-14 06:37:46,508 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2022-12-14 06:37:46,508 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2022-12-14 06:37:46,508 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-12-14 06:37:46,508 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2022-12-14 06:37:46,510 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:37:46,512 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 06:37:46,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 06:37:46 BoogieIcfgContainer [2022-12-14 06:37:46,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 06:37:46,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 06:37:46,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 06:37:46,541 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 06:37:46,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:33:50" (3/4) ... [2022-12-14 06:37:46,544 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 06:37:46,548 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-12-14 06:37:46,548 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-12-14 06:37:46,548 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-12-14 06:37:46,548 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-12-14 06:37:46,548 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-12-14 06:37:46,548 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-12-14 06:37:46,548 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-12-14 06:37:46,548 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-12-14 06:37:46,553 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2022-12-14 06:37:46,553 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-12-14 06:37:46,553 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-14 06:37:46,554 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 06:37:46,571 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && (((\old(q_read_ev) == 1 || q_free == 1) || !(q_read_ev == 0)) || \old(q_read_ev) == 0)) && c_num_read <= 0) && p_dw_pc <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && slow_clk_edge == 2) && p_dw_st == 0) && t <= 0) && p_dw_i == 1) && 2 == fast_clk_edge) && c_dr_pc <= 0) && c_dr_st == p_dw_st) && 0 <= c_num_read [2022-12-14 06:37:46,571 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(q_read_ev) == 1 || !(q_free == 0)) || !(p_dw_pc == 1)) || !(slow_clk_edge == 2)) || \old(q_read_ev) == q_read_ev) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(1 <= p_dw_pc)) || !(0 <= t)) || !(p_num_write <= 1)) || !(2 == fast_clk_edge)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) && ((((((((((((((((!(c_dr_pc <= 0) || !(t <= 0)) || !(p_dw_pc <= 0)) || \old(q_read_ev) == 1) || !(c_dr_st == 0)) || !(slow_clk_edge == 2)) || \old(q_read_ev) == q_read_ev) || !(c_dr_st == p_dw_st)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(0 <= t)) || !(2 == fast_clk_edge)) || \old(q_read_ev) == 0) || !(1 == c_dr_i))) && ((((((((((((((\old(q_read_ev) == 1 || !(p_dw_pc == 1)) || !(slow_clk_edge == 2)) || \old(q_read_ev) == q_read_ev) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(1 <= p_dw_pc)) || !(0 <= t)) || !(2 == fast_clk_edge)) || \old(q_read_ev) == 0) || !(1 == c_dr_i))) && ((((((((((((((((\old(q_read_ev) == 1 || !(q_free == 0)) || !(slow_clk_edge == 2)) || \old(q_read_ev) == q_read_ev) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(2 == p_dw_pc)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(1 <= p_dw_pc)) || !(0 <= t)) || !(p_num_write <= 1)) || !(2 == fast_clk_edge)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) || !(2 == p_dw_st)) [2022-12-14 06:37:46,573 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && (!(p_dw_st == 0) || \result == 1)) && 2 == fast_clk_edge) && 0 <= c_num_read) || (((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_dr_st == 2) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && !(p_dw_pc == 1)) && t <= 0) && p_dw_i == 1) && !(2 == p_dw_pc)) && (!(p_dw_st == 0) || \result == 1)) && 2 == fast_clk_edge) && tmp___1 == 1) && 0 <= c_num_read)) || (((((((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && !(p_dw_pc == 1)) && t <= 0) && p_dw_i == 1) && !(2 == p_dw_pc)) && (!(p_dw_st == 0) || \result == 1)) && 2 == fast_clk_edge) && c_dr_pc <= 0) && tmp___1 == 1) && 0 <= c_num_read) [2022-12-14 06:37:46,573 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 1 <= c_dr_pc) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && (!(p_dw_st == 0) || \result == 1)) && 2 == fast_clk_edge) && 0 <= c_num_read) || ((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && (!(p_dw_st == 0) || \result == 1)) && 2 == fast_clk_edge) && 0 <= c_num_read) [2022-12-14 06:37:46,573 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 1 <= c_dr_pc) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && 1 <= p_dw_pc) && !(q_read_ev == 0)) && slow_clk_edge == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && (!(p_dw_st == 0) || \result == 1)) && 2 == fast_clk_edge) && 0 <= c_num_read [2022-12-14 06:37:46,573 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 <= t && !(q_read_ev == 1)) && (!(c_dr_st == 0) || \result == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) || ((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && (!(c_dr_st == 0) || \result == 1)) && c_num_read <= 0) && p_dw_pc <= 0) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_st == 0) && t <= 0) && p_dw_i == 1) && 2 == fast_clk_edge) && tmp___1 == 1) && 0 <= c_num_read)) || ((((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && !(tmp___1 == 0)) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && (!(c_dr_st == 0) || \result == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_pc == 1) && t <= 0) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && tmp___1 == 1) && 0 <= c_num_read) [2022-12-14 06:37:46,573 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 <= t && !(q_read_ev == 1)) && (!(c_dr_st == 0) || \result == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) || ((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && (!(c_dr_st == 0) || \result == 1)) && c_num_read <= 0) && p_dw_pc <= 0) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_st == 0) && t <= 0) && p_dw_i == 1) && 2 == fast_clk_edge) && tmp___1 == 1) && 0 <= c_num_read)) || ((((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && !(tmp___1 == 0)) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && (!(c_dr_st == 0) || \result == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_pc == 1) && t <= 0) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && c_dr_pc <= 0) && tmp___1 == 1) && 0 <= c_num_read) [2022-12-14 06:37:46,591 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 06:37:46,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 06:37:46,591 INFO L158 Benchmark]: Toolchain (without parser) took 237357.35ms. Allocated memory was 136.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 103.5MB in the beginning and 802.6MB in the end (delta: -699.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-12-14 06:37:46,591 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:37:46,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.82ms. Allocated memory is still 136.3MB. Free memory was 103.1MB in the beginning and 89.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 06:37:46,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.82ms. Allocated memory is still 136.3MB. Free memory was 89.7MB in the beginning and 87.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 06:37:46,592 INFO L158 Benchmark]: Boogie Preprocessor took 26.03ms. Allocated memory is still 136.3MB. Free memory was 87.5MB in the beginning and 86.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 06:37:46,592 INFO L158 Benchmark]: RCFGBuilder took 479.08ms. Allocated memory is still 136.3MB. Free memory was 85.9MB in the beginning and 54.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-12-14 06:37:46,592 INFO L158 Benchmark]: TraceAbstraction took 236514.17ms. Allocated memory was 136.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 53.7MB in the beginning and 810.1MB in the end (delta: -756.4MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-12-14 06:37:46,592 INFO L158 Benchmark]: Witness Printer took 50.10ms. Allocated memory is still 1.9GB. Free memory was 810.1MB in the beginning and 802.6MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 06:37:46,593 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.14ms. Allocated memory is still 136.3MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.82ms. Allocated memory is still 136.3MB. Free memory was 103.1MB in the beginning and 89.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.82ms. Allocated memory is still 136.3MB. Free memory was 89.7MB in the beginning and 87.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.03ms. Allocated memory is still 136.3MB. Free memory was 87.5MB in the beginning and 86.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 479.08ms. Allocated memory is still 136.3MB. Free memory was 85.9MB in the beginning and 54.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 236514.17ms. Allocated memory was 136.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 53.7MB in the beginning and 810.1MB in the end (delta: -756.4MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 50.10ms. Allocated memory is still 1.9GB. Free memory was 810.1MB in the beginning and 802.6MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 92 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 236.4s, OverallIterations: 24, TraceHistogramMax: 85, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 65.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 55.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17219 SdHoareTripleChecker+Valid, 15.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17190 mSDsluCounter, 12881 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9783 mSDsCounter, 10769 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35296 IncrementalHoareTripleChecker+Invalid, 46065 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10769 mSolverCounterUnsat, 3098 mSDtfsCounter, 35296 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14484 GetRequests, 12438 SyntacticMatches, 284 SemanticMatches, 1762 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647247 ImplicationChecksByTransitivity, 83.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18871occurred in iteration=21, InterpolantAutomatonStates: 1433, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 27270 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 21179 PreInvPairs, 21915 NumberOfFragments, 8579 HoareAnnotationTreeSize, 21179 FomulaSimplifications, 60660 FormulaSimplificationTreeSizeReduction, 20.6s HoareSimplificationTime, 41 FomulaSimplificationsInter, 513688 FormulaSimplificationTreeSizeReductionInter, 34.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 15653 NumberOfCodeBlocks, 13918 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 18116 ConstructedInterpolants, 0 QuantifiedInterpolants, 26207 SizeOfPredicates, 15 NumberOfNonLiveVariables, 17778 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 43 InterpolantComputations, 21 PerfectInterpolantSequences, 196202/204126 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 6 specifications checked. All of them hold - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 1 <= c_dr_pc) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && 1 <= p_dw_pc) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) || ((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 1 <= c_dr_pc) && 0 <= p_num_write) && 1 == c_dr_i) && 1 <= p_dw_pc) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_pc == 1) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 1 <= c_dr_pc) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && 1 <= p_dw_pc) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 <= t && !(q_read_ev == 1)) && (!(c_dr_st == 0) || \result == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) || ((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && (!(c_dr_st == 0) || \result == 1)) && c_num_read <= 0) && p_dw_pc <= 0) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_st == 0) && t <= 0) && p_dw_i == 1) && 2 == fast_clk_edge) && tmp___1 == 1) && 0 <= c_num_read)) || ((((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && !(tmp___1 == 0)) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && (!(c_dr_st == 0) || \result == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_pc == 1) && t <= 0) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && c_dr_pc <= 0) && tmp___1 == 1) && 0 <= c_num_read) - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && (((\old(q_read_ev) == 1 || q_free == 1) || !(q_read_ev == 0)) || \old(q_read_ev) == 0)) && c_num_read <= 0) && p_dw_pc <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && slow_clk_edge == 2) && p_dw_st == 0) && t <= 0) && p_dw_i == 1) && 2 == fast_clk_edge) && c_dr_pc <= 0) && c_dr_st == p_dw_st) && 0 <= c_num_read - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_dr_st == 0 && 0 <= t) && !(q_read_ev == 1)) && tmp == 0) && slow_clk_edge == 1) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && p_dw_pc == 1) && t <= 0) && fast_clk_edge == 1) && p_dw_i == 1) && 0 <= c_num_read) || (((((((((((((p_num_write <= 0 && !(q_read_ev == 1)) && tmp == 0) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_pc == 1) && 1 <= t) && fast_clk_edge == 1) && p_dw_i == 1) && 0 <= c_num_read)) || (((((((((((((((!(q_read_ev == 1) && tmp == 0) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && 1 <= t) && fast_clk_edge == 1) && 2 == p_dw_st) && p_dw_i == 1) && 0 <= c_num_read)) || (((((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(q_read_ev == 1)) && tmp == 0) && slow_clk_edge == 1) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && t <= 0) && fast_clk_edge == 1) && p_dw_i == 1) && 0 <= c_num_read)) || ((((((((((((((!(q_read_ev == 1) && tmp == 0) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && 1 <= t) && fast_clk_edge == 1) && p_dw_i == 1) && 0 <= c_num_read)) || (((((((((((((((((c_dr_st == 0 && 0 <= t) && !(q_read_ev == 1)) && tmp == 0) && slow_clk_edge == 1) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && t <= 0) && fast_clk_edge == 1) && 2 == p_dw_st) && p_dw_i == 1) && 0 <= c_num_read) - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 1 <= c_dr_pc) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && (!(p_dw_st == 0) || \result == 1)) && 2 == fast_clk_edge) && 0 <= c_num_read) || ((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && (!(p_dw_st == 0) || \result == 1)) && 2 == fast_clk_edge) && 0 <= c_num_read) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(1 <= t) || q_read_ev == 1) || !(q_free == 0)) || !(slow_clk_edge == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(2 == p_dw_pc)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(1 <= p_dw_pc)) || __retres1 == 0) || !(p_num_write <= 1)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i)) || !(2 == p_dw_st)) && ((((((((((((((((q_read_ev == 1 || !(q_free == 0)) || !(slow_clk_edge == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(2 == p_dw_pc)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(1 <= p_dw_pc)) || __retres1 == 0) || !(0 <= t)) || !(p_num_write <= 1)) || !(2 == fast_clk_edge)) || !(1 == c_dr_i)) || !(2 == p_dw_st))) && (((((((((((((!(p_dw_pc == 1) || !(slow_clk_edge == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(1 <= p_dw_pc)) || __retres1 == 0) || !(0 <= t)) || !(2 == fast_clk_edge)) || !(1 == c_dr_i))) && (((((((((((((((((!(t <= 0) || q_read_ev == 1) || !(q_free == 0)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(2 == p_dw_pc)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(slow_clk_edge == 1)) || !(1 <= p_dw_pc)) || __retres1 == 0) || !(0 <= t)) || !(p_num_write <= 1)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i)) || !(2 == p_dw_st))) && (((((((((((((((!(c_dr_pc <= 0) || !(t <= 0)) || !(p_dw_st == 0)) || !(p_dw_pc <= 0)) || !(c_dr_st == 0)) || !(slow_clk_edge == 2)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || __retres1 == 0) || !(0 <= t)) || !(2 == fast_clk_edge)) || !(1 == c_dr_i))) && (((((((((((((((q_read_ev == 1 || !(q_free == 0)) || !(p_dw_pc == 1)) || !(slow_clk_edge == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(1 <= p_dw_pc)) || __retres1 == 0) || !(0 <= t)) || !(p_num_write <= 1)) || !(2 == fast_clk_edge)) || !(1 == c_dr_i)) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 1 <= c_dr_pc) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && 1 <= p_dw_pc) && !(q_read_ev == 0)) && slow_clk_edge == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && (!(p_dw_st == 0) || \result == 1)) && 2 == fast_clk_edge) && 0 <= c_num_read - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) || (((((((((((((((!(q_read_ev == 1) && tmp == 0) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && 1 <= t) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || (((((((((((((((c_dr_st == 0 && 0 <= t) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || (((((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && p_dw_pc <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_st == 0) && t <= 0) && p_dw_i == 1) && 2 == fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || ((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_pc == 1) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_dr_st == 0 || __retres1 == 0) || !(p_dw_pc == 1)) || !(slow_clk_edge == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(0 <= t)) || !(2 == fast_clk_edge)) || !(1 == c_dr_i)) || !(2 == p_dw_st)) && (((((((((((((((__retres1 == 0 || q_read_ev == 1) || !(q_free == 0)) || !(slow_clk_edge == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(2 == p_dw_pc)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(0 <= t)) || !(p_num_write <= 1)) || !(2 == fast_clk_edge)) || !(1 == c_dr_i)) || !(2 == p_dw_st))) && ((((((((((((((((__retres1 == 1 || !(t <= 0)) || q_read_ev == 1) || !(q_free == 0)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(2 == p_dw_pc)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(slow_clk_edge == 1)) || !(0 <= t)) || !(p_num_write <= 1)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i)) || !(2 == p_dw_st))) && (((((((((((((!(1 <= t) || __retres1 == 0) || q_read_ev == 1) || !(p_dw_pc == 1)) || !(slow_clk_edge == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && (((((((((((((((__retres1 == 1 || !(t <= 0)) || q_read_ev == 1) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(slow_clk_edge == 1)) || !(0 <= t)) || !(p_num_write <= 1)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && (((((((((((((((!(1 <= t) || __retres1 == 0) || q_read_ev == 1) || !(q_free == 0)) || !(slow_clk_edge == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(2 == p_dw_pc)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(p_num_write <= 1)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i)) || !(2 == p_dw_st))) && (((((((((((((((!(c_dr_pc <= 0) || !(t <= 0)) || !(p_dw_st == 0)) || !(p_dw_pc <= 0)) || __retres1 == 0) || !(c_dr_st == 0)) || !(slow_clk_edge == 2)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(0 <= t)) || !(2 == fast_clk_edge)) || !(1 == c_dr_i))) && ((((((((((((((((c_dr_st == 0 || __retres1 == 0) || q_read_ev == 1) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(slow_clk_edge == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(0 <= t)) || !(p_num_write <= 1)) || !(2 == fast_clk_edge)) || !(1 == c_dr_i)) || !(2 == p_dw_st))) && ((((((((((((((__retres1 == 1 || !(t <= 0)) || q_read_ev == 1) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(slow_clk_edge == 1)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && ((((((((((((!(1 <= t) || __retres1 == 0) || !(p_dw_pc == 1)) || !(slow_clk_edge == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || q_read_ev == 0) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(2 == fast_clk_edge)) || !(1 == c_dr_i)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 <= t && !(q_read_ev == 1)) && (!(c_dr_st == 0) || \result == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) || ((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && (!(c_dr_st == 0) || \result == 1)) && c_num_read <= 0) && p_dw_pc <= 0) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_st == 0) && t <= 0) && p_dw_i == 1) && 2 == fast_clk_edge) && tmp___1 == 1) && 0 <= c_num_read)) || ((((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && !(tmp___1 == 0)) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && (!(c_dr_st == 0) || \result == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_pc == 1) && t <= 0) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && tmp___1 == 1) && 0 <= c_num_read) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(q_read_ev) == 1 || !(q_free == 0)) || !(p_dw_pc == 1)) || !(slow_clk_edge == 2)) || \old(q_read_ev) == q_read_ev) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(1 <= p_dw_pc)) || !(0 <= t)) || !(p_num_write <= 1)) || !(2 == fast_clk_edge)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) && ((((((((((((((((!(c_dr_pc <= 0) || !(t <= 0)) || !(p_dw_pc <= 0)) || \old(q_read_ev) == 1) || !(c_dr_st == 0)) || !(slow_clk_edge == 2)) || \old(q_read_ev) == q_read_ev) || !(c_dr_st == p_dw_st)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(0 <= t)) || !(2 == fast_clk_edge)) || \old(q_read_ev) == 0) || !(1 == c_dr_i))) && ((((((((((((((\old(q_read_ev) == 1 || !(p_dw_pc == 1)) || !(slow_clk_edge == 2)) || \old(q_read_ev) == q_read_ev) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(1 <= p_dw_pc)) || !(0 <= t)) || !(2 == fast_clk_edge)) || \old(q_read_ev) == 0) || !(1 == c_dr_i))) && ((((((((((((((((\old(q_read_ev) == 1 || !(q_free == 0)) || !(slow_clk_edge == 2)) || \old(q_read_ev) == q_read_ev) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(2 == p_dw_pc)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(p_dw_i == 1)) || !(1 <= p_dw_pc)) || !(0 <= t)) || !(p_num_write <= 1)) || !(2 == fast_clk_edge)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) || !(2 == p_dw_st)) - InvariantResult [Line: 463]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) || (((((((((((((((!(q_read_ev == 1) && tmp == 0) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && 1 <= t) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || (((((((((((((((c_dr_st == 0 && 0 <= t) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_pc == 1) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 1 <= c_dr_pc) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && p_num_write <= 1) && slow_clk_edge == 2) && !(tmp___1 == 0)) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) || ((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 1 <= c_dr_pc) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_pc == 1) && t <= 0) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && c_dr_pc <= 0) && tmp___1 == 1) && 0 <= c_num_read)) || (((((((((((((((c_dr_st == 0 && 0 <= t) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_dr_st == 2) && c_num_read <= 0) && p_dw_pc <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_st == 0) && t <= 0) && p_dw_i == 1) && 2 == fast_clk_edge) && tmp___1 == 1) && 0 <= c_num_read)) || (((((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && p_dw_pc <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_st == 0) && t <= 0) && p_dw_i == 1) && 2 == fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || (((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 1 <= c_dr_pc) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_pc == 1) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || (((((((((((((((!(q_read_ev == 1) && c_num_read <= 0) && 1 <= c_dr_pc) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && p_num_write <= 1) && slow_clk_edge == 2) && 1 <= t) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && (!(p_dw_st == 0) || \result == 1)) && 2 == fast_clk_edge) && 0 <= c_num_read) || (((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_dr_st == 2) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && !(p_dw_pc == 1)) && t <= 0) && p_dw_i == 1) && !(2 == p_dw_pc)) && (!(p_dw_st == 0) || \result == 1)) && 2 == fast_clk_edge) && tmp___1 == 1) && 0 <= c_num_read)) || (((((((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && !(p_dw_pc == 1)) && t <= 0) && p_dw_i == 1) && !(2 == p_dw_pc)) && (!(p_dw_st == 0) || \result == 1)) && 2 == fast_clk_edge) && c_dr_pc <= 0) && tmp___1 == 1) && 0 <= c_num_read) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && !(tmp___1 == 0)) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read) || ((((((((((((((((0 <= t && !(q_read_ev == 1)) && c_num_read <= 0) && 1 <= c_dr_pc) && 0 <= p_num_write) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && p_num_write <= 1) && slow_clk_edge == 2) && !(tmp___1 == 0)) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(q_read_ev == 1)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && slow_clk_edge == 2) && p_dw_pc == 1) && t <= 0) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && c_dr_pc <= 0) && tmp___1 == 1) && 0 <= c_num_read)) || ((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && c_dr_st == 2) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_pc == 1) && t <= 0) && 2 == p_dw_st) && p_dw_i == 1) && 2 == fast_clk_edge) && tmp___1 == 1) && 0 <= c_num_read) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 <= t && p_num_write <= 0) && !(q_read_ev == 1)) && tmp == 0) && slow_clk_edge == 1) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && t <= 0) && fast_clk_edge == 1) && p_dw_i == 1) && 0 <= c_num_read) || (((((((((((((p_num_write <= 0 && !(q_read_ev == 1)) && tmp == 0) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && slow_clk_edge == 2) && p_dw_pc == 1) && 1 <= t) && fast_clk_edge == 1) && p_dw_i == 1) && 0 <= c_num_read)) || (((((((((((((((0 <= t && !(q_read_ev == 1)) && tmp == 0) && slow_clk_edge == 1) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && p_dw_pc == 1) && t <= 0) && fast_clk_edge == 1) && p_dw_i == 1) && 0 <= c_num_read)) || (((((((((((((((!(q_read_ev == 1) && tmp == 0) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && 1 <= t) && fast_clk_edge == 1) && 2 == p_dw_st) && p_dw_i == 1) && 0 <= c_num_read)) || ((((((((((((((!(q_read_ev == 1) && tmp == 0) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_num_write <= 1) && slow_clk_edge == 2) && p_dw_pc == 1) && 1 <= t) && fast_clk_edge == 1) && p_dw_i == 1) && 0 <= c_num_read)) || ((((((((((((((((0 <= t && !(q_read_ev == 1)) && tmp == 0) && slow_clk_edge == 1) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && 2 == p_dw_pc) && c_dr_pc == 1) && p_num_write <= 1) && t <= 0) && fast_clk_edge == 1) && 2 == p_dw_st) && p_dw_i == 1) && 0 <= c_num_read) RESULT: Ultimate proved your program to be correct! [2022-12-14 06:37:46,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068d3857-b3ef-48b4-9200-92a01e13ebfd/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE