./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/podwr000_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/podwr000_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebb01fcdd18feaa294052444a4405be118fcc862 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:41:53,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:41:53,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:41:53,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:41:53,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:41:53,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:41:53,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:41:53,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:41:53,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:41:53,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:41:53,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:41:53,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:41:53,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:41:53,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:41:53,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:41:53,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:41:53,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:41:53,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:41:53,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:41:53,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:41:53,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:41:53,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:41:53,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:41:53,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:41:53,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:41:53,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:41:53,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:41:53,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:41:53,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:41:53,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:41:53,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:41:53,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:41:53,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:41:53,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:41:53,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:41:53,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:41:53,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:41:53,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:41:53,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:41:53,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:41:53,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:41:53,695 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 15:41:53,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:41:53,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:41:53,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:41:53,709 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:41:53,709 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:41:53,710 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:41:53,710 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 15:41:53,710 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:41:53,710 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:41:53,710 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 15:41:53,710 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 15:41:53,711 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:41:53,711 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 15:41:53,711 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 15:41:53,711 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 15:41:53,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:41:53,712 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:41:53,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:41:53,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:41:53,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:41:53,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:41:53,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:41:53,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:41:53,713 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:41:53,713 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:41:53,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:41:53,714 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:41:53,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:41:53,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:41:53,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:41:53,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:41:53,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:41:53,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:41:53,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:41:53,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:41:53,715 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 15:41:53,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:41:53,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:41:53,716 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:41:53,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:41:53,716 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan 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(__VERIFIER_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 -> ebb01fcdd18feaa294052444a4405be118fcc862 [2019-12-07 15:41:53,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:41:53,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:41:53,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:41:53,826 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:41:53,826 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:41:53,827 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/podwr000_tso.oepc.i [2019-12-07 15:41:53,868 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan/data/740677e29/c04defbd138844d4b96ce2cfb6b524b7/FLAG850f38cd2 [2019-12-07 15:41:54,326 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:41:54,327 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/sv-benchmarks/c/pthread-wmm/podwr000_tso.oepc.i [2019-12-07 15:41:54,337 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan/data/740677e29/c04defbd138844d4b96ce2cfb6b524b7/FLAG850f38cd2 [2019-12-07 15:41:54,346 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan/data/740677e29/c04defbd138844d4b96ce2cfb6b524b7 [2019-12-07 15:41:54,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:41:54,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:41:54,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:41:54,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:41:54,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:41:54,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:41:54" (1/1) ... [2019-12-07 15:41:54,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54, skipping insertion in model container [2019-12-07 15:41:54,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:41:54" (1/1) ... [2019-12-07 15:41:54,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:41:54,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:41:54,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:41:54,635 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:41:54,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:41:54,723 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:41:54,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54 WrapperNode [2019-12-07 15:41:54,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:41:54,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:41:54,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:41:54,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:41:54,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54" (1/1) ... [2019-12-07 15:41:54,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54" (1/1) ... [2019-12-07 15:41:54,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:41:54,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:41:54,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:41:54,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:41:54,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54" (1/1) ... [2019-12-07 15:41:54,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54" (1/1) ... [2019-12-07 15:41:54,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54" (1/1) ... [2019-12-07 15:41:54,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54" (1/1) ... [2019-12-07 15:41:54,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54" (1/1) ... [2019-12-07 15:41:54,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54" (1/1) ... [2019-12-07 15:41:54,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54" (1/1) ... [2019-12-07 15:41:54,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:41:54,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:41:54,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:41:54,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:41:54,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan/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 [2019-12-07 15:41:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:41:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 15:41:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:41:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:41:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 15:41:54,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 15:41:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 15:41:54,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 15:41:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 15:41:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:41:54,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:41:54,834 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 15:41:55,160 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:41:55,161 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 15:41:55,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:41:55 BoogieIcfgContainer [2019-12-07 15:41:55,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:41:55,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:41:55,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:41:55,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:41:55,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:41:54" (1/3) ... [2019-12-07 15:41:55,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d87d7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:41:55, skipping insertion in model container [2019-12-07 15:41:55,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:41:54" (2/3) ... [2019-12-07 15:41:55,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d87d7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:41:55, skipping insertion in model container [2019-12-07 15:41:55,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:41:55" (3/3) ... [2019-12-07 15:41:55,166 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_tso.oepc.i [2019-12-07 15:41:55,172 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 15:41:55,172 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:41:55,177 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 15:41:55,177 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 15:41:55,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,206 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,206 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:41:55,228 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 15:41:55,241 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:41:55,241 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:41:55,241 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:41:55,241 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:41:55,241 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:41:55,241 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:41:55,241 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:41:55,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:41:55,252 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 15:41:55,253 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 15:41:55,306 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 15:41:55,306 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:41:55,317 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 15:41:55,330 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 15:41:55,355 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 15:41:55,355 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:41:55,359 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 15:41:55,369 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 15:41:55,370 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 15:41:58,003 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 15:41:58,118 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-07 15:41:58,119 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-07 15:41:58,121 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 15:41:58,446 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-07 15:41:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-07 15:41:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 15:41:58,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:41:58,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 15:41:58,452 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:41:58,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:41:58,455 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-07 15:41:58,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:41:58,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141561749] [2019-12-07 15:41:58,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:41:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:41:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:41:58,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141561749] [2019-12-07 15:41:58,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:41:58,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:41:58,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001963769] [2019-12-07 15:41:58,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:41:58,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:41:58,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:41:58,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:41:58,604 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-07 15:41:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:41:58,762 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-07 15:41:58,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:41:58,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 15:41:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:41:58,819 INFO L225 Difference]: With dead ends: 8074 [2019-12-07 15:41:58,820 INFO L226 Difference]: Without dead ends: 7606 [2019-12-07 15:41:58,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:41:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-07 15:41:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-07 15:41:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-07 15:41:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-07 15:41:59,074 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-07 15:41:59,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:41:59,075 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-07 15:41:59,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:41:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-07 15:41:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 15:41:59,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:41:59,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:41:59,078 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:41:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:41:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-07 15:41:59,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:41:59,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129643346] [2019-12-07 15:41:59,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:41:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:41:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:41:59,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129643346] [2019-12-07 15:41:59,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:41:59,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:41:59,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284317071] [2019-12-07 15:41:59,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:41:59,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:41:59,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:41:59,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:41:59,139 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-07 15:41:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:41:59,391 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-07 15:41:59,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:41:59,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 15:41:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:41:59,457 INFO L225 Difference]: With dead ends: 11630 [2019-12-07 15:41:59,458 INFO L226 Difference]: Without dead ends: 11623 [2019-12-07 15:41:59,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:41:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-07 15:41:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-07 15:41:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-07 15:41:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-07 15:41:59,738 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-07 15:41:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:41:59,738 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-07 15:41:59,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:41:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-07 15:41:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:41:59,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:41:59,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:41:59,743 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:41:59,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:41:59,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-07 15:41:59,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:41:59,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21312108] [2019-12-07 15:41:59,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:41:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:41:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:41:59,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21312108] [2019-12-07 15:41:59,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:41:59,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:41:59,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685188191] [2019-12-07 15:41:59,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:41:59,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:41:59,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:41:59,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:41:59,796 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-07 15:42:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:00,035 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-07 15:42:00,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:42:00,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 15:42:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:00,067 INFO L225 Difference]: With dead ends: 14471 [2019-12-07 15:42:00,067 INFO L226 Difference]: Without dead ends: 14471 [2019-12-07 15:42:00,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:42:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-07 15:42:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-07 15:42:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-07 15:42:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-07 15:42:00,308 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-07 15:42:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:00,309 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-07 15:42:00,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:42:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-07 15:42:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:42:00,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:00,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:00,312 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-07 15:42:00,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:00,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45177467] [2019-12-07 15:42:00,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:00,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45177467] [2019-12-07 15:42:00,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:00,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:42:00,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031216118] [2019-12-07 15:42:00,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:42:00,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:00,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:42:00,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:42:00,364 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-07 15:42:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:00,399 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-07 15:42:00,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:42:00,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 15:42:00,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:00,414 INFO L225 Difference]: With dead ends: 10750 [2019-12-07 15:42:00,414 INFO L226 Difference]: Without dead ends: 10750 [2019-12-07 15:42:00,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:42:00,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-07 15:42:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-07 15:42:00,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-07 15:42:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-07 15:42:00,623 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-07 15:42:00,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:00,623 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-07 15:42:00,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:42:00,623 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-07 15:42:00,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:42:00,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:00,625 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:00,625 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-07 15:42:00,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:00,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47232784] [2019-12-07 15:42:00,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:00,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47232784] [2019-12-07 15:42:00,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:00,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:42:00,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107987919] [2019-12-07 15:42:00,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:42:00,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:00,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:42:00,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:42:00,669 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-12-07 15:42:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:00,691 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-12-07 15:42:00,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:42:00,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 15:42:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:00,694 INFO L225 Difference]: With dead ends: 2054 [2019-12-07 15:42:00,694 INFO L226 Difference]: Without dead ends: 1457 [2019-12-07 15:42:00,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:42:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-12-07 15:42:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-12-07 15:42:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-12-07 15:42:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-12-07 15:42:00,715 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-12-07 15:42:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:00,716 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-12-07 15:42:00,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:42:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-12-07 15:42:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 15:42:00,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:00,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:00,718 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:00,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:00,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-07 15:42:00,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:00,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924750576] [2019-12-07 15:42:00,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:00,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924750576] [2019-12-07 15:42:00,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:00,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:42:00,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189188436] [2019-12-07 15:42:00,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:42:00,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:00,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:42:00,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:42:00,784 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-12-07 15:42:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:01,039 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-12-07 15:42:01,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:42:01,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 15:42:01,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:01,041 INFO L225 Difference]: With dead ends: 2249 [2019-12-07 15:42:01,041 INFO L226 Difference]: Without dead ends: 2197 [2019-12-07 15:42:01,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:42:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-12-07 15:42:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-12-07 15:42:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-07 15:42:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-12-07 15:42:01,058 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-12-07 15:42:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:01,058 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-12-07 15:42:01,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:42:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-12-07 15:42:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 15:42:01,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:01,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:01,060 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-07 15:42:01,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:01,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146094413] [2019-12-07 15:42:01,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:01,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146094413] [2019-12-07 15:42:01,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:01,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:42:01,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706905293] [2019-12-07 15:42:01,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:42:01,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:01,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:42:01,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:42:01,134 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 5 states. [2019-12-07 15:42:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:01,160 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-12-07 15:42:01,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:42:01,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 15:42:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:01,162 INFO L225 Difference]: With dead ends: 752 [2019-12-07 15:42:01,162 INFO L226 Difference]: Without dead ends: 689 [2019-12-07 15:42:01,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:42:01,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-12-07 15:42:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-12-07 15:42:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-07 15:42:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-07 15:42:01,168 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-12-07 15:42:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:01,168 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-07 15:42:01,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:42:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-07 15:42:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 15:42:01,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:01,170 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:01,170 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:01,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:01,170 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-07 15:42:01,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:01,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308802118] [2019-12-07 15:42:01,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:01,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308802118] [2019-12-07 15:42:01,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:01,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:42:01,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752638206] [2019-12-07 15:42:01,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:42:01,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:01,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:42:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:42:01,237 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 5 states. [2019-12-07 15:42:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:01,456 INFO L93 Difference]: Finished difference Result 1105 states and 2341 transitions. [2019-12-07 15:42:01,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:42:01,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 15:42:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:01,457 INFO L225 Difference]: With dead ends: 1105 [2019-12-07 15:42:01,458 INFO L226 Difference]: Without dead ends: 1105 [2019-12-07 15:42:01,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:42:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-12-07 15:42:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 896. [2019-12-07 15:42:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-12-07 15:42:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1944 transitions. [2019-12-07 15:42:01,466 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1944 transitions. Word has length 51 [2019-12-07 15:42:01,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:01,466 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1944 transitions. [2019-12-07 15:42:01,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:42:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1944 transitions. [2019-12-07 15:42:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 15:42:01,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:01,468 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:01,468 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:01,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1015680243, now seen corresponding path program 2 times [2019-12-07 15:42:01,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:01,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367090642] [2019-12-07 15:42:01,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:01,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367090642] [2019-12-07 15:42:01,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:01,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:42:01,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015058035] [2019-12-07 15:42:01,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:42:01,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:01,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:42:01,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:42:01,534 INFO L87 Difference]: Start difference. First operand 896 states and 1944 transitions. Second operand 3 states. [2019-12-07 15:42:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:01,571 INFO L93 Difference]: Finished difference Result 1184 states and 2559 transitions. [2019-12-07 15:42:01,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:42:01,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 15:42:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:01,573 INFO L225 Difference]: With dead ends: 1184 [2019-12-07 15:42:01,573 INFO L226 Difference]: Without dead ends: 1184 [2019-12-07 15:42:01,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:42:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-12-07 15:42:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 956. [2019-12-07 15:42:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-07 15:42:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2092 transitions. [2019-12-07 15:42:01,586 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2092 transitions. Word has length 51 [2019-12-07 15:42:01,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:01,586 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2092 transitions. [2019-12-07 15:42:01,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:42:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2092 transitions. [2019-12-07 15:42:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:42:01,588 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:01,588 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:01,588 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:01,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:01,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-12-07 15:42:01,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:01,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616425830] [2019-12-07 15:42:01,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:01,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616425830] [2019-12-07 15:42:01,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:01,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 15:42:01,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868707052] [2019-12-07 15:42:01,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 15:42:01,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:01,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 15:42:01,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:42:01,779 INFO L87 Difference]: Start difference. First operand 956 states and 2092 transitions. Second operand 10 states. [2019-12-07 15:42:02,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:02,150 INFO L93 Difference]: Finished difference Result 2426 states and 5230 transitions. [2019-12-07 15:42:02,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:42:02,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-07 15:42:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:02,152 INFO L225 Difference]: With dead ends: 2426 [2019-12-07 15:42:02,152 INFO L226 Difference]: Without dead ends: 1445 [2019-12-07 15:42:02,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:42:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-12-07 15:42:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1196. [2019-12-07 15:42:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1196 states. [2019-12-07 15:42:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 2625 transitions. [2019-12-07 15:42:02,184 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 2625 transitions. Word has length 52 [2019-12-07 15:42:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:02,184 INFO L462 AbstractCegarLoop]: Abstraction has 1196 states and 2625 transitions. [2019-12-07 15:42:02,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 15:42:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 2625 transitions. [2019-12-07 15:42:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:42:02,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:02,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:02,187 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash -19134580, now seen corresponding path program 2 times [2019-12-07 15:42:02,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:02,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989976214] [2019-12-07 15:42:02,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:02,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989976214] [2019-12-07 15:42:02,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:02,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 15:42:02,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895627225] [2019-12-07 15:42:02,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 15:42:02,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:02,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 15:42:02,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:42:02,398 INFO L87 Difference]: Start difference. First operand 1196 states and 2625 transitions. Second operand 14 states. [2019-12-07 15:42:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:04,321 INFO L93 Difference]: Finished difference Result 2290 states and 4860 transitions. [2019-12-07 15:42:04,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 15:42:04,321 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-12-07 15:42:04,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:04,323 INFO L225 Difference]: With dead ends: 2290 [2019-12-07 15:42:04,323 INFO L226 Difference]: Without dead ends: 2063 [2019-12-07 15:42:04,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=340, Invalid=920, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 15:42:04,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2019-12-07 15:42:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1416. [2019-12-07 15:42:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-12-07 15:42:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 3133 transitions. [2019-12-07 15:42:04,342 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 3133 transitions. Word has length 52 [2019-12-07 15:42:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:04,343 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 3133 transitions. [2019-12-07 15:42:04,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 15:42:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 3133 transitions. [2019-12-07 15:42:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:42:04,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:04,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:04,345 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:04,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1293090272, now seen corresponding path program 3 times [2019-12-07 15:42:04,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:04,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303152283] [2019-12-07 15:42:04,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:04,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303152283] [2019-12-07 15:42:04,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:04,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 15:42:04,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508980626] [2019-12-07 15:42:04,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 15:42:04,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:04,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 15:42:04,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:42:04,533 INFO L87 Difference]: Start difference. First operand 1416 states and 3133 transitions. Second operand 12 states. [2019-12-07 15:42:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:05,116 INFO L93 Difference]: Finished difference Result 2115 states and 4525 transitions. [2019-12-07 15:42:05,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 15:42:05,116 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-12-07 15:42:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:05,118 INFO L225 Difference]: With dead ends: 2115 [2019-12-07 15:42:05,118 INFO L226 Difference]: Without dead ends: 1945 [2019-12-07 15:42:05,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-12-07 15:42:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2019-12-07 15:42:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1402. [2019-12-07 15:42:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-12-07 15:42:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 3090 transitions. [2019-12-07 15:42:05,137 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 3090 transitions. Word has length 52 [2019-12-07 15:42:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:05,137 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 3090 transitions. [2019-12-07 15:42:05,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 15:42:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 3090 transitions. [2019-12-07 15:42:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:42:05,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:05,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:05,140 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:05,140 INFO L82 PathProgramCache]: Analyzing trace with hash -53802054, now seen corresponding path program 4 times [2019-12-07 15:42:05,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:05,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963594573] [2019-12-07 15:42:05,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:05,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963594573] [2019-12-07 15:42:05,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:05,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 15:42:05,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884997294] [2019-12-07 15:42:05,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 15:42:05,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:05,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 15:42:05,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:42:05,368 INFO L87 Difference]: Start difference. First operand 1402 states and 3090 transitions. Second operand 13 states. [2019-12-07 15:42:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:05,768 INFO L93 Difference]: Finished difference Result 2107 states and 4395 transitions. [2019-12-07 15:42:05,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:42:05,768 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-07 15:42:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:05,770 INFO L225 Difference]: With dead ends: 2107 [2019-12-07 15:42:05,770 INFO L226 Difference]: Without dead ends: 1936 [2019-12-07 15:42:05,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 15:42:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2019-12-07 15:42:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1389. [2019-12-07 15:42:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1389 states. [2019-12-07 15:42:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 3033 transitions. [2019-12-07 15:42:05,791 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 3033 transitions. Word has length 52 [2019-12-07 15:42:05,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:05,791 INFO L462 AbstractCegarLoop]: Abstraction has 1389 states and 3033 transitions. [2019-12-07 15:42:05,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 15:42:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 3033 transitions. [2019-12-07 15:42:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:42:05,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:05,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:05,794 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:05,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:05,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1277083925, now seen corresponding path program 1 times [2019-12-07 15:42:05,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:05,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367200803] [2019-12-07 15:42:05,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:05,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367200803] [2019-12-07 15:42:05,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:05,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:42:05,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917807600] [2019-12-07 15:42:05,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:42:05,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:05,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:42:05,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:42:05,821 INFO L87 Difference]: Start difference. First operand 1389 states and 3033 transitions. Second operand 3 states. [2019-12-07 15:42:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:05,843 INFO L93 Difference]: Finished difference Result 1558 states and 3261 transitions. [2019-12-07 15:42:05,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:42:05,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 15:42:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:05,844 INFO L225 Difference]: With dead ends: 1558 [2019-12-07 15:42:05,845 INFO L226 Difference]: Without dead ends: 1558 [2019-12-07 15:42:05,845 INFO L630 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 [2019-12-07 15:42:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-12-07 15:42:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1389. [2019-12-07 15:42:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1389 states. [2019-12-07 15:42:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2948 transitions. [2019-12-07 15:42:05,856 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2948 transitions. Word has length 52 [2019-12-07 15:42:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:05,856 INFO L462 AbstractCegarLoop]: Abstraction has 1389 states and 2948 transitions. [2019-12-07 15:42:05,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:42:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2948 transitions. [2019-12-07 15:42:05,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:42:05,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:05,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:05,858 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:05,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:05,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1035849198, now seen corresponding path program 5 times [2019-12-07 15:42:05,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:05,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279404697] [2019-12-07 15:42:05,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:06,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279404697] [2019-12-07 15:42:06,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:06,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 15:42:06,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495379231] [2019-12-07 15:42:06,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 15:42:06,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:06,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 15:42:06,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:42:06,077 INFO L87 Difference]: Start difference. First operand 1389 states and 2948 transitions. Second operand 13 states. [2019-12-07 15:42:06,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:06,429 INFO L93 Difference]: Finished difference Result 1701 states and 3506 transitions. [2019-12-07 15:42:06,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:42:06,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-07 15:42:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:06,433 INFO L225 Difference]: With dead ends: 1701 [2019-12-07 15:42:06,433 INFO L226 Difference]: Without dead ends: 1593 [2019-12-07 15:42:06,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-12-07 15:42:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2019-12-07 15:42:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1381. [2019-12-07 15:42:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2019-12-07 15:42:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2927 transitions. [2019-12-07 15:42:06,459 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2927 transitions. Word has length 52 [2019-12-07 15:42:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:06,460 INFO L462 AbstractCegarLoop]: Abstraction has 1381 states and 2927 transitions. [2019-12-07 15:42:06,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 15:42:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2927 transitions. [2019-12-07 15:42:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:42:06,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:06,462 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:06,462 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:06,463 INFO L82 PathProgramCache]: Analyzing trace with hash -854733292, now seen corresponding path program 6 times [2019-12-07 15:42:06,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:06,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872148867] [2019-12-07 15:42:06,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:06,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872148867] [2019-12-07 15:42:06,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:06,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 15:42:06,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685464881] [2019-12-07 15:42:06,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 15:42:06,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:06,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 15:42:06,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:42:06,669 INFO L87 Difference]: Start difference. First operand 1381 states and 2927 transitions. Second operand 13 states. [2019-12-07 15:42:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:07,126 INFO L93 Difference]: Finished difference Result 1703 states and 3526 transitions. [2019-12-07 15:42:07,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:42:07,126 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-07 15:42:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:07,127 INFO L225 Difference]: With dead ends: 1703 [2019-12-07 15:42:07,127 INFO L226 Difference]: Without dead ends: 1599 [2019-12-07 15:42:07,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 15:42:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2019-12-07 15:42:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1365. [2019-12-07 15:42:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-07 15:42:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2893 transitions. [2019-12-07 15:42:07,139 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2893 transitions. Word has length 52 [2019-12-07 15:42:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:07,139 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 2893 transitions. [2019-12-07 15:42:07,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 15:42:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2893 transitions. [2019-12-07 15:42:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:42:07,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:07,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:07,141 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1191516730, now seen corresponding path program 7 times [2019-12-07 15:42:07,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:07,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370416922] [2019-12-07 15:42:07,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:07,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370416922] [2019-12-07 15:42:07,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:07,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:42:07,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028794127] [2019-12-07 15:42:07,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:42:07,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:07,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:42:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:42:07,189 INFO L87 Difference]: Start difference. First operand 1365 states and 2893 transitions. Second operand 6 states. [2019-12-07 15:42:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:07,315 INFO L93 Difference]: Finished difference Result 2854 states and 5776 transitions. [2019-12-07 15:42:07,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:42:07,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 15:42:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:07,317 INFO L225 Difference]: With dead ends: 2854 [2019-12-07 15:42:07,317 INFO L226 Difference]: Without dead ends: 1948 [2019-12-07 15:42:07,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:42:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2019-12-07 15:42:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1404. [2019-12-07 15:42:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2019-12-07 15:42:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2930 transitions. [2019-12-07 15:42:07,336 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2930 transitions. Word has length 52 [2019-12-07 15:42:07,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:07,336 INFO L462 AbstractCegarLoop]: Abstraction has 1404 states and 2930 transitions. [2019-12-07 15:42:07,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:42:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2930 transitions. [2019-12-07 15:42:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:42:07,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:07,339 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:07,339 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:07,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:07,339 INFO L82 PathProgramCache]: Analyzing trace with hash -526077916, now seen corresponding path program 8 times [2019-12-07 15:42:07,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:07,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233777342] [2019-12-07 15:42:07,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:07,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233777342] [2019-12-07 15:42:07,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:07,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:42:07,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945607353] [2019-12-07 15:42:07,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:42:07,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:07,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:42:07,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:42:07,400 INFO L87 Difference]: Start difference. First operand 1404 states and 2930 transitions. Second operand 5 states. [2019-12-07 15:42:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:07,417 INFO L93 Difference]: Finished difference Result 1571 states and 3228 transitions. [2019-12-07 15:42:07,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:42:07,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 15:42:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:07,418 INFO L225 Difference]: With dead ends: 1571 [2019-12-07 15:42:07,418 INFO L226 Difference]: Without dead ends: 806 [2019-12-07 15:42:07,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:42:07,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-12-07 15:42:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2019-12-07 15:42:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-12-07 15:42:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1685 transitions. [2019-12-07 15:42:07,426 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1685 transitions. Word has length 52 [2019-12-07 15:42:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:07,426 INFO L462 AbstractCegarLoop]: Abstraction has 806 states and 1685 transitions. [2019-12-07 15:42:07,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:42:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1685 transitions. [2019-12-07 15:42:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:42:07,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:07,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:07,427 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:07,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:07,428 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 9 times [2019-12-07 15:42:07,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:07,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58469363] [2019-12-07 15:42:07,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:07,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58469363] [2019-12-07 15:42:07,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:07,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:42:07,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554635520] [2019-12-07 15:42:07,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:42:07,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:42:07,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:42:07,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:42:07,474 INFO L87 Difference]: Start difference. First operand 806 states and 1685 transitions. Second operand 7 states. [2019-12-07 15:42:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:07,606 INFO L93 Difference]: Finished difference Result 1404 states and 2865 transitions. [2019-12-07 15:42:07,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:42:07,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 15:42:07,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:07,607 INFO L225 Difference]: With dead ends: 1404 [2019-12-07 15:42:07,607 INFO L226 Difference]: Without dead ends: 947 [2019-12-07 15:42:07,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:42:07,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-12-07 15:42:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 782. [2019-12-07 15:42:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-07 15:42:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1635 transitions. [2019-12-07 15:42:07,613 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1635 transitions. Word has length 52 [2019-12-07 15:42:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:07,614 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1635 transitions. [2019-12-07 15:42:07,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:42:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1635 transitions. [2019-12-07 15:42:07,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:42:07,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:07,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:07,615 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:07,615 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 10 times [2019-12-07 15:42:07,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:42:07,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44215028] [2019-12-07 15:42:07,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:42:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:42:07,672 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 15:42:07,672 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:42:07,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= (select .cse0 |v_ULTIMATE.start_main_~#t1557~0.base_40|) 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1557~0.base_40| 1)) (= v_~y$read_delayed~0_6 0) (= |v_ULTIMATE.start_main_~#t1557~0.offset_27| 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1557~0.base_40| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1557~0.base_40|) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1557~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1557~0.base_40|) |v_ULTIMATE.start_main_~#t1557~0.offset_27| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1557~0.offset=|v_ULTIMATE.start_main_~#t1557~0.offset_27|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1558~0.base=|v_ULTIMATE.start_main_~#t1558~0.base_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t1558~0.offset=|v_ULTIMATE.start_main_~#t1558~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_~#t1557~0.base=|v_ULTIMATE.start_main_~#t1557~0.base_40|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1557~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1558~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1558~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1557~0.base, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 15:42:07,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_ULTIMATE.start_main_~#t1558~0.offset_11| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1558~0.base_13|) 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1558~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1558~0.base_13|) |v_ULTIMATE.start_main_~#t1558~0.offset_11| 1))) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1558~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1558~0.base_13|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1558~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1558~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1558~0.base=|v_ULTIMATE.start_main_~#t1558~0.base_13|, ULTIMATE.start_main_~#t1558~0.offset=|v_ULTIMATE.start_main_~#t1558~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1558~0.base, ULTIMATE.start_main_~#t1558~0.offset] because there is no mapped edge [2019-12-07 15:42:07,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd1~0_Out1319111059 ~y$r_buff0_thd1~0_In1319111059) (= ~x~0_In1319111059 ~__unbuffered_p0_EAX~0_Out1319111059) (= 1 ~y$r_buff0_thd1~0_Out1319111059) (= ~y$r_buff0_thd0~0_In1319111059 ~y$r_buff1_thd0~0_Out1319111059) (= ~y$r_buff1_thd2~0_Out1319111059 ~y$r_buff0_thd2~0_In1319111059) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1319111059))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1319111059, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1319111059, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1319111059, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1319111059, ~x~0=~x~0_In1319111059} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1319111059, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1319111059, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1319111059, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1319111059, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1319111059, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1319111059, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1319111059, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1319111059, ~x~0=~x~0_In1319111059} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 15:42:07,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In870515123 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In870515123 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out870515123| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out870515123| ~y$w_buff0_used~0_In870515123)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In870515123, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In870515123} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out870515123|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In870515123, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In870515123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 15:42:07,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1797421268 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out1797421268| ~y$w_buff0_used~0_In1797421268) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In1797421268| |P1Thread1of1ForFork1_#t~ite20_Out1797421268|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1797421268| |P1Thread1of1ForFork1_#t~ite21_Out1797421268|) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out1797421268| ~y$w_buff0_used~0_In1797421268) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1797421268 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In1797421268 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1797421268 256))) (= (mod ~y$w_buff0_used~0_In1797421268 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1797421268, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1797421268, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1797421268|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1797421268, ~weak$$choice2~0=~weak$$choice2~0_In1797421268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1797421268} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1797421268, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1797421268, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1797421268|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1797421268, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1797421268|, ~weak$$choice2~0=~weak$$choice2~0_In1797421268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1797421268} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 15:42:07,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-750334336| |P1Thread1of1ForFork1_#t~ite24_Out-750334336|)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-750334336 256))) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In-750334336 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-750334336 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-750334336 256) 0)) (.cse4 (= (mod ~weak$$choice2~0_In-750334336 256) 0))) (or (let ((.cse1 (not .cse6))) (and .cse0 (or .cse1 (not .cse2)) (or (not .cse3) .cse1) (= |P1Thread1of1ForFork1_#t~ite22_Out-750334336| 0) .cse4 (= |P1Thread1of1ForFork1_#t~ite22_Out-750334336| |P1Thread1of1ForFork1_#t~ite23_Out-750334336|) (not .cse5))) (and (or (and .cse0 (or (and .cse3 .cse6) .cse5 (and .cse2 .cse6)) (= |P1Thread1of1ForFork1_#t~ite23_Out-750334336| ~y$w_buff1_used~0_In-750334336) .cse4) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-750334336| |P1Thread1of1ForFork1_#t~ite23_In-750334336|) (not .cse4) (= |P1Thread1of1ForFork1_#t~ite24_Out-750334336| ~y$w_buff1_used~0_In-750334336))) (= |P1Thread1of1ForFork1_#t~ite22_In-750334336| |P1Thread1of1ForFork1_#t~ite22_Out-750334336|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-750334336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-750334336, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-750334336, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-750334336|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-750334336|, ~weak$$choice2~0=~weak$$choice2~0_In-750334336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-750334336} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-750334336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-750334336, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-750334336, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-750334336|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-750334336|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-750334336|, ~weak$$choice2~0=~weak$$choice2~0_In-750334336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-750334336} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 15:42:07,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-3187771 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-3187771 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-3187771 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-3187771 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-3187771| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-3187771| ~y$w_buff1_used~0_In-3187771) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-3187771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-3187771, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-3187771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-3187771} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-3187771|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-3187771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-3187771, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-3187771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-3187771} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 15:42:07,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_Out1509682433 ~y$r_buff0_thd1~0_In1509682433)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1509682433 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1509682433 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out1509682433) (not .cse2) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1509682433, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1509682433} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1509682433, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1509682433|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1509682433} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 15:42:07,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In409146790 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In409146790 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In409146790 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In409146790 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out409146790|)) (and (= ~y$r_buff1_thd1~0_In409146790 |P0Thread1of1ForFork0_#t~ite8_Out409146790|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In409146790, ~y$w_buff0_used~0=~y$w_buff0_used~0_In409146790, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In409146790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In409146790} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In409146790, ~y$w_buff0_used~0=~y$w_buff0_used~0_In409146790, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out409146790|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In409146790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In409146790} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 15:42:07,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 15:42:07,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1307748151 256) 0))) (or (and (not .cse0) (= ~y$r_buff1_thd2~0_In1307748151 |P1Thread1of1ForFork1_#t~ite30_Out1307748151|) (= |P1Thread1of1ForFork1_#t~ite29_In1307748151| |P1Thread1of1ForFork1_#t~ite29_Out1307748151|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out1307748151| |P1Thread1of1ForFork1_#t~ite29_Out1307748151|) (= ~y$r_buff1_thd2~0_In1307748151 |P1Thread1of1ForFork1_#t~ite29_Out1307748151|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1307748151 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1307748151 256))) (= 0 (mod ~y$w_buff0_used~0_In1307748151 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1307748151 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1307748151, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1307748151|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1307748151, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1307748151, ~weak$$choice2~0=~weak$$choice2~0_In1307748151, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1307748151} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1307748151, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1307748151|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1307748151|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1307748151, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1307748151, ~weak$$choice2~0=~weak$$choice2~0_In1307748151, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1307748151} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 15:42:07,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 15:42:07,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-707406909 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-707406909 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-707406909| ~y$w_buff1~0_In-707406909)) (and (= ~y~0_In-707406909 |P1Thread1of1ForFork1_#t~ite32_Out-707406909|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-707406909, ~y$w_buff1~0=~y$w_buff1~0_In-707406909, ~y~0=~y~0_In-707406909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-707406909} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-707406909, ~y$w_buff1~0=~y$w_buff1~0_In-707406909, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-707406909|, ~y~0=~y~0_In-707406909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-707406909} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 15:42:07,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 15:42:07,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1995728028 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1995728028 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1995728028| ~y$w_buff0_used~0_In-1995728028)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1995728028| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1995728028, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1995728028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1995728028, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1995728028, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1995728028|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 15:42:07,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In485357470 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In485357470 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In485357470 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In485357470 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out485357470| ~y$w_buff1_used~0_In485357470) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out485357470| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In485357470, ~y$w_buff0_used~0=~y$w_buff0_used~0_In485357470, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In485357470, ~y$w_buff1_used~0=~y$w_buff1_used~0_In485357470} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In485357470, ~y$w_buff0_used~0=~y$w_buff0_used~0_In485357470, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In485357470, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out485357470|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In485357470} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 15:42:07,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-456815057 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-456815057 256)))) (or (and (= ~y$r_buff0_thd2~0_In-456815057 |P1Thread1of1ForFork1_#t~ite36_Out-456815057|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-456815057|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-456815057, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-456815057} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-456815057, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-456815057, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-456815057|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 15:42:07,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In986651782 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In986651782 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In986651782 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In986651782 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In986651782 |P1Thread1of1ForFork1_#t~ite37_Out986651782|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out986651782| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In986651782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In986651782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In986651782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In986651782} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In986651782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In986651782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In986651782, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out986651782|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In986651782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 15:42:07,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 15:42:07,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 15:42:07,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 15:42:07,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-960678717 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-960678717 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-960678717 |ULTIMATE.start_main_#t~ite40_Out-960678717|)) (and (= ~y~0_In-960678717 |ULTIMATE.start_main_#t~ite40_Out-960678717|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-960678717, ~y~0=~y~0_In-960678717, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-960678717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-960678717} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-960678717|, ~y$w_buff1~0=~y$w_buff1~0_In-960678717, ~y~0=~y~0_In-960678717, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-960678717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-960678717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 15:42:07,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 15:42:07,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-731941935 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-731941935 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-731941935 |ULTIMATE.start_main_#t~ite42_Out-731941935|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-731941935|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-731941935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-731941935} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-731941935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-731941935, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-731941935|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 15:42:07,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1341188729 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1341188729 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1341188729 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1341188729 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1341188729 |ULTIMATE.start_main_#t~ite43_Out-1341188729|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1341188729|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1341188729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1341188729, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1341188729, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1341188729} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1341188729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1341188729, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1341188729|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1341188729, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1341188729} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 15:42:07,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-471398652 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-471398652 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-471398652| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-471398652| ~y$r_buff0_thd0~0_In-471398652)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-471398652, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-471398652} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-471398652, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-471398652, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-471398652|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 15:42:07,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1208991332 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1208991332 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1208991332 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1208991332 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1208991332| ~y$r_buff1_thd0~0_In-1208991332)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1208991332|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1208991332, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1208991332, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1208991332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1208991332} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1208991332, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1208991332, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1208991332, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1208991332|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1208991332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 15:42:07,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:42:07,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:42:07 BasicIcfg [2019-12-07 15:42:07,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:42:07,718 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:42:07,718 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:42:07,718 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:42:07,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:41:55" (3/4) ... [2019-12-07 15:42:07,720 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:42:07,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= (select .cse0 |v_ULTIMATE.start_main_~#t1557~0.base_40|) 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1557~0.base_40| 1)) (= v_~y$read_delayed~0_6 0) (= |v_ULTIMATE.start_main_~#t1557~0.offset_27| 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1557~0.base_40| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1557~0.base_40|) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1557~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1557~0.base_40|) |v_ULTIMATE.start_main_~#t1557~0.offset_27| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1557~0.offset=|v_ULTIMATE.start_main_~#t1557~0.offset_27|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1558~0.base=|v_ULTIMATE.start_main_~#t1558~0.base_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t1558~0.offset=|v_ULTIMATE.start_main_~#t1558~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_~#t1557~0.base=|v_ULTIMATE.start_main_~#t1557~0.base_40|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1557~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1558~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1558~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1557~0.base, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 15:42:07,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_ULTIMATE.start_main_~#t1558~0.offset_11| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1558~0.base_13|) 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1558~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1558~0.base_13|) |v_ULTIMATE.start_main_~#t1558~0.offset_11| 1))) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1558~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1558~0.base_13|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1558~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1558~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1558~0.base=|v_ULTIMATE.start_main_~#t1558~0.base_13|, ULTIMATE.start_main_~#t1558~0.offset=|v_ULTIMATE.start_main_~#t1558~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1558~0.base, ULTIMATE.start_main_~#t1558~0.offset] because there is no mapped edge [2019-12-07 15:42:07,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd1~0_Out1319111059 ~y$r_buff0_thd1~0_In1319111059) (= ~x~0_In1319111059 ~__unbuffered_p0_EAX~0_Out1319111059) (= 1 ~y$r_buff0_thd1~0_Out1319111059) (= ~y$r_buff0_thd0~0_In1319111059 ~y$r_buff1_thd0~0_Out1319111059) (= ~y$r_buff1_thd2~0_Out1319111059 ~y$r_buff0_thd2~0_In1319111059) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1319111059))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1319111059, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1319111059, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1319111059, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1319111059, ~x~0=~x~0_In1319111059} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1319111059, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1319111059, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1319111059, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1319111059, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1319111059, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1319111059, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1319111059, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1319111059, ~x~0=~x~0_In1319111059} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 15:42:07,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In870515123 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In870515123 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out870515123| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out870515123| ~y$w_buff0_used~0_In870515123)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In870515123, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In870515123} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out870515123|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In870515123, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In870515123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 15:42:07,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1797421268 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out1797421268| ~y$w_buff0_used~0_In1797421268) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In1797421268| |P1Thread1of1ForFork1_#t~ite20_Out1797421268|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1797421268| |P1Thread1of1ForFork1_#t~ite21_Out1797421268|) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out1797421268| ~y$w_buff0_used~0_In1797421268) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1797421268 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In1797421268 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1797421268 256))) (= (mod ~y$w_buff0_used~0_In1797421268 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1797421268, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1797421268, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1797421268|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1797421268, ~weak$$choice2~0=~weak$$choice2~0_In1797421268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1797421268} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1797421268, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1797421268, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1797421268|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1797421268, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1797421268|, ~weak$$choice2~0=~weak$$choice2~0_In1797421268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1797421268} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 15:42:07,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-750334336| |P1Thread1of1ForFork1_#t~ite24_Out-750334336|)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-750334336 256))) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In-750334336 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-750334336 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-750334336 256) 0)) (.cse4 (= (mod ~weak$$choice2~0_In-750334336 256) 0))) (or (let ((.cse1 (not .cse6))) (and .cse0 (or .cse1 (not .cse2)) (or (not .cse3) .cse1) (= |P1Thread1of1ForFork1_#t~ite22_Out-750334336| 0) .cse4 (= |P1Thread1of1ForFork1_#t~ite22_Out-750334336| |P1Thread1of1ForFork1_#t~ite23_Out-750334336|) (not .cse5))) (and (or (and .cse0 (or (and .cse3 .cse6) .cse5 (and .cse2 .cse6)) (= |P1Thread1of1ForFork1_#t~ite23_Out-750334336| ~y$w_buff1_used~0_In-750334336) .cse4) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-750334336| |P1Thread1of1ForFork1_#t~ite23_In-750334336|) (not .cse4) (= |P1Thread1of1ForFork1_#t~ite24_Out-750334336| ~y$w_buff1_used~0_In-750334336))) (= |P1Thread1of1ForFork1_#t~ite22_In-750334336| |P1Thread1of1ForFork1_#t~ite22_Out-750334336|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-750334336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-750334336, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-750334336, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-750334336|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-750334336|, ~weak$$choice2~0=~weak$$choice2~0_In-750334336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-750334336} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-750334336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-750334336, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-750334336, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-750334336|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-750334336|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-750334336|, ~weak$$choice2~0=~weak$$choice2~0_In-750334336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-750334336} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 15:42:07,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-3187771 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-3187771 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-3187771 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-3187771 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-3187771| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-3187771| ~y$w_buff1_used~0_In-3187771) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-3187771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-3187771, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-3187771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-3187771} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-3187771|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-3187771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-3187771, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-3187771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-3187771} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 15:42:07,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_Out1509682433 ~y$r_buff0_thd1~0_In1509682433)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1509682433 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1509682433 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out1509682433) (not .cse2) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1509682433, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1509682433} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1509682433, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1509682433|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1509682433} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 15:42:07,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In409146790 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In409146790 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In409146790 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In409146790 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out409146790|)) (and (= ~y$r_buff1_thd1~0_In409146790 |P0Thread1of1ForFork0_#t~ite8_Out409146790|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In409146790, ~y$w_buff0_used~0=~y$w_buff0_used~0_In409146790, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In409146790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In409146790} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In409146790, ~y$w_buff0_used~0=~y$w_buff0_used~0_In409146790, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out409146790|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In409146790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In409146790} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 15:42:07,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 15:42:07,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1307748151 256) 0))) (or (and (not .cse0) (= ~y$r_buff1_thd2~0_In1307748151 |P1Thread1of1ForFork1_#t~ite30_Out1307748151|) (= |P1Thread1of1ForFork1_#t~ite29_In1307748151| |P1Thread1of1ForFork1_#t~ite29_Out1307748151|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out1307748151| |P1Thread1of1ForFork1_#t~ite29_Out1307748151|) (= ~y$r_buff1_thd2~0_In1307748151 |P1Thread1of1ForFork1_#t~ite29_Out1307748151|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1307748151 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1307748151 256))) (= 0 (mod ~y$w_buff0_used~0_In1307748151 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1307748151 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1307748151, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1307748151|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1307748151, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1307748151, ~weak$$choice2~0=~weak$$choice2~0_In1307748151, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1307748151} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1307748151, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1307748151|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1307748151|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1307748151, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1307748151, ~weak$$choice2~0=~weak$$choice2~0_In1307748151, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1307748151} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 15:42:07,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 15:42:07,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-707406909 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-707406909 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-707406909| ~y$w_buff1~0_In-707406909)) (and (= ~y~0_In-707406909 |P1Thread1of1ForFork1_#t~ite32_Out-707406909|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-707406909, ~y$w_buff1~0=~y$w_buff1~0_In-707406909, ~y~0=~y~0_In-707406909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-707406909} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-707406909, ~y$w_buff1~0=~y$w_buff1~0_In-707406909, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-707406909|, ~y~0=~y~0_In-707406909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-707406909} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 15:42:07,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 15:42:07,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1995728028 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1995728028 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1995728028| ~y$w_buff0_used~0_In-1995728028)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1995728028| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1995728028, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1995728028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1995728028, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1995728028, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1995728028|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 15:42:07,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In485357470 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In485357470 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In485357470 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In485357470 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out485357470| ~y$w_buff1_used~0_In485357470) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out485357470| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In485357470, ~y$w_buff0_used~0=~y$w_buff0_used~0_In485357470, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In485357470, ~y$w_buff1_used~0=~y$w_buff1_used~0_In485357470} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In485357470, ~y$w_buff0_used~0=~y$w_buff0_used~0_In485357470, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In485357470, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out485357470|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In485357470} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 15:42:07,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-456815057 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-456815057 256)))) (or (and (= ~y$r_buff0_thd2~0_In-456815057 |P1Thread1of1ForFork1_#t~ite36_Out-456815057|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-456815057|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-456815057, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-456815057} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-456815057, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-456815057, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-456815057|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 15:42:07,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In986651782 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In986651782 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In986651782 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In986651782 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In986651782 |P1Thread1of1ForFork1_#t~ite37_Out986651782|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out986651782| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In986651782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In986651782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In986651782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In986651782} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In986651782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In986651782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In986651782, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out986651782|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In986651782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 15:42:07,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 15:42:07,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 15:42:07,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 15:42:07,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-960678717 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-960678717 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-960678717 |ULTIMATE.start_main_#t~ite40_Out-960678717|)) (and (= ~y~0_In-960678717 |ULTIMATE.start_main_#t~ite40_Out-960678717|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-960678717, ~y~0=~y~0_In-960678717, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-960678717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-960678717} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-960678717|, ~y$w_buff1~0=~y$w_buff1~0_In-960678717, ~y~0=~y~0_In-960678717, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-960678717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-960678717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 15:42:07,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 15:42:07,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-731941935 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-731941935 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-731941935 |ULTIMATE.start_main_#t~ite42_Out-731941935|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-731941935|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-731941935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-731941935} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-731941935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-731941935, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-731941935|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 15:42:07,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1341188729 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1341188729 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1341188729 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1341188729 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1341188729 |ULTIMATE.start_main_#t~ite43_Out-1341188729|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1341188729|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1341188729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1341188729, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1341188729, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1341188729} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1341188729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1341188729, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1341188729|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1341188729, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1341188729} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 15:42:07,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-471398652 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-471398652 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-471398652| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-471398652| ~y$r_buff0_thd0~0_In-471398652)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-471398652, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-471398652} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-471398652, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-471398652, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-471398652|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 15:42:07,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1208991332 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1208991332 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1208991332 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1208991332 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1208991332| ~y$r_buff1_thd0~0_In-1208991332)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1208991332|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1208991332, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1208991332, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1208991332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1208991332} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1208991332, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1208991332, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1208991332, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1208991332|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1208991332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 15:42:07,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:42:07,770 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_53577b5f-cf66-49c9-83cc-8aa83e3084dc/bin/utaipan/witness.graphml [2019-12-07 15:42:07,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:42:07,771 INFO L168 Benchmark]: Toolchain (without parser) took 13422.58 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 559.9 MB). Free memory was 940.8 MB in the beginning and 1.4 GB in the end (delta: -465.3 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:42:07,771 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:42:07,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -121.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 15:42:07,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:42:07,772 INFO L168 Benchmark]: Boogie Preprocessor took 27.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:42:07,772 INFO L168 Benchmark]: RCFGBuilder took 372.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:42:07,772 INFO L168 Benchmark]: TraceAbstraction took 12555.34 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 468.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -419.5 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:42:07,773 INFO L168 Benchmark]: Witness Printer took 52.05 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:42:07,774 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -121.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 372.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12555.34 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 468.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -419.5 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * Witness Printer took 52.05 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.8s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1557, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1558, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2627 SDtfs, 3824 SDslu, 6785 SDs, 0 SdLazy, 5101 SolverSat, 211 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 26 SyntacticMatches, 17 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 8915 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 785 NumberOfCodeBlocks, 785 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 714 ConstructedInterpolants, 0 QuantifiedInterpolants, 209763 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...