./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6d225bacde2ff4b43f974edb4824451ea41bcc5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:23:34,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:23:34,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:23:34,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:23:34,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:23:34,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:23:34,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:23:34,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:23:34,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:23:34,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:23:34,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:23:34,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:23:34,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:23:34,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:23:34,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:23:34,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:23:34,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:23:34,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:23:34,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:23:34,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:23:34,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:23:34,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:23:34,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:23:34,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:23:34,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:23:35,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:23:35,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:23:35,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:23:35,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:23:35,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:23:35,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:23:35,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:23:35,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:23:35,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:23:35,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:23:35,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:23:35,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:23:35,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:23:35,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:23:35,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:23:35,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:23:35,022 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:23:35,085 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:23:35,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:23:35,087 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:23:35,087 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:23:35,088 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:23:35,088 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:23:35,088 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:23:35,089 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:23:35,089 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:23:35,089 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:23:35,091 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:23:35,091 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:23:35,092 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:23:35,092 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:23:35,092 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:23:35,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:23:35,094 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:23:35,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:23:35,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:23:35,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:23:35,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:23:35,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:23:35,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:23:35,096 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:23:35,096 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:23:35,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:23:35,096 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:23:35,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:23:35,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:23:35,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:23:35,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:23:35,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:23:35,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:23:35,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:23:35,099 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:23:35,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:23:35,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:23:35,100 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:23:35,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:23:35,100 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/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_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> e6d225bacde2ff4b43f974edb4824451ea41bcc5 [2021-10-11 02:23:35,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:23:35,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:23:35,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:23:35,477 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:23:35,478 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:23:35,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-10-11 02:23:35,560 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/data/ea7189cf6/6be5abcae2b54322b5565a7fb03eed53/FLAGd10fff288 [2021-10-11 02:23:36,211 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:23:36,214 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-10-11 02:23:36,242 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/data/ea7189cf6/6be5abcae2b54322b5565a7fb03eed53/FLAGd10fff288 [2021-10-11 02:23:36,469 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/data/ea7189cf6/6be5abcae2b54322b5565a7fb03eed53 [2021-10-11 02:23:36,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:23:36,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:23:36,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:23:36,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:23:36,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:23:36,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:23:36" (1/1) ... [2021-10-11 02:23:36,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413b316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36, skipping insertion in model container [2021-10-11 02:23:36,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:23:36" (1/1) ... [2021-10-11 02:23:36,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:23:36,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:23:36,741 WARN L226 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_2a6b055d-a829-4e47-a326-5824515752dd/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[338,351] [2021-10-11 02:23:36,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:23:36,809 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:23:36,824 WARN L226 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_2a6b055d-a829-4e47-a326-5824515752dd/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[338,351] [2021-10-11 02:23:36,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:23:36,898 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:23:36,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36 WrapperNode [2021-10-11 02:23:36,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:23:36,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:23:36,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:23:36,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:23:36,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36" (1/1) ... [2021-10-11 02:23:36,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36" (1/1) ... [2021-10-11 02:23:36,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:23:36,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:23:36,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:23:36,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:23:36,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36" (1/1) ... [2021-10-11 02:23:36,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36" (1/1) ... [2021-10-11 02:23:36,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36" (1/1) ... [2021-10-11 02:23:36,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36" (1/1) ... [2021-10-11 02:23:36,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36" (1/1) ... [2021-10-11 02:23:36,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36" (1/1) ... [2021-10-11 02:23:37,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36" (1/1) ... [2021-10-11 02:23:37,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:23:37,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:23:37,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:23:37,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:23:37,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:23:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:23:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:23:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:23:37,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:23:38,459 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:23:38,460 INFO L299 CfgBuilder]: Removed 58 assume(true) statements. [2021-10-11 02:23:38,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:38 BoogieIcfgContainer [2021-10-11 02:23:38,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:23:38,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:23:38,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:23:38,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:23:38,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:23:36" (1/3) ... [2021-10-11 02:23:38,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4419cdae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:23:38, skipping insertion in model container [2021-10-11 02:23:38,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:36" (2/3) ... [2021-10-11 02:23:38,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4419cdae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:23:38, skipping insertion in model container [2021-10-11 02:23:38,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:38" (3/3) ... [2021-10-11 02:23:38,478 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2021-10-11 02:23:38,499 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:23:38,503 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 02:23:38,516 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-11 02:23:38,560 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:23:38,562 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:23:38,563 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:23:38,563 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:23:38,563 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:23:38,563 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:23:38,564 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:23:38,564 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:23:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2021-10-11 02:23:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 02:23:38,601 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:38,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:38,602 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:38,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:38,610 INFO L82 PathProgramCache]: Analyzing trace with hash 371937674, now seen corresponding path program 1 times [2021-10-11 02:23:38,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:38,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574254765] [2021-10-11 02:23:38,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:38,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574254765] [2021-10-11 02:23:38,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:38,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:23:38,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134026703] [2021-10-11 02:23:38,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:38,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:38,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:38,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:38,840 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2021-10-11 02:23:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:38,900 INFO L93 Difference]: Finished difference Result 119 states and 187 transitions. [2021-10-11 02:23:38,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:38,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2021-10-11 02:23:38,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:38,916 INFO L225 Difference]: With dead ends: 119 [2021-10-11 02:23:38,916 INFO L226 Difference]: Without dead ends: 73 [2021-10-11 02:23:38,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-10-11 02:23:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2021-10-11 02:23:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-10-11 02:23:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2021-10-11 02:23:38,968 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 18 [2021-10-11 02:23:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:38,969 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2021-10-11 02:23:38,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2021-10-11 02:23:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 02:23:38,971 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:38,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:38,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:23:38,972 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:38,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1808034101, now seen corresponding path program 1 times [2021-10-11 02:23:38,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:38,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501259535] [2021-10-11 02:23:38,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:39,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501259535] [2021-10-11 02:23:39,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:39,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:23:39,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990886981] [2021-10-11 02:23:39,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:39,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:39,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:39,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:39,060 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 3 states. [2021-10-11 02:23:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:39,125 INFO L93 Difference]: Finished difference Result 180 states and 262 transitions. [2021-10-11 02:23:39,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:39,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2021-10-11 02:23:39,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:39,132 INFO L225 Difference]: With dead ends: 180 [2021-10-11 02:23:39,133 INFO L226 Difference]: Without dead ends: 119 [2021-10-11 02:23:39,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-10-11 02:23:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2021-10-11 02:23:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-10-11 02:23:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 149 transitions. [2021-10-11 02:23:39,171 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 149 transitions. Word has length 18 [2021-10-11 02:23:39,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:39,171 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 149 transitions. [2021-10-11 02:23:39,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 149 transitions. [2021-10-11 02:23:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 02:23:39,173 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:39,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:39,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:23:39,173 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:39,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:39,174 INFO L82 PathProgramCache]: Analyzing trace with hash -437124654, now seen corresponding path program 1 times [2021-10-11 02:23:39,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:39,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899463122] [2021-10-11 02:23:39,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:39,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899463122] [2021-10-11 02:23:39,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:39,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:23:39,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249883024] [2021-10-11 02:23:39,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:39,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:39,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:39,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:39,303 INFO L87 Difference]: Start difference. First operand 105 states and 149 transitions. Second operand 3 states. [2021-10-11 02:23:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:39,357 INFO L93 Difference]: Finished difference Result 215 states and 313 transitions. [2021-10-11 02:23:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:39,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2021-10-11 02:23:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:39,361 INFO L225 Difference]: With dead ends: 215 [2021-10-11 02:23:39,364 INFO L226 Difference]: Without dead ends: 135 [2021-10-11 02:23:39,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-10-11 02:23:39,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2021-10-11 02:23:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2021-10-11 02:23:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2021-10-11 02:23:39,382 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 19 [2021-10-11 02:23:39,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:39,384 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2021-10-11 02:23:39,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2021-10-11 02:23:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 02:23:39,387 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:39,388 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:39,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:23:39,389 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:39,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:39,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1176531276, now seen corresponding path program 1 times [2021-10-11 02:23:39,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:39,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651670588] [2021-10-11 02:23:39,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:39,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651670588] [2021-10-11 02:23:39,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:39,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:39,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812498865] [2021-10-11 02:23:39,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:39,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:39,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:39,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:39,523 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand 3 states. [2021-10-11 02:23:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:39,585 INFO L93 Difference]: Finished difference Result 267 states and 391 transitions. [2021-10-11 02:23:39,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:39,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2021-10-11 02:23:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:39,589 INFO L225 Difference]: With dead ends: 267 [2021-10-11 02:23:39,590 INFO L226 Difference]: Without dead ends: 184 [2021-10-11 02:23:39,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-10-11 02:23:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 158. [2021-10-11 02:23:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2021-10-11 02:23:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 229 transitions. [2021-10-11 02:23:39,635 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 229 transitions. Word has length 26 [2021-10-11 02:23:39,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:39,636 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 229 transitions. [2021-10-11 02:23:39,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 229 transitions. [2021-10-11 02:23:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 02:23:39,640 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:39,640 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:39,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:23:39,641 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:39,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:39,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1217802233, now seen corresponding path program 1 times [2021-10-11 02:23:39,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:39,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923208496] [2021-10-11 02:23:39,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:39,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:39,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923208496] [2021-10-11 02:23:39,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:39,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:39,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085540030] [2021-10-11 02:23:39,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:39,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:39,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:39,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:39,751 INFO L87 Difference]: Start difference. First operand 158 states and 229 transitions. Second operand 4 states. [2021-10-11 02:23:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:39,789 INFO L93 Difference]: Finished difference Result 196 states and 285 transitions. [2021-10-11 02:23:39,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:39,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2021-10-11 02:23:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:39,792 INFO L225 Difference]: With dead ends: 196 [2021-10-11 02:23:39,793 INFO L226 Difference]: Without dead ends: 194 [2021-10-11 02:23:39,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-10-11 02:23:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 156. [2021-10-11 02:23:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2021-10-11 02:23:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 226 transitions. [2021-10-11 02:23:39,829 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 226 transitions. Word has length 26 [2021-10-11 02:23:39,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:39,829 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 226 transitions. [2021-10-11 02:23:39,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 226 transitions. [2021-10-11 02:23:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 02:23:39,831 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:39,831 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:39,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:23:39,831 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:39,832 INFO L82 PathProgramCache]: Analyzing trace with hash -902848010, now seen corresponding path program 1 times [2021-10-11 02:23:39,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:39,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681191607] [2021-10-11 02:23:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:39,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681191607] [2021-10-11 02:23:39,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106216773] [2021-10-11 02:23:39,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:40,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-11 02:23:40,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:40,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:40,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1075042757] [2021-10-11 02:23:40,438 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-10-11 02:23:40,439 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:40,449 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:23:40,458 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:23:40,459 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:23:41,312 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 198 [2021-10-11 02:23:41,907 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 219 [2021-10-11 02:23:41,910 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:23:42,261 WARN L197 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2021-10-11 02:23:42,662 WARN L197 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2021-10-11 02:23:43,024 WARN L197 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2021-10-11 02:23:43,431 WARN L197 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2021-10-11 02:23:43,834 WARN L197 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 96 [2021-10-11 02:23:44,272 WARN L197 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 96 [2021-10-11 02:23:44,800 WARN L197 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 102 [2021-10-11 02:23:45,407 WARN L197 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 108 [2021-10-11 02:23:45,917 WARN L197 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 110 [2021-10-11 02:23:47,415 WARN L197 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 217 DAG size of output: 119 [2021-10-11 02:23:48,377 WARN L197 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 119 [2021-10-11 02:23:48,794 WARN L197 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 120 [2021-10-11 02:23:49,269 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 122 [2021-10-11 02:23:49,912 WARN L197 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 124 [2021-10-11 02:23:49,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:49,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4, 4, 3] total 20 [2021-10-11 02:23:49,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815535215] [2021-10-11 02:23:49,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-10-11 02:23:49,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:49,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-11 02:23:49,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:23:49,982 INFO L87 Difference]: Start difference. First operand 156 states and 226 transitions. Second operand 16 states. [2021-10-11 02:23:50,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:50,773 INFO L93 Difference]: Finished difference Result 294 states and 434 transitions. [2021-10-11 02:23:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-11 02:23:50,774 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2021-10-11 02:23:50,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:50,775 INFO L225 Difference]: With dead ends: 294 [2021-10-11 02:23:50,775 INFO L226 Difference]: Without dead ends: 145 [2021-10-11 02:23:50,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 12 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:23:50,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-10-11 02:23:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2021-10-11 02:23:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2021-10-11 02:23:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 197 transitions. [2021-10-11 02:23:50,794 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 197 transitions. Word has length 27 [2021-10-11 02:23:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:50,794 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 197 transitions. [2021-10-11 02:23:50,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-10-11 02:23:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 197 transitions. [2021-10-11 02:23:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 02:23:50,796 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:50,796 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:51,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-10-11 02:23:51,021 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:51,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:51,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2076385265, now seen corresponding path program 1 times [2021-10-11 02:23:51,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:51,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717827715] [2021-10-11 02:23:51,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:51,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717827715] [2021-10-11 02:23:51,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:51,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:51,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813873620] [2021-10-11 02:23:51,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:51,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:51,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:51,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:51,090 INFO L87 Difference]: Start difference. First operand 139 states and 197 transitions. Second operand 3 states. [2021-10-11 02:23:51,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:51,117 INFO L93 Difference]: Finished difference Result 248 states and 359 transitions. [2021-10-11 02:23:51,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:51,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-10-11 02:23:51,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:51,119 INFO L225 Difference]: With dead ends: 248 [2021-10-11 02:23:51,119 INFO L226 Difference]: Without dead ends: 141 [2021-10-11 02:23:51,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:51,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-10-11 02:23:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2021-10-11 02:23:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2021-10-11 02:23:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 183 transitions. [2021-10-11 02:23:51,135 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 183 transitions. Word has length 39 [2021-10-11 02:23:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:51,135 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 183 transitions. [2021-10-11 02:23:51,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 183 transitions. [2021-10-11 02:23:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 02:23:51,137 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:51,137 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:51,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 02:23:51,138 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:51,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:51,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1041977712, now seen corresponding path program 1 times [2021-10-11 02:23:51,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:51,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902400303] [2021-10-11 02:23:51,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:51,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902400303] [2021-10-11 02:23:51,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:51,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:51,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478466154] [2021-10-11 02:23:51,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:51,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:51,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:51,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:51,188 INFO L87 Difference]: Start difference. First operand 135 states and 183 transitions. Second operand 5 states. [2021-10-11 02:23:51,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:51,274 INFO L93 Difference]: Finished difference Result 247 states and 343 transitions. [2021-10-11 02:23:51,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:23:51,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2021-10-11 02:23:51,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:51,276 INFO L225 Difference]: With dead ends: 247 [2021-10-11 02:23:51,276 INFO L226 Difference]: Without dead ends: 144 [2021-10-11 02:23:51,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:51,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-10-11 02:23:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2021-10-11 02:23:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2021-10-11 02:23:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 180 transitions. [2021-10-11 02:23:51,293 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 180 transitions. Word has length 39 [2021-10-11 02:23:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:51,294 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 180 transitions. [2021-10-11 02:23:51,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 180 transitions. [2021-10-11 02:23:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-11 02:23:51,295 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:51,296 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 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] [2021-10-11 02:23:51,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-11 02:23:51,296 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:51,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:51,297 INFO L82 PathProgramCache]: Analyzing trace with hash -831470853, now seen corresponding path program 1 times [2021-10-11 02:23:51,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:51,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707366857] [2021-10-11 02:23:51,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-11 02:23:51,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707366857] [2021-10-11 02:23:51,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:51,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:51,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465626757] [2021-10-11 02:23:51,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:51,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:51,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:51,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:51,358 INFO L87 Difference]: Start difference. First operand 137 states and 180 transitions. Second operand 5 states. [2021-10-11 02:23:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:51,460 INFO L93 Difference]: Finished difference Result 362 states and 483 transitions. [2021-10-11 02:23:51,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:23:51,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2021-10-11 02:23:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:51,463 INFO L225 Difference]: With dead ends: 362 [2021-10-11 02:23:51,463 INFO L226 Difference]: Without dead ends: 266 [2021-10-11 02:23:51,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-11 02:23:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 163. [2021-10-11 02:23:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-10-11 02:23:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 214 transitions. [2021-10-11 02:23:51,494 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 214 transitions. Word has length 50 [2021-10-11 02:23:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:51,494 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 214 transitions. [2021-10-11 02:23:51,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 214 transitions. [2021-10-11 02:23:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-11 02:23:51,496 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:51,496 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 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] [2021-10-11 02:23:51,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-11 02:23:51,496 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:51,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:51,497 INFO L82 PathProgramCache]: Analyzing trace with hash 159693820, now seen corresponding path program 1 times [2021-10-11 02:23:51,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:51,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833021913] [2021-10-11 02:23:51,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:23:51,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833021913] [2021-10-11 02:23:51,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:51,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:51,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900519529] [2021-10-11 02:23:51,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:51,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:51,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:51,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:51,539 INFO L87 Difference]: Start difference. First operand 163 states and 214 transitions. Second operand 3 states. [2021-10-11 02:23:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:51,569 INFO L93 Difference]: Finished difference Result 286 states and 383 transitions. [2021-10-11 02:23:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:51,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2021-10-11 02:23:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:51,571 INFO L225 Difference]: With dead ends: 286 [2021-10-11 02:23:51,571 INFO L226 Difference]: Without dead ends: 164 [2021-10-11 02:23:51,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-10-11 02:23:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 113. [2021-10-11 02:23:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2021-10-11 02:23:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2021-10-11 02:23:51,587 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 50 [2021-10-11 02:23:51,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:51,587 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2021-10-11 02:23:51,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2021-10-11 02:23:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-11 02:23:51,588 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:51,588 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2021-10-11 02:23:51,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 02:23:51,589 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:51,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:51,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1176566976, now seen corresponding path program 1 times [2021-10-11 02:23:51,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:51,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622777527] [2021-10-11 02:23:51,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 02:23:51,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622777527] [2021-10-11 02:23:51,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646011822] [2021-10-11 02:23:51,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:51,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-11 02:23:51,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 02:23:51,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 02:23:51,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076989473] [2021-10-11 02:23:51,995 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2021-10-11 02:23:51,995 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:51,996 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:23:51,996 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:23:52,001 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:23:52,646 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:23:52,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:52,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 6 [2021-10-11 02:23:52,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361042711] [2021-10-11 02:23:52,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:23:52,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:52,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:23:52,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:52,651 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand 7 states. [2021-10-11 02:23:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:52,735 INFO L93 Difference]: Finished difference Result 373 states and 465 transitions. [2021-10-11 02:23:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:23:52,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2021-10-11 02:23:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:52,739 INFO L225 Difference]: With dead ends: 373 [2021-10-11 02:23:52,739 INFO L226 Difference]: Without dead ends: 371 [2021-10-11 02:23:52,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-10-11 02:23:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 213. [2021-10-11 02:23:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2021-10-11 02:23:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 268 transitions. [2021-10-11 02:23:52,767 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 268 transitions. Word has length 51 [2021-10-11 02:23:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:52,767 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 268 transitions. [2021-10-11 02:23:52,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:23:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 268 transitions. [2021-10-11 02:23:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-11 02:23:52,769 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:52,769 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-10-11 02:23:52,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:52,996 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:52,997 INFO L82 PathProgramCache]: Analyzing trace with hash -449960657, now seen corresponding path program 1 times [2021-10-11 02:23:52,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:52,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054040385] [2021-10-11 02:23:52,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:53,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054040385] [2021-10-11 02:23:53,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:53,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:53,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012618803] [2021-10-11 02:23:53,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:53,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:53,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:53,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:53,069 INFO L87 Difference]: Start difference. First operand 213 states and 268 transitions. Second operand 6 states. [2021-10-11 02:23:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:53,166 INFO L93 Difference]: Finished difference Result 523 states and 665 transitions. [2021-10-11 02:23:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:23:53,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2021-10-11 02:23:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:53,169 INFO L225 Difference]: With dead ends: 523 [2021-10-11 02:23:53,169 INFO L226 Difference]: Without dead ends: 350 [2021-10-11 02:23:53,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-10-11 02:23:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 292. [2021-10-11 02:23:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2021-10-11 02:23:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 375 transitions. [2021-10-11 02:23:53,204 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 375 transitions. Word has length 51 [2021-10-11 02:23:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:53,205 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 375 transitions. [2021-10-11 02:23:53,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 375 transitions. [2021-10-11 02:23:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-11 02:23:53,206 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:53,206 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-10-11 02:23:53,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-11 02:23:53,206 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:53,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:53,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2095002879, now seen corresponding path program 1 times [2021-10-11 02:23:53,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:53,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171888209] [2021-10-11 02:23:53,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:23:53,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171888209] [2021-10-11 02:23:53,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419132036] [2021-10-11 02:23:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:53,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-11 02:23:53,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:23:53,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:23:53,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:23:53,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2021-10-11 02:23:53,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045152842] [2021-10-11 02:23:53,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:53,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:53,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:53,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:23:53,531 INFO L87 Difference]: Start difference. First operand 292 states and 375 transitions. Second operand 6 states. [2021-10-11 02:23:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:53,638 INFO L93 Difference]: Finished difference Result 664 states and 852 transitions. [2021-10-11 02:23:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:53,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2021-10-11 02:23:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:53,641 INFO L225 Difference]: With dead ends: 664 [2021-10-11 02:23:53,642 INFO L226 Difference]: Without dead ends: 412 [2021-10-11 02:23:53,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:23:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-10-11 02:23:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 304. [2021-10-11 02:23:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2021-10-11 02:23:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 377 transitions. [2021-10-11 02:23:53,684 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 377 transitions. Word has length 52 [2021-10-11 02:23:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:53,685 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 377 transitions. [2021-10-11 02:23:53,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 377 transitions. [2021-10-11 02:23:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-11 02:23:53,686 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:53,687 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:53,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-10-11 02:23:53,908 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:53,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:53,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1968802388, now seen corresponding path program 2 times [2021-10-11 02:23:53,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:53,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556920889] [2021-10-11 02:23:53,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 02:23:53,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556920889] [2021-10-11 02:23:53,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:53,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:53,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849400644] [2021-10-11 02:23:53,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:53,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:53,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:53,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:53,941 INFO L87 Difference]: Start difference. First operand 304 states and 377 transitions. Second operand 3 states. [2021-10-11 02:23:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:53,990 INFO L93 Difference]: Finished difference Result 585 states and 727 transitions. [2021-10-11 02:23:53,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:53,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2021-10-11 02:23:53,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:53,992 INFO L225 Difference]: With dead ends: 585 [2021-10-11 02:23:53,993 INFO L226 Difference]: Without dead ends: 310 [2021-10-11 02:23:53,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-10-11 02:23:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 304. [2021-10-11 02:23:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2021-10-11 02:23:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 372 transitions. [2021-10-11 02:23:54,030 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 372 transitions. Word has length 54 [2021-10-11 02:23:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:54,030 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 372 transitions. [2021-10-11 02:23:54,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 372 transitions. [2021-10-11 02:23:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-11 02:23:54,032 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:54,032 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:54,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-11 02:23:54,032 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:54,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:54,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1194558960, now seen corresponding path program 1 times [2021-10-11 02:23:54,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:54,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154250930] [2021-10-11 02:23:54,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:54,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154250930] [2021-10-11 02:23:54,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073836314] [2021-10-11 02:23:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:54,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:23:54,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:23:54,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:23:54,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:23:54,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [7] total 11 [2021-10-11 02:23:54,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471783954] [2021-10-11 02:23:54,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:54,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:54,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:54,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:23:54,477 INFO L87 Difference]: Start difference. First operand 304 states and 372 transitions. Second operand 6 states. [2021-10-11 02:23:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:54,571 INFO L93 Difference]: Finished difference Result 571 states and 708 transitions. [2021-10-11 02:23:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:54,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2021-10-11 02:23:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:54,574 INFO L225 Difference]: With dead ends: 571 [2021-10-11 02:23:54,574 INFO L226 Difference]: Without dead ends: 326 [2021-10-11 02:23:54,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:23:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-10-11 02:23:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 252. [2021-10-11 02:23:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2021-10-11 02:23:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 304 transitions. [2021-10-11 02:23:54,615 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 304 transitions. Word has length 56 [2021-10-11 02:23:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:54,615 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 304 transitions. [2021-10-11 02:23:54,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 304 transitions. [2021-10-11 02:23:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-11 02:23:54,617 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:54,617 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:54,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:54,832 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:54,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:54,833 INFO L82 PathProgramCache]: Analyzing trace with hash 928613197, now seen corresponding path program 1 times [2021-10-11 02:23:54,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:54,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972576542] [2021-10-11 02:23:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:23:54,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972576542] [2021-10-11 02:23:54,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523734457] [2021-10-11 02:23:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:55,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:23:55,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-11 02:23:55,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-11 02:23:55,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:23:55,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 8 [2021-10-11 02:23:55,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322915381] [2021-10-11 02:23:55,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:55,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:55,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:55,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:23:55,154 INFO L87 Difference]: Start difference. First operand 252 states and 304 transitions. Second operand 6 states. [2021-10-11 02:23:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:55,238 INFO L93 Difference]: Finished difference Result 409 states and 497 transitions. [2021-10-11 02:23:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:55,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2021-10-11 02:23:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:55,240 INFO L225 Difference]: With dead ends: 409 [2021-10-11 02:23:55,240 INFO L226 Difference]: Without dead ends: 216 [2021-10-11 02:23:55,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:23:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-10-11 02:23:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2021-10-11 02:23:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2021-10-11 02:23:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 221 transitions. [2021-10-11 02:23:55,271 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 221 transitions. Word has length 57 [2021-10-11 02:23:55,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:55,272 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 221 transitions. [2021-10-11 02:23:55,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 221 transitions. [2021-10-11 02:23:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-11 02:23:55,273 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:55,273 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 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] [2021-10-11 02:23:55,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-10-11 02:23:55,500 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:55,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:55,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1620213064, now seen corresponding path program 1 times [2021-10-11 02:23:55,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:55,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053751476] [2021-10-11 02:23:55,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:23:55,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053751476] [2021-10-11 02:23:55,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:55,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:55,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639295641] [2021-10-11 02:23:55,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:55,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:55,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:55,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:55,563 INFO L87 Difference]: Start difference. First operand 189 states and 221 transitions. Second operand 6 states. [2021-10-11 02:23:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:55,756 INFO L93 Difference]: Finished difference Result 344 states and 403 transitions. [2021-10-11 02:23:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:23:55,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2021-10-11 02:23:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:55,759 INFO L225 Difference]: With dead ends: 344 [2021-10-11 02:23:55,759 INFO L226 Difference]: Without dead ends: 214 [2021-10-11 02:23:55,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-10-11 02:23:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-10-11 02:23:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 177. [2021-10-11 02:23:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2021-10-11 02:23:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2021-10-11 02:23:55,787 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 63 [2021-10-11 02:23:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:55,787 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2021-10-11 02:23:55,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2021-10-11 02:23:55,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-11 02:23:55,788 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:55,789 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 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] [2021-10-11 02:23:55,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-11 02:23:55,789 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1356104515, now seen corresponding path program 1 times [2021-10-11 02:23:55,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:55,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24375404] [2021-10-11 02:23:55,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-11 02:23:55,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24375404] [2021-10-11 02:23:55,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:55,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:55,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378266795] [2021-10-11 02:23:55,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:55,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:55,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:55,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:55,841 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand 4 states. [2021-10-11 02:23:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:55,894 INFO L93 Difference]: Finished difference Result 270 states and 312 transitions. [2021-10-11 02:23:55,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:55,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-10-11 02:23:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:55,896 INFO L225 Difference]: With dead ends: 270 [2021-10-11 02:23:55,896 INFO L226 Difference]: Without dead ends: 148 [2021-10-11 02:23:55,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-10-11 02:23:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2021-10-11 02:23:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2021-10-11 02:23:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2021-10-11 02:23:55,917 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 64 [2021-10-11 02:23:55,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:55,917 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2021-10-11 02:23:55,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2021-10-11 02:23:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-11 02:23:55,918 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:55,919 INFO L422 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 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] [2021-10-11 02:23:55,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-11 02:23:55,919 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:55,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1874069329, now seen corresponding path program 1 times [2021-10-11 02:23:55,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:55,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165247663] [2021-10-11 02:23:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:23:56,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165247663] [2021-10-11 02:23:56,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604903762] [2021-10-11 02:23:56,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:56,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-11 02:23:56,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:23:56,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:23:56,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1502360088] [2021-10-11 02:23:56,412 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2021-10-11 02:23:56,412 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:56,412 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:23:56,413 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:23:56,413 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:23:58,989 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:23:58,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:58,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2021-10-11 02:23:58,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010524496] [2021-10-11 02:23:58,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-10-11 02:23:58,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:58,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-11 02:23:58,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:23:58,992 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand 14 states. [2021-10-11 02:23:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:59,382 INFO L93 Difference]: Finished difference Result 279 states and 319 transitions. [2021-10-11 02:23:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-11 02:23:59,382 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2021-10-11 02:23:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:59,383 INFO L225 Difference]: With dead ends: 279 [2021-10-11 02:23:59,383 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:23:59,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2021-10-11 02:23:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:23:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:23:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:23:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:23:59,385 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2021-10-11 02:23:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:59,385 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:23:59,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-10-11 02:23:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:23:59,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:23:59,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:59,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:24:00,092 WARN L197 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 273 [2021-10-11 02:24:00,260 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 173 [2021-10-11 02:24:00,612 WARN L197 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 260 [2021-10-11 02:24:00,716 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2021-10-11 02:24:03,199 WARN L197 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 262 DAG size of output: 175 [2021-10-11 02:24:03,881 WARN L197 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 137 [2021-10-11 02:24:05,915 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 252 DAG size of output: 171 [2021-10-11 02:24:06,179 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 39 [2021-10-11 02:24:06,404 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2021-10-11 02:24:07,133 WARN L197 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 145 [2021-10-11 02:24:07,374 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2021-10-11 02:24:08,816 WARN L197 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 166 DAG size of output: 143 [2021-10-11 02:24:09,006 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 45 [2021-10-11 02:24:09,522 WARN L197 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 120 [2021-10-11 02:24:09,715 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2021-10-11 02:24:09,810 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-11 02:24:09,810 INFO L265 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-10-11 02:24:09,810 INFO L262 CegarLoopResult]: For program point L120(lines 120 128) no Hoare annotation was computed. [2021-10-11 02:24:09,810 INFO L258 CegarLoopResult]: At program point L87(lines 75 89) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |#t~string4.base|))) (and (= ~c_dr_st~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= (select |#valid| 0) 0) (= ~p_num_write~0 0) (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~q_free~0 1) (= 0 ULTIMATE.start_start_simulation_~kernel_st~0) (= ~a_t~0 0) (= (select |#valid| |#t~string5.base|) 1) (= (select |#valid| |#t~string4.base|) 1) (= ~p_last_write~0 ~q_buf_0~0) (= |#t~string5.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= 12 (select |#length| |#t~string6.base|)) (< |#StackHeapBarrier| |#t~string5.base|) (= 19 (select |#length| |#t~string5.base|)) (= |#NULL.offset| 0) (= ~q_write_ev~0 2) (= 0 |#t~string4.offset|) (= 1 ~c_dr_i~0) (= ~q_read_ev~0 2) (= 2 (select |#length| |#t~string4.base|)) (= |#NULL.base| 0) (= ~q_req_up~0 0) (= ~q_ev~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= ~c_dr_pc~0 0) (= (select |#valid| |#t~string6.base|) 1) (= 48 (select .cse0 |#t~string4.offset|)) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (< |#StackHeapBarrier| |#t~string6.base|) (< |#StackHeapBarrier| |#t~string4.base|) (< 0 |#StackHeapBarrier|) (= |#t~string6.offset| 0) (= (select .cse0 (+ |#t~string4.offset| 1)) 0) (= ~p_last_write~0 0))) [2021-10-11 02:24:09,811 INFO L258 CegarLoopResult]: At program point L87-1(lines 75 89) the Hoare annotation is: (let ((.cse10 (+ ~c_num_read~0 1))) (let ((.cse5 (< 1 ~q_write_ev~0)) (.cse0 (= ~q_free~0 0)) (.cse1 (<= .cse10 ~p_num_write~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse3 (<= ~p_num_write~0 .cse10)) (.cse4 (<= 2 ~q_read_ev~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~p_dw_pc~0 1)) (.cse8 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse9 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~q_read_ev~0 1) (= ~c_dr_st~0 2) (<= ~p_num_write~0 ~c_num_read~0) (= ~p_dw_st~0 0) (or (not (= ~q_req_up~0 1)) (not .cse0)) .cse5 .cse6 .cse7 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (< ~c_num_read~0 (+ ~p_num_write~0 1)) (not .cse8) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (= ~q_write_ev~0 1) .cse7 .cse8 .cse9)))) [2021-10-11 02:24:09,811 INFO L265 CegarLoopResult]: At program point L434(lines 397 439) the Hoare annotation is: true [2021-10-11 02:24:09,811 INFO L262 CegarLoopResult]: For program point L336(lines 336 340) no Hoare annotation was computed. [2021-10-11 02:24:09,811 INFO L262 CegarLoopResult]: For program point L336-1(lines 331 371) no Hoare annotation was computed. [2021-10-11 02:24:09,812 INFO L262 CegarLoopResult]: For program point L123(lines 123 127) no Hoare annotation was computed. [2021-10-11 02:24:09,812 INFO L262 CegarLoopResult]: For program point L57(lines 57 66) no Hoare annotation was computed. [2021-10-11 02:24:09,812 INFO L262 CegarLoopResult]: For program point L57-2(lines 57 66) no Hoare annotation was computed. [2021-10-11 02:24:09,812 INFO L262 CegarLoopResult]: For program point L57-3(lines 57 66) no Hoare annotation was computed. [2021-10-11 02:24:09,812 INFO L262 CegarLoopResult]: For program point L57-5(lines 57 66) no Hoare annotation was computed. [2021-10-11 02:24:09,812 INFO L262 CegarLoopResult]: For program point L173(lines 172 203) no Hoare annotation was computed. [2021-10-11 02:24:09,812 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:24:09,812 INFO L262 CegarLoopResult]: For program point L190(lines 190 202) no Hoare annotation was computed. [2021-10-11 02:24:09,813 INFO L262 CegarLoopResult]: For program point L58(lines 58 63) no Hoare annotation was computed. [2021-10-11 02:24:09,813 INFO L262 CegarLoopResult]: For program point L58-1(lines 58 63) no Hoare annotation was computed. [2021-10-11 02:24:09,813 INFO L258 CegarLoopResult]: At program point L372(lines 324 377) the Hoare annotation is: (let ((.cse0 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_read_ev~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (< 1 ~q_write_ev~0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (= ~c_dr_pc~0 1))) (or (and (= ~q_req_up~0 1) (= ~c_dr_st~0 2) .cse0 (<= ~p_num_write~0 ~c_num_read~0) .cse1 .cse2 .cse3 .cse4 (< ~c_num_read~0 (+ ~p_num_write~0 1)) (= ~q_free~0 1) .cse5) (let ((.cse6 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse6 ~p_num_write~0) .cse0 (<= ~p_num_write~0 .cse6) .cse2 .cse3 .cse1 .cse4 .cse5)))) [2021-10-11 02:24:09,813 INFO L262 CegarLoopResult]: For program point L174-1(lines 174 184) no Hoare annotation was computed. [2021-10-11 02:24:09,814 INFO L258 CegarLoopResult]: At program point L356(lines 331 371) the Hoare annotation is: (let ((.cse51 (select |#memory_int| |#t~string4.base|)) (.cse0 (= ~q_req_up~0 1))) (let ((.cse17 (= ~p_num_write~0 0)) (.cse12 (= ~q_free~0 1)) (.cse23 (= ~c_last_read~0 ~p_last_write~0)) (.cse47 (not .cse0)) (.cse1 (= ~c_dr_st~0 2)) (.cse11 (not (= ULTIMATE.start_eval_~tmp___1~0 0))) (.cse5 (<= ~p_num_write~0 ~c_num_read~0)) (.cse41 (= ~p_dw_st~0 0)) (.cse8 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse15 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse14 (= ~c_dr_st~0 0)) (.cse16 (= (select |#valid| 0) 0)) (.cse20 (= (select |#valid| |#t~string5.base|) 1)) (.cse22 (= |#t~string5.offset| 0)) (.cse24 (= 12 (select |#length| |#t~string6.base|))) (.cse25 (< |#StackHeapBarrier| |#t~string5.base|)) (.cse26 (= 19 (select |#length| |#t~string5.base|))) (.cse27 (= |#NULL.offset| 0)) (.cse28 (= 0 |#t~string4.offset|)) (.cse29 (= ~q_write_ev~0 2)) (.cse30 (= 1 ~c_dr_i~0)) (.cse33 (= |#NULL.base| 0)) (.cse35 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse37 (= (select |#valid| |#t~string6.base|) 1)) (.cse38 (= 48 (select .cse51 |#t~string4.offset|))) (.cse39 (= ~p_dw_i~0 1)) (.cse40 (= ~c_num_read~0 0)) (.cse45 (= |#t~string6.offset| 0)) (.cse46 (= (select .cse51 (+ |#t~string4.offset| 1)) 0)) (.cse13 (= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse18 (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse19 (= ~a_t~0 0)) (.cse21 (= (select |#valid| |#t~string4.base|) 1)) (.cse31 (= ~q_read_ev~0 2)) (.cse32 (= 2 (select |#length| |#t~string4.base|))) (.cse34 (= ~q_ev~0 0)) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse36 (= ~c_dr_pc~0 0)) (.cse42 (< |#StackHeapBarrier| |#t~string6.base|)) (.cse43 (< |#StackHeapBarrier| |#t~string4.base|)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse48 (= ~q_free~0 0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse4 (<= 2 ~q_read_ev~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (< 1 ~q_write_ev~0)) (.cse7 (= ~p_dw_pc~0 1)) (.cse10 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse5 .cse6 .cse7 .cse8 .cse11 .cse10)) .cse12) (and (= ULTIMATE.start_activate_threads_~tmp___0~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse12 .cse19 .cse20 (= ~q_buf_0~0 0) .cse21 .cse6 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (= ~q_req_up~0 0) .cse34 .cse35 .cse9 .cse36 .cse37 .cse38 .cse39 .cse40 (= ~p_dw_pc~0 0) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse34 (<= ~c_num_read~0 0) .cse17 .cse12 (<= 0 ~c_num_read~0) .cse10 .cse1 .cse41 .cse6 .cse4 (<= ~p_dw_pc~0 0) .cse47 .cse23 .cse29 .cse11) (and (or .cse47 (not .cse48)) .cse3 (let ((.cse49 (not .cse15))) (or (and .cse1 .cse5 .cse41 .cse6 .cse4 .cse7 .cse8 .cse49 .cse11 .cse10) (and (<= 2 ~c_dr_st~0) .cse5 .cse41 .cse4 .cse6 .cse7 .cse8 .cse9 .cse49 .cse10)))) (and (= ~p_num_write~0 1) .cse14 .cse16 .cse48 .cse20 (<= 0 (+ ~q_buf_0~0 2147483648)) .cse0 .cse7 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (<= ~q_buf_0~0 2147483647) .cse30 (not (= ULTIMATE.start_eval_~tmp~2 0)) (<= ULTIMATE.start_eval_~tmp___1~0 1) .cse33 .cse35 .cse37 (<= ULTIMATE.start_activate_threads_~tmp___0~1 0) .cse38 .cse39 .cse40 (<= 0 (+ ULTIMATE.start_eval_~tmp___0~2 2147483648)) (<= 1 ULTIMATE.start_eval_~tmp___1~0) (<= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|) .cse45 .cse46 (<= 0 (+ ULTIMATE.start_eval_~tmp~2 2147483648)) (= ~c_last_read~0 0) (= 2 ~p_dw_st~0) .cse13 .cse18 (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|) .cse19 (<= ULTIMATE.start_eval_~tmp~2 2147483647) .cse21 .cse6 (<= ULTIMATE.start_eval_~tmp___0~2 2147483647) .cse31 (<= 0 ULTIMATE.start_activate_threads_~tmp___0~1) .cse32 .cse34 (<= |ULTIMATE.start_is_do_write_p_triggered_#res| 0) .cse9 .cse36 (<= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) .cse42 .cse43 .cse44 (<= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (let ((.cse50 (+ ~c_num_read~0 1))) (and .cse48 (<= .cse50 ~p_num_write~0) .cse2 (<= ~p_num_write~0 .cse50) .cse4 .cse6 .cse3 .cse7 .cse10))))) [2021-10-11 02:24:09,814 INFO L262 CegarLoopResult]: For program point L191(lines 191 197) no Hoare annotation was computed. [2021-10-11 02:24:09,814 INFO L262 CegarLoopResult]: For program point L76(lines 76 85) no Hoare annotation was computed. [2021-10-11 02:24:09,814 INFO L262 CegarLoopResult]: For program point L76-2(lines 76 85) no Hoare annotation was computed. [2021-10-11 02:24:09,815 INFO L262 CegarLoopResult]: For program point L76-3(lines 76 85) no Hoare annotation was computed. [2021-10-11 02:24:09,815 INFO L262 CegarLoopResult]: For program point L76-5(lines 76 85) no Hoare annotation was computed. [2021-10-11 02:24:09,815 INFO L258 CegarLoopResult]: At program point L341(lines 331 371) the Hoare annotation is: (let ((.cse50 (= ~q_req_up~0 1)) (.cse51 (select |#memory_int| |#t~string4.base|))) (let ((.cse13 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse15 (= (select |#valid| 0) 0)) (.cse1 (= ~q_free~0 0)) (.cse21 (= (select |#valid| |#t~string5.base|) 1)) (.cse25 (= 12 (select |#length| |#t~string6.base|))) (.cse26 (< |#StackHeapBarrier| |#t~string5.base|)) (.cse27 (= 19 (select |#length| |#t~string5.base|))) (.cse28 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse29 (= |#NULL.offset| 0)) (.cse33 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse35 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse37 (= (select |#valid| |#t~string6.base|) 1)) (.cse38 (= 48 (select .cse51 |#t~string4.offset|))) (.cse39 (= ~p_dw_i~0 1)) (.cse40 (= ~c_num_read~0 0)) (.cse45 (= |#t~string6.offset| 0)) (.cse46 (= (select .cse51 (+ |#t~string4.offset| 1)) 0)) (.cse47 (<= 0 (+ ULTIMATE.start_eval_~tmp~2 2147483648))) (.cse14 (= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse17 (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse18 (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse20 (= ~a_t~0 0)) (.cse22 (<= ULTIMATE.start_eval_~tmp~2 2147483647)) (.cse23 (= (select |#valid| |#t~string4.base|) 1)) (.cse31 (= ~q_read_ev~0 2)) (.cse32 (= 2 (select |#length| |#t~string4.base|))) (.cse8 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse36 (= ~c_dr_pc~0 0)) (.cse41 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse42 (< |#StackHeapBarrier| |#t~string6.base|)) (.cse43 (< |#StackHeapBarrier| |#t~string4.base|)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse34 (= ~q_ev~0 0)) (.cse16 (= ~p_num_write~0 0)) (.cse3 (= ~p_dw_st~0 0)) (.cse0 (not .cse50)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse30 (= ~q_write_ev~0 2)) (.cse11 (= ~c_dr_st~0 2)) (.cse49 (<= 2 ~p_dw_st~0)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (<= 2 ~q_read_ev~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (< 1 ~q_write_ev~0)) (.cse6 (= ~p_dw_pc~0 1)) (.cse7 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse19 (= ~q_free~0 1)) (.cse9 (not (= ULTIMATE.start_eval_~tmp___1~0 0))) (.cse10 (= ~c_dr_pc~0 1))) (or (and (or .cse0 (not .cse1)) .cse2 (or (and (<= 2 ~c_dr_st~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse4 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10)) .cse12 (not .cse13)) (and (= ULTIMATE.start_activate_threads_~tmp___0~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) .cse14 (= ~c_dr_st~0 0) .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= ~q_buf_0~0 0) .cse23 .cse5 (= |#t~string5.offset| 0) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= 0 |#t~string4.offset|) (= 1 ~c_dr_i~0) .cse31 .cse32 (= |#NULL.base| 0) .cse33 (= ~q_req_up~0 0) .cse34 .cse35 .cse8 .cse36 .cse37 .cse38 .cse39 .cse40 (= ~p_dw_pc~0 0) .cse3 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (let ((.cse48 (+ ~c_num_read~0 1))) (and .cse1 (<= .cse48 ~p_num_write~0) .cse49 (<= ~p_num_write~0 .cse48) .cse12 .cse5 .cse2 .cse6 .cse9 .cse10)) (and (= ~p_num_write~0 1) .cse15 .cse1 .cse21 .cse50 (<= 0 (+ ~q_buf_0~0 2147483648)) (<= 0 ~c_dr_st~0) .cse6 (<= 0 |#t~string5.offset|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (<= ~q_buf_0~0 2147483647) (<= |#t~string4.offset| 0) (not (= ULTIMATE.start_eval_~tmp~2 0)) .cse33 .cse35 .cse37 (<= ULTIMATE.start_activate_threads_~tmp___0~1 0) .cse38 .cse39 .cse40 (<= ~c_dr_st~0 0) (<= 0 |#NULL.base|) (<= 1 ~c_dr_i~0) .cse45 .cse46 .cse47 (= ~c_last_read~0 0) (= 2 ~p_dw_st~0) .cse14 .cse17 .cse18 (<= 0 |#t~string4.offset|) .cse20 .cse22 .cse23 .cse5 (<= ~c_dr_i~0 1) .cse31 (<= 0 ULTIMATE.start_activate_threads_~tmp___0~1) .cse32 (<= |#NULL.base| 0) (<= |ULTIMATE.start_is_do_write_p_triggered_#res| 0) .cse34 .cse8 .cse36 (<= |#t~string5.offset| 0) .cse41 .cse42 .cse43 .cse44 (<= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (and .cse34 (<= ~c_num_read~0 0) .cse16 .cse19 (<= 0 ~c_num_read~0) .cse10 .cse11 .cse3 .cse5 .cse12 (<= ~p_dw_pc~0 0) .cse0 .cse24 .cse30 .cse9) (and .cse50 .cse11 .cse49 .cse4 .cse12 .cse5 .cse2 .cse6 .cse7 .cse19 .cse9 .cse10)))) [2021-10-11 02:24:09,815 INFO L262 CegarLoopResult]: For program point L77(lines 77 82) no Hoare annotation was computed. [2021-10-11 02:24:09,816 INFO L262 CegarLoopResult]: For program point L77-1(lines 77 82) no Hoare annotation was computed. [2021-10-11 02:24:09,816 INFO L262 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-11 02:24:09,816 INFO L262 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-10-11 02:24:09,816 INFO L262 CegarLoopResult]: For program point L161(lines 161 169) no Hoare annotation was computed. [2021-10-11 02:24:09,816 INFO L258 CegarLoopResult]: At program point L13-1(lines 160 208) the Hoare annotation is: (let ((.cse0 (< 0 ~c_dr_st~0)) (.cse4 (<= 2 ~q_read_ev~0)) (.cse3 (= ~q_free~0 1)) (.cse8 (not (= ULTIMATE.start_eval_~tmp___1~0 0))) (.cse6 (= ~q_req_up~0 1)) (.cse9 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_write_ev~0 2)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_ev~0 0)) (.cse2 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 (<= ~c_num_read~0 0) (= ~p_num_write~0 0) .cse2 .cse3 (<= 0 ~c_num_read~0) (= ~p_dw_st~0 0) .cse4 (<= ~p_dw_pc~0 0) .cse5 (not .cse6) (= ~c_last_read~0 ~p_last_write~0) .cse7 .cse8) (and .cse0 .cse6 (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 (< 1 ~q_write_ev~0) .cse9 (< ~c_num_read~0 (+ ~p_num_write~0 1)) .cse3 .cse8) (let ((.cse10 (select |#memory_int| |#t~string4.base|))) (and (= ~p_num_write~0 1) (= (select |#valid| 0) 0) (= ~q_free~0 0) (= (select |#valid| |#t~string5.base|) 1) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse6 .cse9 (= |#t~string5.offset| 0) (= 12 (select |#length| |#t~string6.base|)) (< |#StackHeapBarrier| |#t~string5.base|) (= 19 (select |#length| |#t~string5.base|)) (= |#NULL.offset| 0) .cse7 (= 0 |#t~string4.offset|) (<= ~q_buf_0~0 2147483647) (= 1 ~c_dr_i~0) (not (= ULTIMATE.start_eval_~tmp~2 0)) (<= ULTIMATE.start_eval_~tmp___1~0 1) (= |#NULL.base| 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= (select |#valid| |#t~string6.base|) 1) (not (= ULTIMATE.start_eval_~tmp___0~2 0)) (<= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= 48 (select .cse10 |#t~string4.offset|)) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (<= 0 (+ ULTIMATE.start_eval_~tmp___0~2 2147483648)) (<= 1 ULTIMATE.start_eval_~tmp___1~0) (<= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|) (= |#t~string6.offset| 0) (= (select .cse10 (+ |#t~string4.offset| 1)) 0) (<= 0 (+ ULTIMATE.start_eval_~tmp~2 2147483648)) (= ~c_last_read~0 0) (= 2 ~p_dw_st~0) (= 1 ULTIMATE.start_start_simulation_~kernel_st~0) (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|) (= ~c_dr_st~0 1) (= ~a_t~0 0) (<= ULTIMATE.start_eval_~tmp~2 2147483647) (= (select |#valid| |#t~string4.base|) 1) .cse5 (<= ULTIMATE.start_eval_~tmp___0~2 2147483647) (= ~q_read_ev~0 2) (<= 0 ULTIMATE.start_activate_threads_~tmp___0~1) (= 2 (select |#length| |#t~string4.base|)) .cse1 (<= |ULTIMATE.start_is_do_write_p_triggered_#res| 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse2 (<= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) (< |#StackHeapBarrier| |#t~string6.base|) (< |#StackHeapBarrier| |#t~string4.base|) (< 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))))) [2021-10-11 02:24:09,816 INFO L262 CegarLoopResult]: For program point L360(lines 360 367) no Hoare annotation was computed. [2021-10-11 02:24:09,817 INFO L258 CegarLoopResult]: At program point L411-1(lines 281 433) the Hoare annotation is: (let ((.cse3 (<= 2 ~q_read_ev~0)) (.cse0 (= ~q_free~0 0)) (.cse4 (< 1 ~q_write_ev~0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse7 (= ~c_dr_pc~0 1)) (.cse6 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse8 (= ~p_dw_st~0 0))) (or (let ((.cse1 (+ ~c_num_read~0 1))) (and .cse0 (<= .cse1 ~p_num_write~0) (<= ~p_num_write~0 .cse1) (<= 2 ~p_dw_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (and (<= 2 ~c_dr_st~0) .cse8 (<= ~p_num_write~0 ~c_num_read~0) .cse2 .cse3 (or (not (= ~q_req_up~0 1)) (not .cse0)) .cse4 .cse5 (< ~c_num_read~0 (+ ~p_num_write~0 1)) .cse9 (not .cse6) .cse7) (let ((.cse10 (select |#memory_int| |#t~string4.base|))) (and (= ULTIMATE.start_activate_threads_~tmp___0~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (= ~c_dr_st~0 0) .cse6 (= (select |#valid| 0) 0) (= ~p_num_write~0 0) (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~q_free~0 1) (= 0 ULTIMATE.start_start_simulation_~kernel_st~0) (= ~a_t~0 0) (= (select |#valid| |#t~string5.base|) 1) (= ~q_buf_0~0 0) (= (select |#valid| |#t~string4.base|) 1) .cse2 (= |#t~string5.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= 12 (select |#length| |#t~string6.base|)) (< |#StackHeapBarrier| |#t~string5.base|) (= 19 (select |#length| |#t~string5.base|)) (= |#NULL.offset| 0) (= ~q_write_ev~0 2) (= 0 |#t~string4.offset|) (= 1 ~c_dr_i~0) (= ~q_read_ev~0 2) (= 2 (select |#length| |#t~string4.base|)) (= |#NULL.base| 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (= ~q_req_up~0 0) (= ~q_ev~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) .cse9 (= ~c_dr_pc~0 0) (= (select |#valid| |#t~string6.base|) 1) (= 48 (select .cse10 |#t~string4.offset|)) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) .cse8 (< |#StackHeapBarrier| |#t~string6.base|) (< |#StackHeapBarrier| |#t~string4.base|) (< 0 |#StackHeapBarrier|) (= |#t~string6.offset| 0) (= (select .cse10 (+ |#t~string4.offset| 1)) 0))))) [2021-10-11 02:24:09,817 INFO L262 CegarLoopResult]: For program point L345(lines 345 352) no Hoare annotation was computed. [2021-10-11 02:24:09,817 INFO L262 CegarLoopResult]: For program point L428(lines 428 432) no Hoare annotation was computed. [2021-10-11 02:24:09,817 INFO L258 CegarLoopResult]: At program point L164(lines 164 168) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (< 0 ~c_dr_st~0) (<= .cse0 ~p_num_write~0) (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 .cse0) (< 1 ~q_write_ev~0) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~q_read_ev~0) (= ~p_dw_pc~0 1) (not (= ULTIMATE.start_eval_~tmp___1~0 0)) (= ~c_dr_pc~0 1))) [2021-10-11 02:24:09,818 INFO L258 CegarLoopResult]: At program point L131-1(lines 119 154) the Hoare annotation is: (let ((.cse55 (select |#memory_int| |#t~string4.base|))) (let ((.cse5 (= ~c_dr_st~0 2)) (.cse4 (= ~c_dr_pc~0 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse7 (<= 2 ~q_read_ev~0)) (.cse10 (not (= ULTIMATE.start_eval_~tmp___1~0 0))) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~q_free~0 1)) (.cse16 (= ULTIMATE.start_activate_threads_~tmp___0~1 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse18 (= ~c_dr_st~0 0)) (.cse19 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse20 (= (select |#valid| 0) 0)) (.cse11 (= ~q_free~0 0)) (.cse24 (= (select |#valid| |#t~string5.base|) 1)) (.cse8 (= ~q_req_up~0 1)) (.cse27 (= |#t~string5.offset| 0)) (.cse28 (= 12 (select |#length| |#t~string6.base|))) (.cse29 (< |#StackHeapBarrier| |#t~string5.base|)) (.cse30 (= 19 (select |#length| |#t~string5.base|))) (.cse31 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse32 (= |#NULL.offset| 0)) (.cse33 (= 0 |#t~string4.offset|)) (.cse9 (= ~q_write_ev~0 2)) (.cse35 (= 1 ~c_dr_i~0)) (.cse36 (not (= ULTIMATE.start_eval_~tmp~2 0))) (.cse39 (= |#NULL.base| 0)) (.cse40 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse41 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse43 (= (select |#valid| |#t~string6.base|) 1)) (.cse44 (= 48 (select .cse55 |#t~string4.offset|))) (.cse45 (= ~p_dw_i~0 1)) (.cse46 (= ~c_num_read~0 0)) (.cse52 (= |#t~string6.offset| 0)) (.cse53 (= (select .cse55 (+ |#t~string4.offset| 1)) 0)) (.cse54 (<= 0 (+ ULTIMATE.start_eval_~tmp~2 2147483648))) (.cse17 (= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse21 (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse22 (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse23 (= ~a_t~0 0)) (.cse25 (<= ULTIMATE.start_eval_~tmp~2 2147483647)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (= (select |#valid| |#t~string4.base|) 1)) (.cse34 (= ~p_dw_st~0 1)) (.cse37 (= ~q_read_ev~0 2)) (.cse38 (= 2 (select |#length| |#t~string4.base|))) (.cse1 (= ~q_ev~0 0)) (.cse14 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse42 (= ~c_dr_pc~0 0)) (.cse47 (= ~p_dw_pc~0 0)) (.cse48 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse49 (< |#StackHeapBarrier| |#t~string6.base|)) (.cse50 (< |#StackHeapBarrier| |#t~string4.base|)) (.cse51 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 (<= ~c_num_read~0 0) .cse2 .cse3 (<= 0 ~c_num_read~0) .cse4 .cse5 .cse6 .cse7 (not .cse8) .cse9 .cse10) (and .cse11 .cse8 (let ((.cse15 (+ ~c_num_read~0 1))) (let ((.cse12 (<= .cse15 ~p_num_write~0)) (.cse13 (<= ~p_num_write~0 .cse15))) (or (and (<= 2 ~c_dr_st~0) .cse12 .cse13 .cse6 (= ~p_dw_pc~0 1) .cse14 .cse4) (and .cse12 .cse5 .cse13 .cse6 .cse4)))) (< 1 ~q_write_ev~0) .cse0 .cse7 .cse10) (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse2 .cse21 .cse22 .cse3 .cse23 .cse24 .cse25 (= ~q_buf_0~0 0) .cse26 .cse6 .cse27 (= ~c_last_read~0 ~p_last_write~0) .cse28 .cse29 .cse30 .cse31 .cse32 .cse9 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (= ~q_req_up~0 0) .cse1 .cse41 .cse14 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and (= ~p_num_write~0 1) .cse16 .cse18 .cse19 .cse20 .cse11 .cse24 (<= 0 (+ ~q_buf_0~0 2147483648)) .cse8 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse9 (<= ~q_buf_0~0 2147483647) .cse35 .cse36 .cse39 .cse40 .cse41 .cse43 .cse44 .cse45 .cse46 .cse52 .cse53 .cse54 (= ~c_last_read~0 0) .cse17 .cse21 .cse22 .cse23 .cse25 .cse6 .cse26 .cse34 .cse37 .cse38 .cse1 .cse14 .cse42 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2021-10-11 02:24:09,818 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-11 02:24:09,818 INFO L262 CegarLoopResult]: For program point L132(lines 131 149) no Hoare annotation was computed. [2021-10-11 02:24:09,818 INFO L258 CegarLoopResult]: At program point L133(lines 119 154) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0))) (or (let ((.cse2 (select |#memory_int| |#t~string4.base|))) (and (= ~c_last_read~0 0) (= ULTIMATE.start_activate_threads_~tmp___0~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (= 1 ULTIMATE.start_start_simulation_~kernel_st~0) (= ~c_dr_st~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= (select |#valid| 0) 0) (= ~p_num_write~0 0) (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|) (= ~q_free~0 1) (= ~a_t~0 0) (= (select |#valid| |#t~string5.base|) 1) (<= ULTIMATE.start_eval_~tmp~2 2147483647) (= ~q_buf_0~0 0) .cse0 (= (select |#valid| |#t~string4.base|) 1) (= |#t~string5.offset| 0) (= 12 (select |#length| |#t~string6.base|)) (< |#StackHeapBarrier| |#t~string5.base|) (= 19 (select |#length| |#t~string5.base|)) (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|) (= |#NULL.offset| 0) (= 0 |#t~string4.offset|) (= ~q_write_ev~0 2) (= ~p_dw_st~0 1) (= 1 ~c_dr_i~0) (not (= ULTIMATE.start_eval_~tmp~2 0)) (= ~q_read_ev~0 2) (= 2 (select |#length| |#t~string4.base|)) (= |#NULL.base| 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (= ~q_req_up~0 0) (= ~q_ev~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) .cse1 (= ~c_dr_pc~0 0) (= (select |#valid| |#t~string6.base|) 1) (= 48 (select .cse2 |#t~string4.offset|)) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) (< |#StackHeapBarrier| |#t~string6.base|) (< |#StackHeapBarrier| |#t~string4.base|) (< 0 |#StackHeapBarrier|) (= |#t~string6.offset| 0) (= (select .cse2 (+ |#t~string4.offset| 1)) 0) (<= 0 (+ ULTIMATE.start_eval_~tmp~2 2147483648)))) (and (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse5 (= ~c_dr_pc~0 1))) (or (and (<= 2 ~c_dr_st~0) .cse3 .cse0 (= ~p_dw_pc~0 1) .cse4 .cse1 .cse5) (and (= ~c_dr_st~0 2) .cse3 .cse0 .cse4 .cse5))) (or (not (= ~q_req_up~0 1)) (not (= ~q_free~0 0))) (< 1 ~q_write_ev~0) (not (= ~p_dw_st~0 0)) (<= 2 ~q_read_ev~0) (not (= ULTIMATE.start_eval_~tmp___1~0 0))))) [2021-10-11 02:24:09,819 INFO L258 CegarLoopResult]: At program point L68(lines 56 70) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |#t~string4.base|))) (and (= ~c_dr_st~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= (select |#valid| 0) 0) (= ~p_num_write~0 0) (= ~q_free~0 1) (= 0 ULTIMATE.start_start_simulation_~kernel_st~0) (= ~a_t~0 0) (= (select |#valid| |#t~string5.base|) 1) (= (select |#valid| |#t~string4.base|) 1) (= ~p_last_write~0 ~q_buf_0~0) (= |#t~string5.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= 12 (select |#length| |#t~string6.base|)) (< |#StackHeapBarrier| |#t~string5.base|) (= 19 (select |#length| |#t~string5.base|)) (= |#NULL.offset| 0) (= ~q_write_ev~0 2) (= 0 |#t~string4.offset|) (= 1 ~c_dr_i~0) (= ~q_read_ev~0 2) (= 2 (select |#length| |#t~string4.base|)) (= |#NULL.base| 0) (= ~q_ev~0 0) (= ~q_req_up~0 0) (= ~c_dr_pc~0 0) (= (select |#valid| |#t~string6.base|) 1) (= 48 (select .cse0 |#t~string4.offset|)) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (< |#StackHeapBarrier| |#t~string6.base|) (< |#StackHeapBarrier| |#t~string4.base|) (< 0 |#StackHeapBarrier|) (= |#t~string6.offset| 0) (= (select .cse0 (+ |#t~string4.offset| 1)) 0) (= ~p_last_write~0 0))) [2021-10-11 02:24:09,819 INFO L258 CegarLoopResult]: At program point L68-1(lines 56 70) the Hoare annotation is: (let ((.cse0 (= ~q_free~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse1 (< 1 ~q_write_ev~0)) (.cse4 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse5 (= ~c_dr_pc~0 1))) (or (and (= ~q_read_ev~0 1) (= ~c_dr_st~0 2) (<= ~p_num_write~0 ~c_num_read~0) (or (not (= ~q_req_up~0 1)) (not .cse0)) .cse1 .cse2 .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1)) (not .cse4) .cse5) (let ((.cse6 (+ ~c_num_read~0 1))) (and .cse0 (<= .cse6 ~p_num_write~0) (<= ~p_num_write~0 .cse6) (<= 2 ~p_dw_st~0) .cse2 (<= 2 ~q_read_ev~0) .cse3 (or .cse1 (= ~q_write_ev~0 1)) .cse4 .cse5)))) [2021-10-11 02:24:09,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:24:09 BoogieIcfgContainer [2021-10-11 02:24:09,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:24:09,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:24:09,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:24:09,903 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:24:09,903 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:38" (3/4) ... [2021-10-11 02:24:09,906 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:24:09,921 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2021-10-11 02:24:09,922 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-10-11 02:24:09,923 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 02:24:09,924 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:24:09,948 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && tmp == \result) && q_free == 1) && 0 == kernel_st) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && \valid["0"] == 1) && p_last_write == q_buf_0) && "pc_sfifo_2.cil-1.c" == 0) && c_last_read == p_last_write) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && #NULL == 0) && q_write_ev == 2) && 0 == "0") && 1 == c_dr_i) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && q_req_up == 0) && q_ev == 0) && __retres1 == \result) && __retres1 == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && p_last_write == 0 [2021-10-11 02:24:09,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && 1 < q_write_ev) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1) || (((((((((((2 <= c_dr_st && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && 2 <= q_read_ev) && (!(q_req_up == 1) || !(q_free == 0))) && 1 < q_write_ev) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && __retres1 == 0) && !(__retres1 == 0)) && c_dr_pc == 1)) || (((((((((((((((((((((((((((((((((((((((((tmp___0 == \result && c_dr_st == 0) && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && tmp == \result) && q_free == 1) && 0 == kernel_st) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && q_buf_0 == 0) && \valid["0"] == 1) && p_last_write == q_buf_0) && "pc_sfifo_2.cil-1.c" == 0) && c_last_read == p_last_write) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && #NULL == 0) && q_write_ev == 2) && 0 == "0") && 1 == c_dr_i) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && __retres1 == \result) && q_req_up == 0) && q_ev == 0) && __retres1 == \result) && __retres1 == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) [2021-10-11 02:24:09,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((q_req_up == 1 && c_dr_st == 2) && 2 <= p_dw_st) && 1 < q_write_ev) && 2 <= q_read_ev) && ((((((p_num_write <= c_num_read && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && __retres1 == 0) && c_dr_pc == 1) || (((((p_num_write <= c_num_read && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && !(tmp___1 == 0)) && c_dr_pc == 1))) && q_free == 1) || (((((((((((((((((((((((((((((((((((((((((tmp___0 == \result && 1 == kernel_st) && c_dr_st == 0) && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && tmp == \result) && q_free == 1) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && q_buf_0 == 0) && \valid["0"] == 1) && p_last_write == q_buf_0) && "pc_sfifo_2.cil-1.c" == 0) && c_last_read == p_last_write) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && #NULL == 0) && 0 == "0") && q_write_ev == 2) && 1 == c_dr_i) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && __retres1 == \result) && q_req_up == 0) && q_ev == 0) && __retres1 == \result) && __retres1 == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0)) || ((((((((((((((q_ev == 0 && c_num_read <= 0) && p_num_write == 0) && q_free == 1) && 0 <= c_num_read) && c_dr_pc == 1) && c_dr_st == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc <= 0) && !(q_req_up == 1)) && c_last_read == p_last_write) && q_write_ev == 2) && !(tmp___1 == 0))) || (((!(q_req_up == 1) || !(q_free == 0)) && 1 < q_write_ev) && ((((((((((c_dr_st == 2 && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && !(__retres1 == 0)) && !(tmp___1 == 0)) && c_dr_pc == 1) || (((((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_dw_st == 0) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && __retres1 == 0) && !(__retres1 == 0)) && c_dr_pc == 1)))) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((p_num_write == 1 && c_dr_st == 0) && \valid[0] == 0) && q_free == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && 0 <= q_buf_0 + 2147483648) && q_req_up == 1) && p_dw_pc == 1) && "pc_sfifo_2.cil-1.c" == 0) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && #NULL == 0) && 0 == "0") && q_write_ev == 2) && q_buf_0 <= 2147483647) && 1 == c_dr_i) && !(tmp == 0)) && tmp___1 <= 1) && #NULL == 0) && __retres1 == \result) && \valid["reach_error"] == 1) && tmp___0 <= 0) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && 0 <= tmp___0 + 2147483648) && 1 <= tmp___1) && 0 <= \result) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648) && c_last_read == 0) && 2 == p_dw_st) && 1 == kernel_st) && tmp == \result) && tmp___1 == \result) && a_t == 0) && tmp <= 2147483647) && \valid["0"] == 1) && p_last_write == q_buf_0) && tmp___0 <= 2147483647) && q_read_ev == 2) && 0 <= tmp___0) && 2 == unknown-#length-unknown["0"]) && q_ev == 0) && \result <= 0) && __retres1 == 0) && c_dr_pc == 0) && \result <= 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= \result)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 < q_write_ev) && p_dw_pc == 1) && c_dr_pc == 1) [2021-10-11 02:24:09,950 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(q_req_up == 1) || !(q_free == 0)) && 1 < q_write_ev) && (((((((((2 <= c_dr_st && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && __retres1 == 0) && !(tmp___1 == 0)) && c_dr_pc == 1) || (((((((c_dr_st == 2 && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && !(tmp___1 == 0)) && c_dr_pc == 1))) && 2 <= q_read_ev) && !(__retres1 == 0)) || ((((((((((((((((((((((((((((((((((((((((((((((tmp___0 == \result && 1 == kernel_st) && c_dr_st == 0) && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && tmp == \result) && tmp___1 == \result) && q_free == 1) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && tmp <= 2147483647) && q_buf_0 == 0) && \valid["0"] == 1) && p_last_write == q_buf_0) && "pc_sfifo_2.cil-1.c" == 0) && c_last_read == p_last_write) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && __retres1 == \result) && #NULL == 0) && q_write_ev == 2) && 0 == "0") && 1 == c_dr_i) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && __retres1 == \result) && q_req_up == 0) && q_ev == 0) && __retres1 == \result) && __retres1 == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648)) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 < q_write_ev) && p_dw_pc == 1) && !(tmp___1 == 0)) && c_dr_pc == 1)) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((p_num_write == 1 && \valid[0] == 0) && q_free == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && q_req_up == 1) && 0 <= q_buf_0 + 2147483648) && 0 <= c_dr_st) && p_dw_pc == 1) && 0 <= "pc_sfifo_2.cil-1.c") && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && __retres1 == \result) && #NULL == 0) && q_write_ev == 2) && q_buf_0 <= 2147483647) && "0" <= 0) && !(tmp == 0)) && __retres1 == \result) && __retres1 == \result) && \valid["reach_error"] == 1) && tmp___0 <= 0) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && c_dr_st <= 0) && 0 <= #NULL) && 1 <= c_dr_i) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648) && c_last_read == 0) && 2 == p_dw_st) && 1 == kernel_st) && tmp == \result) && tmp___1 == \result) && 0 <= "0") && a_t == 0) && tmp <= 2147483647) && \valid["0"] == 1) && p_last_write == q_buf_0) && c_dr_i <= 1) && q_read_ev == 2) && 0 <= tmp___0) && 2 == unknown-#length-unknown["0"]) && #NULL <= 0) && \result <= 0) && q_ev == 0) && __retres1 == 0) && c_dr_pc == 0) && "pc_sfifo_2.cil-1.c" <= 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= \result)) || ((((((((((((((q_ev == 0 && c_num_read <= 0) && p_num_write == 0) && q_free == 1) && 0 <= c_num_read) && c_dr_pc == 1) && c_dr_st == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc <= 0) && !(q_req_up == 1)) && c_last_read == p_last_write) && q_write_ev == 2) && !(tmp___1 == 0))) || (((((((((((q_req_up == 1 && c_dr_st == 2) && 2 <= p_dw_st) && p_num_write <= c_num_read) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 < q_write_ev) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && q_free == 1) && !(tmp___1 == 0)) && c_dr_pc == 1) [2021-10-11 02:24:09,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_st == 0) && q_ev == 0) && c_num_read <= 0) && p_num_write == 0) && q_free == 1) && 0 <= c_num_read) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 2 <= q_read_ev) && !(q_req_up == 1)) && q_write_ev == 2) && !(tmp___1 == 0)) || ((((((q_free == 0 && q_req_up == 1) && (((((((2 <= c_dr_st && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1) || ((((c_num_read + 1 <= p_num_write && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_pc == 1))) && 1 < q_write_ev) && !(p_dw_st == 0)) && 2 <= q_read_ev) && !(tmp___1 == 0))) || (((((((((((((((((((((((((((((((((((((((((((((((tmp___0 == \result && 1 == kernel_st) && c_dr_st == 0) && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && tmp == \result) && tmp___1 == \result) && q_free == 1) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && tmp <= 2147483647) && q_buf_0 == 0) && \valid["0"] == 1) && p_last_write == q_buf_0) && "pc_sfifo_2.cil-1.c" == 0) && c_last_read == p_last_write) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && __retres1 == \result) && #NULL == 0) && q_write_ev == 2) && 0 == "0") && p_dw_st == 1) && 1 == c_dr_i) && !(tmp == 0)) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && __retres1 == \result) && q_req_up == 0) && q_ev == 0) && __retres1 == \result) && __retres1 == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648)) || ((((((((((((((((((((((((((((((((((((((((((((((((p_num_write == 1 && tmp___0 == \result) && c_dr_st == 0) && __retres1 == 0) && \valid[0] == 0) && q_free == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && 0 <= q_buf_0 + 2147483648) && q_req_up == 1) && "pc_sfifo_2.cil-1.c" == 0) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && __retres1 == \result) && #NULL == 0) && 0 == "0") && q_write_ev == 2) && q_buf_0 <= 2147483647) && 1 == c_dr_i) && !(tmp == 0)) && #NULL == 0) && __retres1 == \result) && __retres1 == \result) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648) && c_last_read == 0) && 1 == kernel_st) && tmp == \result) && tmp___1 == \result) && a_t == 0) && tmp <= 2147483647) && p_last_write == q_buf_0) && \valid["0"] == 1) && p_dw_st == 1) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && q_ev == 0) && __retres1 == 0) && c_dr_pc == 0) && p_dw_pc == 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) [2021-10-11 02:24:09,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((((c_last_read == 0 && tmp___0 == \result) && 1 == kernel_st) && c_dr_st == 0) && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && tmp == \result) && tmp___1 == \result) && q_free == 1) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && tmp <= 2147483647) && q_buf_0 == 0) && p_last_write == q_buf_0) && \valid["0"] == 1) && "pc_sfifo_2.cil-1.c" == 0) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && __retres1 == \result) && #NULL == 0) && 0 == "0") && q_write_ev == 2) && p_dw_st == 1) && 1 == c_dr_i) && !(tmp == 0)) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && __retres1 == \result) && q_req_up == 0) && q_ev == 0) && __retres1 == \result) && __retres1 == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648) || ((((((((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && __retres1 == 0) && c_dr_pc == 1) || ((((c_dr_st == 2 && p_num_write <= c_num_read) && p_last_write == q_buf_0) && c_num_read < p_num_write + 1) && c_dr_pc == 1)) && (!(q_req_up == 1) || !(q_free == 0))) && 1 < q_write_ev) && !(p_dw_st == 0)) && 2 <= q_read_ev) && !(tmp___1 == 0)) [2021-10-11 02:24:09,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 < c_dr_st && q_ev == 0) && c_num_read <= 0) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && 0 <= c_num_read) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_pc <= 0) && p_last_write == q_buf_0) && !(q_req_up == 1)) && c_last_read == p_last_write) && q_write_ev == 2) && !(tmp___1 == 0)) || ((((((((((0 < c_dr_st && q_req_up == 1) && 2 <= p_dw_st) && p_num_write <= c_num_read) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 < q_write_ev) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && q_free == 1) && !(tmp___1 == 0))) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((p_num_write == 1 && \valid[0] == 0) && q_free == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && 0 <= q_buf_0 + 2147483648) && q_req_up == 1) && p_dw_pc == 1) && "pc_sfifo_2.cil-1.c" == 0) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && #NULL == 0) && q_write_ev == 2) && 0 == "0") && q_buf_0 <= 2147483647) && 1 == c_dr_i) && !(tmp == 0)) && tmp___1 <= 1) && #NULL == 0) && __retres1 == \result) && \valid["reach_error"] == 1) && !(tmp___0 == 0)) && tmp___0 <= 0) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && 0 <= tmp___0 + 2147483648) && 1 <= tmp___1) && 0 <= \result) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648) && c_last_read == 0) && 2 == p_dw_st) && 1 == kernel_st) && tmp == \result) && tmp___1 == \result) && c_dr_st == 1) && a_t == 0) && tmp <= 2147483647) && \valid["0"] == 1) && p_last_write == q_buf_0) && tmp___0 <= 2147483647) && q_read_ev == 2) && 0 <= tmp___0) && 2 == unknown-#length-unknown["0"]) && q_ev == 0) && \result <= 0) && __retres1 == 0) && c_dr_pc == 0) && \result <= 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= \result) [2021-10-11 02:24:10,008 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b055d-a829-4e47-a326-5824515752dd/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:24:10,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:24:10,010 INFO L168 Benchmark]: Toolchain (without parser) took 33535.42 ms. Allocated memory was 92.3 MB in the beginning and 587.2 MB in the end (delta: 494.9 MB). Free memory was 51.5 MB in the beginning and 235.2 MB in the end (delta: -183.6 MB). Peak memory consumption was 310.3 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:10,010 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 92.3 MB. Free memory is still 67.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:24:10,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.51 ms. Allocated memory is still 92.3 MB. Free memory was 51.3 MB in the beginning and 65.3 MB in the end (delta: -14.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:10,011 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.94 ms. Allocated memory is still 92.3 MB. Free memory was 65.3 MB in the beginning and 63.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:10,011 INFO L168 Benchmark]: Boogie Preprocessor took 34.81 ms. Allocated memory is still 92.3 MB. Free memory was 63.0 MB in the beginning and 61.2 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:24:10,012 INFO L168 Benchmark]: RCFGBuilder took 1458.86 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 61.2 MB in the beginning and 43.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:10,012 INFO L168 Benchmark]: TraceAbstraction took 31433.59 ms. Allocated memory was 111.1 MB in the beginning and 587.2 MB in the end (delta: 476.1 MB). Free memory was 42.6 MB in the beginning and 242.5 MB in the end (delta: -199.9 MB). Peak memory consumption was 326.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:10,013 INFO L168 Benchmark]: Witness Printer took 105.92 ms. Allocated memory is still 587.2 MB. Free memory was 242.5 MB in the beginning and 235.2 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:10,016 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.36 ms. Allocated memory is still 92.3 MB. Free memory is still 67.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 418.51 ms. Allocated memory is still 92.3 MB. Free memory was 51.3 MB in the beginning and 65.3 MB in the end (delta: -14.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.94 ms. Allocated memory is still 92.3 MB. Free memory was 65.3 MB in the beginning and 63.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.81 ms. Allocated memory is still 92.3 MB. Free memory was 63.0 MB in the beginning and 61.2 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 1458.86 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 61.2 MB in the beginning and 43.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 31433.59 ms. Allocated memory was 111.1 MB in the beginning and 587.2 MB in the end (delta: 476.1 MB). Free memory was 42.6 MB in the beginning and 242.5 MB in the end (delta: -199.9 MB). Peak memory consumption was 326.1 MB. Max. memory is 16.1 GB. * Witness Printer took 105.92 ms. Allocated memory is still 587.2 MB. Free memory was 242.5 MB in the beginning and 235.2 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((q_req_up == 1 && c_dr_st == 2) && 2 <= p_dw_st) && 1 < q_write_ev) && 2 <= q_read_ev) && ((((((p_num_write <= c_num_read && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && __retres1 == 0) && c_dr_pc == 1) || (((((p_num_write <= c_num_read && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && !(tmp___1 == 0)) && c_dr_pc == 1))) && q_free == 1) || (((((((((((((((((((((((((((((((((((((((((tmp___0 == \result && 1 == kernel_st) && c_dr_st == 0) && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && tmp == \result) && q_free == 1) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && q_buf_0 == 0) && \valid["0"] == 1) && p_last_write == q_buf_0) && "pc_sfifo_2.cil-1.c" == 0) && c_last_read == p_last_write) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && #NULL == 0) && 0 == "0") && q_write_ev == 2) && 1 == c_dr_i) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && __retres1 == \result) && q_req_up == 0) && q_ev == 0) && __retres1 == \result) && __retres1 == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0)) || ((((((((((((((q_ev == 0 && c_num_read <= 0) && p_num_write == 0) && q_free == 1) && 0 <= c_num_read) && c_dr_pc == 1) && c_dr_st == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc <= 0) && !(q_req_up == 1)) && c_last_read == p_last_write) && q_write_ev == 2) && !(tmp___1 == 0))) || (((!(q_req_up == 1) || !(q_free == 0)) && 1 < q_write_ev) && ((((((((((c_dr_st == 2 && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && !(__retres1 == 0)) && !(tmp___1 == 0)) && c_dr_pc == 1) || (((((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_dw_st == 0) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && __retres1 == 0) && !(__retres1 == 0)) && c_dr_pc == 1)))) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((p_num_write == 1 && c_dr_st == 0) && \valid[0] == 0) && q_free == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && 0 <= q_buf_0 + 2147483648) && q_req_up == 1) && p_dw_pc == 1) && "pc_sfifo_2.cil-1.c" == 0) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && #NULL == 0) && 0 == "0") && q_write_ev == 2) && q_buf_0 <= 2147483647) && 1 == c_dr_i) && !(tmp == 0)) && tmp___1 <= 1) && #NULL == 0) && __retres1 == \result) && \valid["reach_error"] == 1) && tmp___0 <= 0) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && 0 <= tmp___0 + 2147483648) && 1 <= tmp___1) && 0 <= \result) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648) && c_last_read == 0) && 2 == p_dw_st) && 1 == kernel_st) && tmp == \result) && tmp___1 == \result) && a_t == 0) && tmp <= 2147483647) && \valid["0"] == 1) && p_last_write == q_buf_0) && tmp___0 <= 2147483647) && q_read_ev == 2) && 0 <= tmp___0) && 2 == unknown-#length-unknown["0"]) && q_ev == 0) && \result <= 0) && __retres1 == 0) && c_dr_pc == 0) && \result <= 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= \result)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 < q_write_ev) && p_dw_pc == 1) && c_dr_pc == 1) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((c_last_read == 0 && tmp___0 == \result) && 1 == kernel_st) && c_dr_st == 0) && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && tmp == \result) && tmp___1 == \result) && q_free == 1) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && tmp <= 2147483647) && q_buf_0 == 0) && p_last_write == q_buf_0) && \valid["0"] == 1) && "pc_sfifo_2.cil-1.c" == 0) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && __retres1 == \result) && #NULL == 0) && 0 == "0") && q_write_ev == 2) && p_dw_st == 1) && 1 == c_dr_i) && !(tmp == 0)) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && __retres1 == \result) && q_req_up == 0) && q_ev == 0) && __retres1 == \result) && __retres1 == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648) || ((((((((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && __retres1 == 0) && c_dr_pc == 1) || ((((c_dr_st == 2 && p_num_write <= c_num_read) && p_last_write == q_buf_0) && c_num_read < p_num_write + 1) && c_dr_pc == 1)) && (!(q_req_up == 1) || !(q_free == 0))) && 1 < q_write_ev) && !(p_dw_st == 0)) && 2 <= q_read_ev) && !(tmp___1 == 0)) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((!(q_req_up == 1) || !(q_free == 0)) && 1 < q_write_ev) && (((((((((2 <= c_dr_st && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && __retres1 == 0) && !(tmp___1 == 0)) && c_dr_pc == 1) || (((((((c_dr_st == 2 && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && !(tmp___1 == 0)) && c_dr_pc == 1))) && 2 <= q_read_ev) && !(__retres1 == 0)) || ((((((((((((((((((((((((((((((((((((((((((((((tmp___0 == \result && 1 == kernel_st) && c_dr_st == 0) && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && tmp == \result) && tmp___1 == \result) && q_free == 1) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && tmp <= 2147483647) && q_buf_0 == 0) && \valid["0"] == 1) && p_last_write == q_buf_0) && "pc_sfifo_2.cil-1.c" == 0) && c_last_read == p_last_write) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && __retres1 == \result) && #NULL == 0) && q_write_ev == 2) && 0 == "0") && 1 == c_dr_i) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && __retres1 == \result) && q_req_up == 0) && q_ev == 0) && __retres1 == \result) && __retres1 == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648)) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 < q_write_ev) && p_dw_pc == 1) && !(tmp___1 == 0)) && c_dr_pc == 1)) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((p_num_write == 1 && \valid[0] == 0) && q_free == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && q_req_up == 1) && 0 <= q_buf_0 + 2147483648) && 0 <= c_dr_st) && p_dw_pc == 1) && 0 <= "pc_sfifo_2.cil-1.c") && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && __retres1 == \result) && #NULL == 0) && q_write_ev == 2) && q_buf_0 <= 2147483647) && "0" <= 0) && !(tmp == 0)) && __retres1 == \result) && __retres1 == \result) && \valid["reach_error"] == 1) && tmp___0 <= 0) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && c_dr_st <= 0) && 0 <= #NULL) && 1 <= c_dr_i) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648) && c_last_read == 0) && 2 == p_dw_st) && 1 == kernel_st) && tmp == \result) && tmp___1 == \result) && 0 <= "0") && a_t == 0) && tmp <= 2147483647) && \valid["0"] == 1) && p_last_write == q_buf_0) && c_dr_i <= 1) && q_read_ev == 2) && 0 <= tmp___0) && 2 == unknown-#length-unknown["0"]) && #NULL <= 0) && \result <= 0) && q_ev == 0) && __retres1 == 0) && c_dr_pc == 0) && "pc_sfifo_2.cil-1.c" <= 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= \result)) || ((((((((((((((q_ev == 0 && c_num_read <= 0) && p_num_write == 0) && q_free == 1) && 0 <= c_num_read) && c_dr_pc == 1) && c_dr_st == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc <= 0) && !(q_req_up == 1)) && c_last_read == p_last_write) && q_write_ev == 2) && !(tmp___1 == 0))) || (((((((((((q_req_up == 1 && c_dr_st == 2) && 2 <= p_dw_st) && p_num_write <= c_num_read) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 < q_write_ev) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && q_free == 1) && !(tmp___1 == 0)) && c_dr_pc == 1) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((((q_req_up == 1 && c_dr_st == 2) && 2 <= p_dw_st) && p_num_write <= c_num_read) && 1 < q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && q_free == 1) && c_dr_pc == 1) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 < q_write_ev) && p_dw_pc == 1) && c_dr_pc == 1) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && 1 < q_write_ev) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1) || (((((((((((q_read_ev == 1 && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && (!(q_req_up == 1) || !(q_free == 0))) && 1 < q_write_ev) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_num_read < p_num_write + 1) && !(__retres1 == 0)) && c_dr_pc == 1)) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && q_write_ev == 1) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1) - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((((((((0 < c_dr_st && q_ev == 0) && c_num_read <= 0) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && 0 <= c_num_read) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_pc <= 0) && p_last_write == q_buf_0) && !(q_req_up == 1)) && c_last_read == p_last_write) && q_write_ev == 2) && !(tmp___1 == 0)) || ((((((((((0 < c_dr_st && q_req_up == 1) && 2 <= p_dw_st) && p_num_write <= c_num_read) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 < q_write_ev) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && q_free == 1) && !(tmp___1 == 0))) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((p_num_write == 1 && \valid[0] == 0) && q_free == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && 0 <= q_buf_0 + 2147483648) && q_req_up == 1) && p_dw_pc == 1) && "pc_sfifo_2.cil-1.c" == 0) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && #NULL == 0) && q_write_ev == 2) && 0 == "0") && q_buf_0 <= 2147483647) && 1 == c_dr_i) && !(tmp == 0)) && tmp___1 <= 1) && #NULL == 0) && __retres1 == \result) && \valid["reach_error"] == 1) && !(tmp___0 == 0)) && tmp___0 <= 0) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && 0 <= tmp___0 + 2147483648) && 1 <= tmp___1) && 0 <= \result) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648) && c_last_read == 0) && 2 == p_dw_st) && 1 == kernel_st) && tmp == \result) && tmp___1 == \result) && c_dr_st == 1) && a_t == 0) && tmp <= 2147483647) && \valid["0"] == 1) && p_last_write == q_buf_0) && tmp___0 <= 2147483647) && q_read_ev == 2) && 0 <= tmp___0) && 2 == unknown-#length-unknown["0"]) && q_ev == 0) && \result <= 0) && __retres1 == 0) && c_dr_pc == 0) && \result <= 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= \result) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && tmp == \result) && q_free == 1) && 0 == kernel_st) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && \valid["0"] == 1) && p_last_write == q_buf_0) && "pc_sfifo_2.cil-1.c" == 0) && c_last_read == p_last_write) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && #NULL == 0) && q_write_ev == 2) && 0 == "0") && 1 == c_dr_i) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && q_req_up == 0) && q_ev == 0) && __retres1 == \result) && __retres1 == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && p_last_write == 0 - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_st == 0) && q_ev == 0) && c_num_read <= 0) && p_num_write == 0) && q_free == 1) && 0 <= c_num_read) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 2 <= q_read_ev) && !(q_req_up == 1)) && q_write_ev == 2) && !(tmp___1 == 0)) || ((((((q_free == 0 && q_req_up == 1) && (((((((2 <= c_dr_st && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1) || ((((c_num_read + 1 <= p_num_write && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_pc == 1))) && 1 < q_write_ev) && !(p_dw_st == 0)) && 2 <= q_read_ev) && !(tmp___1 == 0))) || (((((((((((((((((((((((((((((((((((((((((((((((tmp___0 == \result && 1 == kernel_st) && c_dr_st == 0) && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && tmp == \result) && tmp___1 == \result) && q_free == 1) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && tmp <= 2147483647) && q_buf_0 == 0) && \valid["0"] == 1) && p_last_write == q_buf_0) && "pc_sfifo_2.cil-1.c" == 0) && c_last_read == p_last_write) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && __retres1 == \result) && #NULL == 0) && q_write_ev == 2) && 0 == "0") && p_dw_st == 1) && 1 == c_dr_i) && !(tmp == 0)) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && __retres1 == \result) && q_req_up == 0) && q_ev == 0) && __retres1 == \result) && __retres1 == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648)) || ((((((((((((((((((((((((((((((((((((((((((((((((p_num_write == 1 && tmp___0 == \result) && c_dr_st == 0) && __retres1 == 0) && \valid[0] == 0) && q_free == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && 0 <= q_buf_0 + 2147483648) && q_req_up == 1) && "pc_sfifo_2.cil-1.c" == 0) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && __retres1 == \result) && #NULL == 0) && 0 == "0") && q_write_ev == 2) && q_buf_0 <= 2147483647) && 1 == c_dr_i) && !(tmp == 0)) && #NULL == 0) && __retres1 == \result) && __retres1 == \result) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 <= tmp + 2147483648) && c_last_read == 0) && 1 == kernel_st) && tmp == \result) && tmp___1 == \result) && a_t == 0) && tmp <= 2147483647) && p_last_write == q_buf_0) && \valid["0"] == 1) && p_dw_st == 1) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && q_ev == 0) && __retres1 == 0) && c_dr_pc == 0) && p_dw_pc == 0) && __retres1 == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((((((((q_read_ev == 1 && c_dr_st == 2) && p_num_write <= c_num_read) && (!(q_req_up == 1) || !(q_free == 0))) && 1 < q_write_ev) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && !(__retres1 == 0)) && c_dr_pc == 1) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && (1 < q_write_ev || q_write_ev == 1)) && __retres1 == 0) && c_dr_pc == 1) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && 1 < q_write_ev) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1) || (((((((((((2 <= c_dr_st && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && 2 <= q_read_ev) && (!(q_req_up == 1) || !(q_free == 0))) && 1 < q_write_ev) && p_dw_pc == 1) && c_num_read < p_num_write + 1) && __retres1 == 0) && !(__retres1 == 0)) && c_dr_pc == 1)) || (((((((((((((((((((((((((((((((((((((((((tmp___0 == \result && c_dr_st == 0) && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && tmp == \result) && q_free == 1) && 0 == kernel_st) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && q_buf_0 == 0) && \valid["0"] == 1) && p_last_write == q_buf_0) && "pc_sfifo_2.cil-1.c" == 0) && c_last_read == p_last_write) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && #NULL == 0) && q_write_ev == 2) && 0 == "0") && 1 == c_dr_i) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && __retres1 == \result) && q_req_up == 0) && q_ev == 0) && __retres1 == \result) && __retres1 == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((c_dr_st == 0 && __retres1 == 0) && \valid[0] == 0) && p_num_write == 0) && q_free == 1) && 0 == kernel_st) && a_t == 0) && \valid["pc_sfifo_2.cil-1.c"] == 1) && \valid["0"] == 1) && p_last_write == q_buf_0) && "pc_sfifo_2.cil-1.c" == 0) && c_last_read == p_last_write) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "pc_sfifo_2.cil-1.c") && 19 == unknown-#length-unknown["pc_sfifo_2.cil-1.c"]) && #NULL == 0) && q_write_ev == 2) && 0 == "0") && 1 == c_dr_i) && q_read_ev == 2) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && q_ev == 0) && q_req_up == 0) && c_dr_pc == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && p_last_write == 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((q_free == 0 && 0 < c_dr_st) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && 1 < q_write_ev) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && !(tmp___1 == 0)) && c_dr_pc == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 21.0s, OverallIterations: 19, TraceHistogramMax: 6, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1218 SDtfs, 1755 SDslu, 1887 SDs, 0 SdLazy, 996 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 662 SyntacticMatches, 17 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 737 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 95 NumberOfFragments, 2955 HoareAnnotationTreeSize, 14 FomulaSimplifications, 230312 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 14 FomulaSimplificationsInter, 62105 FormulaSimplificationTreeSizeReductionInter, 8.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1153 NumberOfCodeBlocks, 1153 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1440 ConstructedInterpolants, 0 QuantifiedInterpolants, 260051 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1654 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 31 InterpolantComputations, 19 PerfectInterpolantSequences, 637/741 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: OVERALL_TIME[ms]: 1472, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 25, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 31, TOOLS_POST_TIME[ms]: 519, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 31, TOOLS_QUANTIFIERELIM_TIME[ms]: 485, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 228, FLUID_QUERY_TIME[ms]: 6, FLUID_QUERIES: 61, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME[ms]: 394, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 364, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME[ms]: 12, DOMAIN_ISBOTTOM_APPLICATIONS: 25, DOMAIN_ISBOTTOM_TIME[ms]: 83, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 440, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 440, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 5, PATH_EXPR_TIME[ms]: 5, REGEX_TO_DAG_TIME[ms]: 8, DAG_COMPRESSION_TIME[ms]: 26, DAG_COMPRESSION_PROCESSED_NODES: 381, DAG_COMPRESSION_RETAINED_NODES: 61, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...