./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix049_rmo.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_e9a78b21-7739-4473-ba91-88e9be056085/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix049_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/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 7cb9fad924771a4988b59243a5b10880f8a7e2e9 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:52:17,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:52:17,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:52:17,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:52:17,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:52:17,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:52:17,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:52:17,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:52:17,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:52:17,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:52:17,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:52:17,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:52:17,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:52:17,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:52:17,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:52:17,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:52:17,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:52:17,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:52:17,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:52:17,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:52:17,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:52:17,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:52:17,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:52:17,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:52:17,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:52:17,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:52:17,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:52:17,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:52:17,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:52:17,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:52:17,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:52:17,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:52:17,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:52:17,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:52:17,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:52:17,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:52:17,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:52:17,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:52:17,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:52:17,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:52:17,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:52:17,860 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:52:17,874 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:52:17,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:52:17,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:52:17,875 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:52:17,875 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:52:17,875 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:52:17,875 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:52:17,875 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:52:17,876 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:52:17,876 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:52:17,876 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:52:17,876 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:52:17,876 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:52:17,877 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:52:17,877 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:52:17,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:52:17,878 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:52:17,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:52:17,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:52:17,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:52:17,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:52:17,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:52:17,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:52:17,879 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:52:17,879 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:52:17,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:52:17,879 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:52:17,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:52:17,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:52:17,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:52:17,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:52:17,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:52:17,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:52:17,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:52:17,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:52:17,881 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:52:17,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:52:17,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:52:17,882 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:52:17,882 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:52:17,882 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_e9a78b21-7739-4473-ba91-88e9be056085/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 -> 7cb9fad924771a4988b59243a5b10880f8a7e2e9 [2019-12-07 21:52:17,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:52:18,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:52:18,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:52:18,006 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:52:18,006 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:52:18,007 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix049_rmo.oepc.i [2019-12-07 21:52:18,045 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/bin/utaipan/data/05838ee3e/91def36172084e1492c5e0d93a45eaea/FLAG206b1a01b [2019-12-07 21:52:18,411 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:52:18,412 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/sv-benchmarks/c/pthread-wmm/mix049_rmo.oepc.i [2019-12-07 21:52:18,425 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/bin/utaipan/data/05838ee3e/91def36172084e1492c5e0d93a45eaea/FLAG206b1a01b [2019-12-07 21:52:18,435 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/bin/utaipan/data/05838ee3e/91def36172084e1492c5e0d93a45eaea [2019-12-07 21:52:18,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:52:18,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:52:18,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:52:18,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:52:18,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:52:18,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:52:18" (1/1) ... [2019-12-07 21:52:18,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18, skipping insertion in model container [2019-12-07 21:52:18,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:52:18" (1/1) ... [2019-12-07 21:52:18,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:52:18,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:52:18,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:52:18,771 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:52:18,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:52:18,878 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:52:18,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18 WrapperNode [2019-12-07 21:52:18,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:52:18,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:52:18,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:52:18,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:52:18,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18" (1/1) ... [2019-12-07 21:52:18,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18" (1/1) ... [2019-12-07 21:52:18,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:52:18,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:52:18,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:52:18,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:52:18,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18" (1/1) ... [2019-12-07 21:52:18,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18" (1/1) ... [2019-12-07 21:52:18,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18" (1/1) ... [2019-12-07 21:52:18,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18" (1/1) ... [2019-12-07 21:52:18,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18" (1/1) ... [2019-12-07 21:52:18,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18" (1/1) ... [2019-12-07 21:52:18,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18" (1/1) ... [2019-12-07 21:52:18,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:52:18,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:52:18,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:52:18,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:52:18,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/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 21:52:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:52:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:52:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:52:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:52:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:52:18,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:52:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:52:18,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:52:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 21:52:18,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 21:52:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:52:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:52:18,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:52:19,000 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 21:52:19,362 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:52:19,362 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:52:19,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:52:19 BoogieIcfgContainer [2019-12-07 21:52:19,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:52:19,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:52:19,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:52:19,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:52:19,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:52:18" (1/3) ... [2019-12-07 21:52:19,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5d00d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:52:19, skipping insertion in model container [2019-12-07 21:52:19,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:18" (2/3) ... [2019-12-07 21:52:19,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5d00d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:52:19, skipping insertion in model container [2019-12-07 21:52:19,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:52:19" (3/3) ... [2019-12-07 21:52:19,368 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_rmo.oepc.i [2019-12-07 21:52:19,374 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:52:19,374 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:52:19,379 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:52:19,380 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:52:19,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,409 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,410 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,414 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,414 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:52:19,435 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 21:52:19,448 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:52:19,448 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:52:19,448 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:52:19,448 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:52:19,448 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:52:19,448 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:52:19,448 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:52:19,449 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:52:19,459 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-07 21:52:19,461 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-07 21:52:19,516 INFO L134 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-07 21:52:19,516 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:52:19,526 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 21:52:19,542 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-07 21:52:19,572 INFO L134 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-07 21:52:19,572 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:52:19,578 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 21:52:19,593 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 21:52:19,594 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:52:22,526 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 21:52:22,824 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-07 21:52:22,824 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-07 21:52:22,826 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-07 21:52:42,072 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-07 21:52:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-07 21:52:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 21:52:42,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:42,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 21:52:42,078 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:52:42,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:42,082 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-07 21:52:42,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:52:42,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823387267] [2019-12-07 21:52:42,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:52:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:42,219 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 21:52:42,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823387267] [2019-12-07 21:52:42,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:52:42,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:52:42,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784527262] [2019-12-07 21:52:42,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:52:42,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:52:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:52:42,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:52:42,234 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-07 21:52:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:42,996 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-07 21:52:42,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:52:42,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 21:52:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:43,476 INFO L225 Difference]: With dead ends: 125570 [2019-12-07 21:52:43,476 INFO L226 Difference]: Without dead ends: 111010 [2019-12-07 21:52:43,477 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 21:52:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-07 21:52:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-07 21:52:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-07 21:52:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-07 21:52:51,931 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-07 21:52:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:51,931 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-07 21:52:51,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:52:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-07 21:52:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:52:51,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:51,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:51,935 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:52:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:51,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-07 21:52:51,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:52:51,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452607373] [2019-12-07 21:52:51,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:52:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:52,008 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 21:52:52,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452607373] [2019-12-07 21:52:52,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:52:52,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:52:52,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19353289] [2019-12-07 21:52:52,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:52:52,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:52:52,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:52:52,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:52:52,010 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-07 21:52:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:52,891 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-07 21:52:52,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:52:52,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 21:52:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:53,675 INFO L225 Difference]: With dead ends: 172646 [2019-12-07 21:52:53,676 INFO L226 Difference]: Without dead ends: 172548 [2019-12-07 21:52:53,676 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 21:52:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-07 21:53:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-07 21:53:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-07 21:53:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-07 21:53:02,003 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-07 21:53:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:53:02,004 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-07 21:53:02,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:53:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-07 21:53:02,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 21:53:02,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:53:02,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:53:02,009 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:53:02,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:53:02,009 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-07 21:53:02,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:53:02,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334751464] [2019-12-07 21:53:02,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:53:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:02,070 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 21:53:02,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334751464] [2019-12-07 21:53:02,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:53:02,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:53:02,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53106581] [2019-12-07 21:53:02,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:53:02,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:53:02,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:53:02,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:53:02,071 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 4 states. [2019-12-07 21:53:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:53:03,284 INFO L93 Difference]: Finished difference Result 228902 states and 931210 transitions. [2019-12-07 21:53:03,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:53:03,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 21:53:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:53:06,336 INFO L225 Difference]: With dead ends: 228902 [2019-12-07 21:53:06,336 INFO L226 Difference]: Without dead ends: 228790 [2019-12-07 21:53:06,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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 21:53:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228790 states. [2019-12-07 21:53:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228790 to 192327. [2019-12-07 21:53:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192327 states. [2019-12-07 21:53:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192327 states to 192327 states and 796272 transitions. [2019-12-07 21:53:16,451 INFO L78 Accepts]: Start accepts. Automaton has 192327 states and 796272 transitions. Word has length 13 [2019-12-07 21:53:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:53:16,452 INFO L462 AbstractCegarLoop]: Abstraction has 192327 states and 796272 transitions. [2019-12-07 21:53:16,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:53:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 192327 states and 796272 transitions. [2019-12-07 21:53:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:53:16,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:53:16,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:53:16,460 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:53:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:53:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-07 21:53:16,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:53:16,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262617277] [2019-12-07 21:53:16,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:53:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:16,488 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 21:53:16,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262617277] [2019-12-07 21:53:16,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:53:16,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:53:16,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811426234] [2019-12-07 21:53:16,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:53:16,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:53:16,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:53:16,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:53:16,489 INFO L87 Difference]: Start difference. First operand 192327 states and 796272 transitions. Second operand 3 states. [2019-12-07 21:53:17,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:53:17,626 INFO L93 Difference]: Finished difference Result 280788 states and 1158875 transitions. [2019-12-07 21:53:17,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:53:17,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 21:53:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:53:18,362 INFO L225 Difference]: With dead ends: 280788 [2019-12-07 21:53:18,362 INFO L226 Difference]: Without dead ends: 280788 [2019-12-07 21:53:18,363 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 21:53:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280788 states. [2019-12-07 21:53:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280788 to 222888. [2019-12-07 21:53:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222888 states. [2019-12-07 21:53:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222888 states to 222888 states and 926633 transitions. [2019-12-07 21:53:32,509 INFO L78 Accepts]: Start accepts. Automaton has 222888 states and 926633 transitions. Word has length 16 [2019-12-07 21:53:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:53:32,509 INFO L462 AbstractCegarLoop]: Abstraction has 222888 states and 926633 transitions. [2019-12-07 21:53:32,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:53:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 222888 states and 926633 transitions. [2019-12-07 21:53:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:53:32,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:53:32,516 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:53:32,517 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:53:32,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:53:32,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-07 21:53:32,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:53:32,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574359731] [2019-12-07 21:53:32,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:53:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:32,584 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 21:53:32,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574359731] [2019-12-07 21:53:32,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:53:32,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:53:32,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849995660] [2019-12-07 21:53:32,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:53:32,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:53:32,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:53:32,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:53:32,585 INFO L87 Difference]: Start difference. First operand 222888 states and 926633 transitions. Second operand 5 states. [2019-12-07 21:53:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:53:34,545 INFO L93 Difference]: Finished difference Result 298473 states and 1226263 transitions. [2019-12-07 21:53:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:53:34,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 21:53:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:53:35,335 INFO L225 Difference]: With dead ends: 298473 [2019-12-07 21:53:35,335 INFO L226 Difference]: Without dead ends: 298473 [2019-12-07 21:53:35,335 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 21:53:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298473 states. [2019-12-07 21:53:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298473 to 237826. [2019-12-07 21:53:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237826 states. [2019-12-07 21:53:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237826 states to 237826 states and 988542 transitions. [2019-12-07 21:53:50,238 INFO L78 Accepts]: Start accepts. Automaton has 237826 states and 988542 transitions. Word has length 16 [2019-12-07 21:53:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:53:50,238 INFO L462 AbstractCegarLoop]: Abstraction has 237826 states and 988542 transitions. [2019-12-07 21:53:50,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:53:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 237826 states and 988542 transitions. [2019-12-07 21:53:50,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:53:50,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:53:50,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:53:50,251 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:53:50,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:53:50,252 INFO L82 PathProgramCache]: Analyzing trace with hash -504931817, now seen corresponding path program 1 times [2019-12-07 21:53:50,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:53:50,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689068747] [2019-12-07 21:53:50,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:53:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:50,287 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 21:53:50,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689068747] [2019-12-07 21:53:50,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:53:50,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:53:50,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214010153] [2019-12-07 21:53:50,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:53:50,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:53:50,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:53:50,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:53:50,289 INFO L87 Difference]: Start difference. First operand 237826 states and 988542 transitions. Second operand 3 states. [2019-12-07 21:53:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:53:51,729 INFO L93 Difference]: Finished difference Result 237826 states and 978678 transitions. [2019-12-07 21:53:51,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:53:51,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 21:53:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:53:52,353 INFO L225 Difference]: With dead ends: 237826 [2019-12-07 21:53:52,353 INFO L226 Difference]: Without dead ends: 237826 [2019-12-07 21:53:52,353 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 21:53:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237826 states. [2019-12-07 21:54:02,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237826 to 234480. [2019-12-07 21:54:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234480 states. [2019-12-07 21:54:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234480 states to 234480 states and 966258 transitions. [2019-12-07 21:54:03,150 INFO L78 Accepts]: Start accepts. Automaton has 234480 states and 966258 transitions. Word has length 18 [2019-12-07 21:54:03,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:03,150 INFO L462 AbstractCegarLoop]: Abstraction has 234480 states and 966258 transitions. [2019-12-07 21:54:03,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:54:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 234480 states and 966258 transitions. [2019-12-07 21:54:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:54:03,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:03,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:54:03,162 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:03,162 INFO L82 PathProgramCache]: Analyzing trace with hash 138207619, now seen corresponding path program 1 times [2019-12-07 21:54:03,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:03,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783142140] [2019-12-07 21:54:03,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:03,191 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 21:54:03,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783142140] [2019-12-07 21:54:03,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:03,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:54:03,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204677976] [2019-12-07 21:54:03,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:54:03,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:03,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:54:03,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:54:03,192 INFO L87 Difference]: Start difference. First operand 234480 states and 966258 transitions. Second operand 3 states. [2019-12-07 21:54:03,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:03,315 INFO L93 Difference]: Finished difference Result 42613 states and 138837 transitions. [2019-12-07 21:54:03,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:54:03,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 21:54:03,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:03,377 INFO L225 Difference]: With dead ends: 42613 [2019-12-07 21:54:03,377 INFO L226 Difference]: Without dead ends: 42613 [2019-12-07 21:54:03,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:54:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42613 states. [2019-12-07 21:54:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42613 to 42613. [2019-12-07 21:54:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42613 states. [2019-12-07 21:54:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42613 states to 42613 states and 138837 transitions. [2019-12-07 21:54:04,476 INFO L78 Accepts]: Start accepts. Automaton has 42613 states and 138837 transitions. Word has length 18 [2019-12-07 21:54:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:04,476 INFO L462 AbstractCegarLoop]: Abstraction has 42613 states and 138837 transitions. [2019-12-07 21:54:04,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:54:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 42613 states and 138837 transitions. [2019-12-07 21:54:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:54:04,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:04,483 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] [2019-12-07 21:54:04,483 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:04,483 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-07 21:54:04,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:04,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944842924] [2019-12-07 21:54:04,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:04,554 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 21:54:04,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944842924] [2019-12-07 21:54:04,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:04,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:54:04,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720126230] [2019-12-07 21:54:04,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:54:04,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:04,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:54:04,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:54:04,556 INFO L87 Difference]: Start difference. First operand 42613 states and 138837 transitions. Second operand 6 states. [2019-12-07 21:54:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:05,153 INFO L93 Difference]: Finished difference Result 65056 states and 205947 transitions. [2019-12-07 21:54:05,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:54:05,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 21:54:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:05,251 INFO L225 Difference]: With dead ends: 65056 [2019-12-07 21:54:05,251 INFO L226 Difference]: Without dead ends: 65042 [2019-12-07 21:54:05,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:54:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65042 states. [2019-12-07 21:54:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65042 to 42278. [2019-12-07 21:54:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42278 states. [2019-12-07 21:54:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42278 states to 42278 states and 137592 transitions. [2019-12-07 21:54:06,154 INFO L78 Accepts]: Start accepts. Automaton has 42278 states and 137592 transitions. Word has length 22 [2019-12-07 21:54:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:06,154 INFO L462 AbstractCegarLoop]: Abstraction has 42278 states and 137592 transitions. [2019-12-07 21:54:06,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:54:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 42278 states and 137592 transitions. [2019-12-07 21:54:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 21:54:06,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:06,164 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] [2019-12-07 21:54:06,165 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:06,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:06,165 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-07 21:54:06,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:06,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815206245] [2019-12-07 21:54:06,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:06,313 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 21:54:06,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815206245] [2019-12-07 21:54:06,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:06,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:54:06,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330055918] [2019-12-07 21:54:06,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:54:06,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:06,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:54:06,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:54:06,314 INFO L87 Difference]: Start difference. First operand 42278 states and 137592 transitions. Second operand 7 states. [2019-12-07 21:54:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:06,884 INFO L93 Difference]: Finished difference Result 59726 states and 189950 transitions. [2019-12-07 21:54:06,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:54:06,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-07 21:54:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:06,977 INFO L225 Difference]: With dead ends: 59726 [2019-12-07 21:54:06,977 INFO L226 Difference]: Without dead ends: 59700 [2019-12-07 21:54:06,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:54:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59700 states. [2019-12-07 21:54:08,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59700 to 50129. [2019-12-07 21:54:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50129 states. [2019-12-07 21:54:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50129 states to 50129 states and 162181 transitions. [2019-12-07 21:54:08,909 INFO L78 Accepts]: Start accepts. Automaton has 50129 states and 162181 transitions. Word has length 25 [2019-12-07 21:54:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:08,910 INFO L462 AbstractCegarLoop]: Abstraction has 50129 states and 162181 transitions. [2019-12-07 21:54:08,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:54:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 50129 states and 162181 transitions. [2019-12-07 21:54:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 21:54:08,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:08,926 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 21:54:08,927 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:08,927 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-07 21:54:08,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:08,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628899122] [2019-12-07 21:54:08,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:09,023 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 21:54:09,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628899122] [2019-12-07 21:54:09,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:09,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:54:09,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514246588] [2019-12-07 21:54:09,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:54:09,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:09,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:54:09,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:54:09,024 INFO L87 Difference]: Start difference. First operand 50129 states and 162181 transitions. Second operand 8 states. [2019-12-07 21:54:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:09,720 INFO L93 Difference]: Finished difference Result 67015 states and 211902 transitions. [2019-12-07 21:54:09,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:54:09,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-07 21:54:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:09,819 INFO L225 Difference]: With dead ends: 67015 [2019-12-07 21:54:09,819 INFO L226 Difference]: Without dead ends: 66945 [2019-12-07 21:54:09,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:54:10,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66945 states. [2019-12-07 21:54:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66945 to 53724. [2019-12-07 21:54:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53724 states. [2019-12-07 21:54:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53724 states to 53724 states and 172706 transitions. [2019-12-07 21:54:10,995 INFO L78 Accepts]: Start accepts. Automaton has 53724 states and 172706 transitions. Word has length 27 [2019-12-07 21:54:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:10,995 INFO L462 AbstractCegarLoop]: Abstraction has 53724 states and 172706 transitions. [2019-12-07 21:54:10,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:54:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 53724 states and 172706 transitions. [2019-12-07 21:54:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 21:54:11,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:11,017 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] [2019-12-07 21:54:11,017 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:11,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:11,017 INFO L82 PathProgramCache]: Analyzing trace with hash -969078927, now seen corresponding path program 1 times [2019-12-07 21:54:11,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:11,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331091068] [2019-12-07 21:54:11,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:11,050 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 21:54:11,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331091068] [2019-12-07 21:54:11,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:11,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:54:11,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617080492] [2019-12-07 21:54:11,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:54:11,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:11,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:54:11,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:54:11,051 INFO L87 Difference]: Start difference. First operand 53724 states and 172706 transitions. Second operand 4 states. [2019-12-07 21:54:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:11,110 INFO L93 Difference]: Finished difference Result 20754 states and 64022 transitions. [2019-12-07 21:54:11,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:54:11,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 21:54:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:11,135 INFO L225 Difference]: With dead ends: 20754 [2019-12-07 21:54:11,135 INFO L226 Difference]: Without dead ends: 20754 [2019-12-07 21:54:11,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:54:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20754 states. [2019-12-07 21:54:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20754 to 19543. [2019-12-07 21:54:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19543 states. [2019-12-07 21:54:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19543 states to 19543 states and 60338 transitions. [2019-12-07 21:54:11,442 INFO L78 Accepts]: Start accepts. Automaton has 19543 states and 60338 transitions. Word has length 29 [2019-12-07 21:54:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:11,442 INFO L462 AbstractCegarLoop]: Abstraction has 19543 states and 60338 transitions. [2019-12-07 21:54:11,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:54:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 19543 states and 60338 transitions. [2019-12-07 21:54:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 21:54:11,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:11,463 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] [2019-12-07 21:54:11,463 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-07 21:54:11,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:11,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957058363] [2019-12-07 21:54:11,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:11,544 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 21:54:11,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957058363] [2019-12-07 21:54:11,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:11,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:54:11,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424761156] [2019-12-07 21:54:11,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:54:11,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:11,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:54:11,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:54:11,545 INFO L87 Difference]: Start difference. First operand 19543 states and 60338 transitions. Second operand 7 states. [2019-12-07 21:54:12,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:12,302 INFO L93 Difference]: Finished difference Result 27225 states and 81337 transitions. [2019-12-07 21:54:12,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 21:54:12,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 21:54:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:12,334 INFO L225 Difference]: With dead ends: 27225 [2019-12-07 21:54:12,334 INFO L226 Difference]: Without dead ends: 27225 [2019-12-07 21:54:12,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 21:54:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27225 states. [2019-12-07 21:54:12,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27225 to 19532. [2019-12-07 21:54:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19532 states. [2019-12-07 21:54:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19532 states to 19532 states and 60108 transitions. [2019-12-07 21:54:12,689 INFO L78 Accepts]: Start accepts. Automaton has 19532 states and 60108 transitions. Word has length 33 [2019-12-07 21:54:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:12,689 INFO L462 AbstractCegarLoop]: Abstraction has 19532 states and 60108 transitions. [2019-12-07 21:54:12,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:54:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 19532 states and 60108 transitions. [2019-12-07 21:54:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 21:54:12,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:12,707 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] [2019-12-07 21:54:12,707 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1293540528, now seen corresponding path program 1 times [2019-12-07 21:54:12,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:12,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335832465] [2019-12-07 21:54:12,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:12,758 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 21:54:12,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335832465] [2019-12-07 21:54:12,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:12,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:54:12,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082956909] [2019-12-07 21:54:12,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:54:12,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:12,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:54:12,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:54:12,760 INFO L87 Difference]: Start difference. First operand 19532 states and 60108 transitions. Second operand 3 states. [2019-12-07 21:54:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:12,812 INFO L93 Difference]: Finished difference Result 18664 states and 56622 transitions. [2019-12-07 21:54:12,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:54:12,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 21:54:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:12,836 INFO L225 Difference]: With dead ends: 18664 [2019-12-07 21:54:12,836 INFO L226 Difference]: Without dead ends: 18664 [2019-12-07 21:54:12,836 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 21:54:12,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18664 states. [2019-12-07 21:54:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18664 to 18390. [2019-12-07 21:54:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18390 states. [2019-12-07 21:54:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18390 states to 18390 states and 55854 transitions. [2019-12-07 21:54:13,111 INFO L78 Accepts]: Start accepts. Automaton has 18390 states and 55854 transitions. Word has length 40 [2019-12-07 21:54:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:13,111 INFO L462 AbstractCegarLoop]: Abstraction has 18390 states and 55854 transitions. [2019-12-07 21:54:13,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:54:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 18390 states and 55854 transitions. [2019-12-07 21:54:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 21:54:13,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:13,127 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] [2019-12-07 21:54:13,127 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:13,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:13,128 INFO L82 PathProgramCache]: Analyzing trace with hash -448595313, now seen corresponding path program 1 times [2019-12-07 21:54:13,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:13,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566957239] [2019-12-07 21:54:13,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:13,178 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 21:54:13,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566957239] [2019-12-07 21:54:13,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:13,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:54:13,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497761006] [2019-12-07 21:54:13,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:54:13,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:13,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:54:13,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:54:13,179 INFO L87 Difference]: Start difference. First operand 18390 states and 55854 transitions. Second operand 5 states. [2019-12-07 21:54:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:13,231 INFO L93 Difference]: Finished difference Result 16867 states and 52454 transitions. [2019-12-07 21:54:13,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:54:13,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 21:54:13,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:13,250 INFO L225 Difference]: With dead ends: 16867 [2019-12-07 21:54:13,250 INFO L226 Difference]: Without dead ends: 16867 [2019-12-07 21:54:13,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:54:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16867 states. [2019-12-07 21:54:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16867 to 15238. [2019-12-07 21:54:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15238 states. [2019-12-07 21:54:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15238 states to 15238 states and 47616 transitions. [2019-12-07 21:54:13,491 INFO L78 Accepts]: Start accepts. Automaton has 15238 states and 47616 transitions. Word has length 41 [2019-12-07 21:54:13,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:13,491 INFO L462 AbstractCegarLoop]: Abstraction has 15238 states and 47616 transitions. [2019-12-07 21:54:13,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:54:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 15238 states and 47616 transitions. [2019-12-07 21:54:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:54:13,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:13,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:54:13,596 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:13,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1623524162, now seen corresponding path program 1 times [2019-12-07 21:54:13,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:13,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478670038] [2019-12-07 21:54:13,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:13,636 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 21:54:13,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478670038] [2019-12-07 21:54:13,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:13,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:54:13,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830753649] [2019-12-07 21:54:13,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:54:13,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:54:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:54:13,637 INFO L87 Difference]: Start difference. First operand 15238 states and 47616 transitions. Second operand 3 states. [2019-12-07 21:54:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:13,721 INFO L93 Difference]: Finished difference Result 18380 states and 57153 transitions. [2019-12-07 21:54:13,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:54:13,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 21:54:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:13,742 INFO L225 Difference]: With dead ends: 18380 [2019-12-07 21:54:13,742 INFO L226 Difference]: Without dead ends: 18380 [2019-12-07 21:54:13,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:54:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2019-12-07 21:54:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 15494. [2019-12-07 21:54:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15494 states. [2019-12-07 21:54:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15494 states to 15494 states and 48492 transitions. [2019-12-07 21:54:13,990 INFO L78 Accepts]: Start accepts. Automaton has 15494 states and 48492 transitions. Word has length 66 [2019-12-07 21:54:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:13,991 INFO L462 AbstractCegarLoop]: Abstraction has 15494 states and 48492 transitions. [2019-12-07 21:54:13,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:54:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 15494 states and 48492 transitions. [2019-12-07 21:54:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:54:14,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:14,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:54:14,005 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:14,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:14,005 INFO L82 PathProgramCache]: Analyzing trace with hash 600429612, now seen corresponding path program 1 times [2019-12-07 21:54:14,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:14,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590250538] [2019-12-07 21:54:14,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:14,050 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 21:54:14,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590250538] [2019-12-07 21:54:14,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:14,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:54:14,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102098493] [2019-12-07 21:54:14,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:54:14,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:14,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:54:14,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:54:14,052 INFO L87 Difference]: Start difference. First operand 15494 states and 48492 transitions. Second operand 4 states. [2019-12-07 21:54:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:14,139 INFO L93 Difference]: Finished difference Result 18353 states and 57063 transitions. [2019-12-07 21:54:14,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:54:14,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 21:54:14,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:14,161 INFO L225 Difference]: With dead ends: 18353 [2019-12-07 21:54:14,161 INFO L226 Difference]: Without dead ends: 18353 [2019-12-07 21:54:14,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 21:54:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18353 states. [2019-12-07 21:54:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18353 to 15150. [2019-12-07 21:54:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15150 states. [2019-12-07 21:54:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15150 states to 15150 states and 47431 transitions. [2019-12-07 21:54:14,409 INFO L78 Accepts]: Start accepts. Automaton has 15150 states and 47431 transitions. Word has length 67 [2019-12-07 21:54:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:14,409 INFO L462 AbstractCegarLoop]: Abstraction has 15150 states and 47431 transitions. [2019-12-07 21:54:14,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:54:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 15150 states and 47431 transitions. [2019-12-07 21:54:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:54:14,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:14,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:54:14,423 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:14,423 INFO L82 PathProgramCache]: Analyzing trace with hash 384042528, now seen corresponding path program 1 times [2019-12-07 21:54:14,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:14,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812965019] [2019-12-07 21:54:14,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:14,620 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 21:54:14,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812965019] [2019-12-07 21:54:14,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:14,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 21:54:14,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102041355] [2019-12-07 21:54:14,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 21:54:14,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:14,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 21:54:14,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:54:14,621 INFO L87 Difference]: Start difference. First operand 15150 states and 47431 transitions. Second operand 11 states. [2019-12-07 21:54:16,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:16,088 INFO L93 Difference]: Finished difference Result 58291 states and 182798 transitions. [2019-12-07 21:54:16,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-07 21:54:16,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 21:54:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:16,132 INFO L225 Difference]: With dead ends: 58291 [2019-12-07 21:54:16,132 INFO L226 Difference]: Without dead ends: 35777 [2019-12-07 21:54:16,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=447, Invalid=2103, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 21:54:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35777 states. [2019-12-07 21:54:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35777 to 18571. [2019-12-07 21:54:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18571 states. [2019-12-07 21:54:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18571 states to 18571 states and 57637 transitions. [2019-12-07 21:54:16,544 INFO L78 Accepts]: Start accepts. Automaton has 18571 states and 57637 transitions. Word has length 67 [2019-12-07 21:54:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:16,544 INFO L462 AbstractCegarLoop]: Abstraction has 18571 states and 57637 transitions. [2019-12-07 21:54:16,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 21:54:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 18571 states and 57637 transitions. [2019-12-07 21:54:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:54:16,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:16,561 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:54:16,561 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash -820525334, now seen corresponding path program 2 times [2019-12-07 21:54:16,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:16,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427359906] [2019-12-07 21:54:16,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:16,734 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 21:54:16,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427359906] [2019-12-07 21:54:16,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:16,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 21:54:16,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373052329] [2019-12-07 21:54:16,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:54:16,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:16,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:54:16,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:54:16,736 INFO L87 Difference]: Start difference. First operand 18571 states and 57637 transitions. Second operand 10 states. [2019-12-07 21:54:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:19,261 INFO L93 Difference]: Finished difference Result 30599 states and 94800 transitions. [2019-12-07 21:54:19,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 21:54:19,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 21:54:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:19,299 INFO L225 Difference]: With dead ends: 30599 [2019-12-07 21:54:19,299 INFO L226 Difference]: Without dead ends: 27252 [2019-12-07 21:54:19,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-07 21:54:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27252 states. [2019-12-07 21:54:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27252 to 18667. [2019-12-07 21:54:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18667 states. [2019-12-07 21:54:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18667 states to 18667 states and 57829 transitions. [2019-12-07 21:54:19,649 INFO L78 Accepts]: Start accepts. Automaton has 18667 states and 57829 transitions. Word has length 67 [2019-12-07 21:54:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:19,649 INFO L462 AbstractCegarLoop]: Abstraction has 18667 states and 57829 transitions. [2019-12-07 21:54:19,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:54:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 18667 states and 57829 transitions. [2019-12-07 21:54:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:54:19,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:19,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:54:19,667 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash 397917466, now seen corresponding path program 3 times [2019-12-07 21:54:19,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:19,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207662081] [2019-12-07 21:54:19,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:20,624 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 21:54:20,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207662081] [2019-12-07 21:54:20,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:20,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-07 21:54:20,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343972653] [2019-12-07 21:54:20,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 21:54:20,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:20,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 21:54:20,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-12-07 21:54:20,625 INFO L87 Difference]: Start difference. First operand 18667 states and 57829 transitions. Second operand 24 states. [2019-12-07 21:54:31,680 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-12-07 21:54:34,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:34,280 INFO L93 Difference]: Finished difference Result 34990 states and 105927 transitions. [2019-12-07 21:54:34,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-12-07 21:54:34,281 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-07 21:54:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:34,312 INFO L225 Difference]: With dead ends: 34990 [2019-12-07 21:54:34,312 INFO L226 Difference]: Without dead ends: 27401 [2019-12-07 21:54:34,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3285 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1469, Invalid=9243, Unknown=0, NotChecked=0, Total=10712 [2019-12-07 21:54:34,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27401 states. [2019-12-07 21:54:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27401 to 21113. [2019-12-07 21:54:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21113 states. [2019-12-07 21:54:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21113 states to 21113 states and 65267 transitions. [2019-12-07 21:54:34,682 INFO L78 Accepts]: Start accepts. Automaton has 21113 states and 65267 transitions. Word has length 67 [2019-12-07 21:54:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:34,683 INFO L462 AbstractCegarLoop]: Abstraction has 21113 states and 65267 transitions. [2019-12-07 21:54:34,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 21:54:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 21113 states and 65267 transitions. [2019-12-07 21:54:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:54:34,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:34,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:54:34,704 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:34,704 INFO L82 PathProgramCache]: Analyzing trace with hash 68355254, now seen corresponding path program 4 times [2019-12-07 21:54:34,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:34,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282965382] [2019-12-07 21:54:34,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:34,927 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 21:54:34,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282965382] [2019-12-07 21:54:34,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:34,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 21:54:34,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715121437] [2019-12-07 21:54:34,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 21:54:34,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:34,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 21:54:34,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:54:34,928 INFO L87 Difference]: Start difference. First operand 21113 states and 65267 transitions. Second operand 11 states. [2019-12-07 21:54:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:38,142 INFO L93 Difference]: Finished difference Result 42163 states and 129632 transitions. [2019-12-07 21:54:38,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 21:54:38,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 21:54:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:38,186 INFO L225 Difference]: With dead ends: 42163 [2019-12-07 21:54:38,187 INFO L226 Difference]: Without dead ends: 36332 [2019-12-07 21:54:38,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 21:54:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36332 states. [2019-12-07 21:54:38,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36332 to 22192. [2019-12-07 21:54:38,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22192 states. [2019-12-07 21:54:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22192 states to 22192 states and 68869 transitions. [2019-12-07 21:54:38,665 INFO L78 Accepts]: Start accepts. Automaton has 22192 states and 68869 transitions. Word has length 67 [2019-12-07 21:54:38,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:38,665 INFO L462 AbstractCegarLoop]: Abstraction has 22192 states and 68869 transitions. [2019-12-07 21:54:38,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 21:54:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 22192 states and 68869 transitions. [2019-12-07 21:54:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:54:38,687 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:38,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:54:38,687 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:38,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:38,688 INFO L82 PathProgramCache]: Analyzing trace with hash 773840600, now seen corresponding path program 5 times [2019-12-07 21:54:38,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:38,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939245203] [2019-12-07 21:54:38,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:38,862 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 21:54:38,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939245203] [2019-12-07 21:54:38,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:38,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 21:54:38,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385675217] [2019-12-07 21:54:38,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 21:54:38,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:54:38,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 21:54:38,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:54:38,863 INFO L87 Difference]: Start difference. First operand 22192 states and 68869 transitions. Second operand 11 states. [2019-12-07 21:54:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:54:39,598 INFO L93 Difference]: Finished difference Result 39407 states and 121457 transitions. [2019-12-07 21:54:39,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 21:54:39,598 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 21:54:39,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:54:39,641 INFO L225 Difference]: With dead ends: 39407 [2019-12-07 21:54:39,641 INFO L226 Difference]: Without dead ends: 36394 [2019-12-07 21:54:39,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-12-07 21:54:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36394 states. [2019-12-07 21:54:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36394 to 19474. [2019-12-07 21:54:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19474 states. [2019-12-07 21:54:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19474 states to 19474 states and 60611 transitions. [2019-12-07 21:54:40,058 INFO L78 Accepts]: Start accepts. Automaton has 19474 states and 60611 transitions. Word has length 67 [2019-12-07 21:54:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:54:40,058 INFO L462 AbstractCegarLoop]: Abstraction has 19474 states and 60611 transitions. [2019-12-07 21:54:40,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 21:54:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 19474 states and 60611 transitions. [2019-12-07 21:54:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:54:40,076 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:54:40,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:54:40,076 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:54:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:54:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 6 times [2019-12-07 21:54:40,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:54:40,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052260368] [2019-12-07 21:54:40,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:54:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:54:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:54:40,161 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:54:40,161 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:54:40,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23|) |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~z$r_buff0_thd3~0_416) (= (store .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23| 1) |v_#valid_60|) (= |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23|)) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1309~0.base_23|) (= 0 v_~__unbuffered_p0_EAX~0_137) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1309~0.base_23| 4) |v_#length_21|) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_12|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1309~0.offset=|v_ULTIMATE.start_main_~#t1309~0.offset_17|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274, ULTIMATE.start_main_~#t1309~0.base=|v_ULTIMATE.start_main_~#t1309~0.base_23|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1311~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1311~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1310~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1309~0.offset, #NULL.base, ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1309~0.base] because there is no mapped edge [2019-12-07 21:54:40,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1310~0.base_11| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1310~0.base_11| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1310~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11|) |v_ULTIMATE.start_main_~#t1310~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1310~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1310~0.offset] because there is no mapped edge [2019-12-07 21:54:40,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18 0)) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:54:40,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-616753894 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-616753894 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-616753894| ~z$w_buff1~0_In-616753894) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-616753894| ~z~0_In-616753894)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-616753894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-616753894, ~z$w_buff1~0=~z$w_buff1~0_In-616753894, ~z~0=~z~0_In-616753894} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-616753894|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-616753894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-616753894, ~z$w_buff1~0=~z$w_buff1~0_In-616753894, ~z~0=~z~0_In-616753894} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 21:54:40,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_6|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_6|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_5|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_5|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 21:54:40,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1311~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13|) |v_ULTIMATE.start_main_~#t1311~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1311~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1311~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_13|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1311~0.base, ULTIMATE.start_main_~#t1311~0.offset] because there is no mapped edge [2019-12-07 21:54:40,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In365422540 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In365422540 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out365422540| ~z$w_buff0_used~0_In365422540) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out365422540| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In365422540, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In365422540} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In365422540, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out365422540|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In365422540} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 21:54:40,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In801614043 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In801614043 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In801614043 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In801614043 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out801614043|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite12_Out801614043| ~z$w_buff1_used~0_In801614043)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In801614043, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In801614043, ~z$w_buff1_used~0=~z$w_buff1_used~0_In801614043, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In801614043} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In801614043, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In801614043, ~z$w_buff1_used~0=~z$w_buff1_used~0_In801614043, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out801614043|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In801614043} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 21:54:40,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1248411670 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1248411670 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1248411670|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In1248411670 |P1Thread1of1ForFork2_#t~ite13_Out1248411670|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1248411670, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1248411670} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1248411670, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1248411670|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1248411670} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 21:54:40,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In552793088 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In552793088| |P2Thread1of1ForFork0_#t~ite26_Out552793088|) (= ~z$w_buff0_used~0_In552793088 |P2Thread1of1ForFork0_#t~ite27_Out552793088|)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out552793088| ~z$w_buff0_used~0_In552793088) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In552793088 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In552793088 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In552793088 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In552793088 256))))) .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out552793088| |P2Thread1of1ForFork0_#t~ite27_Out552793088|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In552793088|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In552793088, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In552793088, ~z$w_buff1_used~0=~z$w_buff1_used~0_In552793088, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In552793088, ~weak$$choice2~0=~weak$$choice2~0_In552793088} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out552793088|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out552793088|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In552793088, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In552793088, ~z$w_buff1_used~0=~z$w_buff1_used~0_In552793088, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In552793088, ~weak$$choice2~0=~weak$$choice2~0_In552793088} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 21:54:40,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 21:54:40,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In342122211 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In342122211 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out342122211| ~z$w_buff0_used~0_In342122211)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out342122211| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In342122211, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In342122211} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out342122211|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In342122211, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In342122211} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 21:54:40,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 21:54:40,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1930138529| |P2Thread1of1ForFork0_#t~ite39_Out1930138529|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1930138529 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1930138529 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1930138529| ~z~0_In1930138529) (or .cse1 .cse2)) (and .cse0 (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out1930138529| ~z$w_buff1~0_In1930138529) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1930138529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1930138529, ~z$w_buff1~0=~z$w_buff1~0_In1930138529, ~z~0=~z~0_In1930138529} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1930138529|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1930138529|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1930138529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1930138529, ~z$w_buff1~0=~z$w_buff1~0_In1930138529, ~z~0=~z~0_In1930138529} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 21:54:40,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In412553867 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In412553867 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out412553867| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out412553867| ~z$w_buff0_used~0_In412553867)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In412553867, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In412553867} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In412553867, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out412553867|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In412553867} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 21:54:40,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2014346326 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2014346326 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-2014346326 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2014346326 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-2014346326| 0)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-2014346326| ~z$w_buff1_used~0_In-2014346326) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2014346326, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2014346326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2014346326, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2014346326} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2014346326, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2014346326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2014346326, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2014346326, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2014346326|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 21:54:40,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1020053088 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1020053088 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1020053088| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1020053088| ~z$r_buff0_thd3~0_In1020053088)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1020053088, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1020053088} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1020053088, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1020053088, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1020053088|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 21:54:40,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In-1013006869 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1013006869 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1013006869 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1013006869 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1013006869|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-1013006869 |P2Thread1of1ForFork0_#t~ite43_Out-1013006869|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013006869, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1013006869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1013006869, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1013006869} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1013006869|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013006869, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1013006869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1013006869, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1013006869} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 21:54:40,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 21:54:40,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1315665681 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1315665681 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1315665681 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1315665681 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1315665681| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1315665681| ~z$w_buff1_used~0_In-1315665681) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1315665681, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1315665681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1315665681, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1315665681} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1315665681, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1315665681|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1315665681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1315665681, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1315665681} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 21:54:40,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= ~z$r_buff0_thd1~0_Out2105072984 ~z$r_buff0_thd1~0_In2105072984)) (.cse0 (= (mod ~z$w_buff0_used~0_In2105072984 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In2105072984 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (= ~z$r_buff0_thd1~0_Out2105072984 0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2105072984, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2105072984} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2105072984, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2105072984|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2105072984} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:54:40,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In632435688 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In632435688 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In632435688 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In632435688 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out632435688| ~z$r_buff1_thd1~0_In632435688) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite8_Out632435688| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In632435688, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In632435688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In632435688, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In632435688} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out632435688|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In632435688, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In632435688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In632435688, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In632435688} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 21:54:40,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_42|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_41|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 21:54:40,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In407619878 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In407619878 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In407619878 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In407619878 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out407619878| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In407619878 |P1Thread1of1ForFork2_#t~ite14_Out407619878|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In407619878, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In407619878, ~z$w_buff1_used~0=~z$w_buff1_used~0_In407619878, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In407619878} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In407619878, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In407619878, ~z$w_buff1_used~0=~z$w_buff1_used~0_In407619878, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out407619878|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In407619878} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 21:54:40,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_32|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 21:54:40,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:54:40,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In2135454855 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out2135454855| |ULTIMATE.start_main_#t~ite48_Out2135454855|)) (.cse2 (= (mod ~z$w_buff1_used~0_In2135454855 256) 0))) (or (and (= ~z~0_In2135454855 |ULTIMATE.start_main_#t~ite47_Out2135454855|) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |ULTIMATE.start_main_#t~ite47_Out2135454855| ~z$w_buff1~0_In2135454855) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2135454855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135454855, ~z$w_buff1~0=~z$w_buff1~0_In2135454855, ~z~0=~z~0_In2135454855} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2135454855, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2135454855|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135454855, ~z$w_buff1~0=~z$w_buff1~0_In2135454855, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out2135454855|, ~z~0=~z~0_In2135454855} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 21:54:40,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1008777195 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1008777195 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1008777195|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1008777195 |ULTIMATE.start_main_#t~ite49_Out1008777195|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1008777195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1008777195} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1008777195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1008777195, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1008777195|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 21:54:40,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2117960102 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2117960102 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In2117960102 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In2117960102 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out2117960102| 0)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In2117960102 |ULTIMATE.start_main_#t~ite50_Out2117960102|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2117960102, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2117960102, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2117960102, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2117960102} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2117960102|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2117960102, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2117960102, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2117960102, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2117960102} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 21:54:40,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In210859717 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In210859717 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out210859717| 0)) (and (= ~z$r_buff0_thd0~0_In210859717 |ULTIMATE.start_main_#t~ite51_Out210859717|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In210859717, ~z$w_buff0_used~0=~z$w_buff0_used~0_In210859717} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In210859717, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out210859717|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In210859717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 21:54:40,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1832606265 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1832606265 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1832606265 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1832606265 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1832606265| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out1832606265| ~z$r_buff1_thd0~0_In1832606265) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1832606265, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1832606265, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1832606265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1832606265} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1832606265|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1832606265, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1832606265, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1832606265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1832606265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 21:54:40,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:54:40,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:54:40 BasicIcfg [2019-12-07 21:54:40,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:54:40,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:54:40,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:54:40,229 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:54:40,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:52:19" (3/4) ... [2019-12-07 21:54:40,231 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:54:40,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23|) |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~z$r_buff0_thd3~0_416) (= (store .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23| 1) |v_#valid_60|) (= |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23|)) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1309~0.base_23|) (= 0 v_~__unbuffered_p0_EAX~0_137) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1309~0.base_23| 4) |v_#length_21|) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_12|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1309~0.offset=|v_ULTIMATE.start_main_~#t1309~0.offset_17|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274, ULTIMATE.start_main_~#t1309~0.base=|v_ULTIMATE.start_main_~#t1309~0.base_23|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1311~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1311~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1310~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1309~0.offset, #NULL.base, ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1309~0.base] because there is no mapped edge [2019-12-07 21:54:40,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1310~0.base_11| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1310~0.base_11| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1310~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11|) |v_ULTIMATE.start_main_~#t1310~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1310~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1310~0.offset] because there is no mapped edge [2019-12-07 21:54:40,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18 0)) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:54:40,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-616753894 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-616753894 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-616753894| ~z$w_buff1~0_In-616753894) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-616753894| ~z~0_In-616753894)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-616753894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-616753894, ~z$w_buff1~0=~z$w_buff1~0_In-616753894, ~z~0=~z~0_In-616753894} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-616753894|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-616753894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-616753894, ~z$w_buff1~0=~z$w_buff1~0_In-616753894, ~z~0=~z~0_In-616753894} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 21:54:40,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_6|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_6|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_5|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_5|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 21:54:40,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1311~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13|) |v_ULTIMATE.start_main_~#t1311~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1311~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1311~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_13|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1311~0.base, ULTIMATE.start_main_~#t1311~0.offset] because there is no mapped edge [2019-12-07 21:54:40,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In365422540 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In365422540 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out365422540| ~z$w_buff0_used~0_In365422540) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out365422540| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In365422540, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In365422540} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In365422540, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out365422540|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In365422540} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 21:54:40,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In801614043 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In801614043 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In801614043 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In801614043 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out801614043|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite12_Out801614043| ~z$w_buff1_used~0_In801614043)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In801614043, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In801614043, ~z$w_buff1_used~0=~z$w_buff1_used~0_In801614043, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In801614043} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In801614043, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In801614043, ~z$w_buff1_used~0=~z$w_buff1_used~0_In801614043, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out801614043|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In801614043} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 21:54:40,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1248411670 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1248411670 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1248411670|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In1248411670 |P1Thread1of1ForFork2_#t~ite13_Out1248411670|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1248411670, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1248411670} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1248411670, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1248411670|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1248411670} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 21:54:40,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In552793088 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In552793088| |P2Thread1of1ForFork0_#t~ite26_Out552793088|) (= ~z$w_buff0_used~0_In552793088 |P2Thread1of1ForFork0_#t~ite27_Out552793088|)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out552793088| ~z$w_buff0_used~0_In552793088) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In552793088 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In552793088 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In552793088 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In552793088 256))))) .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out552793088| |P2Thread1of1ForFork0_#t~ite27_Out552793088|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In552793088|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In552793088, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In552793088, ~z$w_buff1_used~0=~z$w_buff1_used~0_In552793088, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In552793088, ~weak$$choice2~0=~weak$$choice2~0_In552793088} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out552793088|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out552793088|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In552793088, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In552793088, ~z$w_buff1_used~0=~z$w_buff1_used~0_In552793088, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In552793088, ~weak$$choice2~0=~weak$$choice2~0_In552793088} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 21:54:40,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 21:54:40,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In342122211 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In342122211 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out342122211| ~z$w_buff0_used~0_In342122211)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out342122211| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In342122211, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In342122211} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out342122211|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In342122211, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In342122211} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 21:54:40,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 21:54:40,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1930138529| |P2Thread1of1ForFork0_#t~ite39_Out1930138529|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1930138529 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1930138529 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1930138529| ~z~0_In1930138529) (or .cse1 .cse2)) (and .cse0 (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out1930138529| ~z$w_buff1~0_In1930138529) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1930138529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1930138529, ~z$w_buff1~0=~z$w_buff1~0_In1930138529, ~z~0=~z~0_In1930138529} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1930138529|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1930138529|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1930138529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1930138529, ~z$w_buff1~0=~z$w_buff1~0_In1930138529, ~z~0=~z~0_In1930138529} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 21:54:40,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In412553867 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In412553867 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out412553867| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out412553867| ~z$w_buff0_used~0_In412553867)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In412553867, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In412553867} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In412553867, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out412553867|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In412553867} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 21:54:40,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2014346326 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2014346326 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-2014346326 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2014346326 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-2014346326| 0)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-2014346326| ~z$w_buff1_used~0_In-2014346326) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2014346326, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2014346326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2014346326, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2014346326} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2014346326, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2014346326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2014346326, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2014346326, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2014346326|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 21:54:40,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1020053088 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1020053088 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1020053088| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1020053088| ~z$r_buff0_thd3~0_In1020053088)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1020053088, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1020053088} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1020053088, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1020053088, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1020053088|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 21:54:40,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In-1013006869 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1013006869 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1013006869 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1013006869 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1013006869|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-1013006869 |P2Thread1of1ForFork0_#t~ite43_Out-1013006869|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013006869, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1013006869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1013006869, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1013006869} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1013006869|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013006869, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1013006869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1013006869, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1013006869} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 21:54:40,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 21:54:40,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1315665681 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1315665681 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1315665681 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1315665681 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1315665681| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1315665681| ~z$w_buff1_used~0_In-1315665681) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1315665681, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1315665681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1315665681, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1315665681} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1315665681, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1315665681|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1315665681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1315665681, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1315665681} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 21:54:40,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= ~z$r_buff0_thd1~0_Out2105072984 ~z$r_buff0_thd1~0_In2105072984)) (.cse0 (= (mod ~z$w_buff0_used~0_In2105072984 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In2105072984 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (= ~z$r_buff0_thd1~0_Out2105072984 0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2105072984, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2105072984} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2105072984, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2105072984|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2105072984} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:54:40,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In632435688 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In632435688 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In632435688 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In632435688 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out632435688| ~z$r_buff1_thd1~0_In632435688) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite8_Out632435688| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In632435688, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In632435688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In632435688, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In632435688} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out632435688|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In632435688, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In632435688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In632435688, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In632435688} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 21:54:40,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_42|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_41|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 21:54:40,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In407619878 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In407619878 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In407619878 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In407619878 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out407619878| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In407619878 |P1Thread1of1ForFork2_#t~ite14_Out407619878|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In407619878, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In407619878, ~z$w_buff1_used~0=~z$w_buff1_used~0_In407619878, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In407619878} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In407619878, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In407619878, ~z$w_buff1_used~0=~z$w_buff1_used~0_In407619878, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out407619878|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In407619878} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 21:54:40,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_32|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 21:54:40,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:54:40,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In2135454855 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out2135454855| |ULTIMATE.start_main_#t~ite48_Out2135454855|)) (.cse2 (= (mod ~z$w_buff1_used~0_In2135454855 256) 0))) (or (and (= ~z~0_In2135454855 |ULTIMATE.start_main_#t~ite47_Out2135454855|) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |ULTIMATE.start_main_#t~ite47_Out2135454855| ~z$w_buff1~0_In2135454855) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2135454855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135454855, ~z$w_buff1~0=~z$w_buff1~0_In2135454855, ~z~0=~z~0_In2135454855} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2135454855, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2135454855|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135454855, ~z$w_buff1~0=~z$w_buff1~0_In2135454855, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out2135454855|, ~z~0=~z~0_In2135454855} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 21:54:40,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1008777195 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1008777195 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1008777195|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1008777195 |ULTIMATE.start_main_#t~ite49_Out1008777195|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1008777195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1008777195} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1008777195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1008777195, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1008777195|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 21:54:40,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2117960102 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2117960102 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In2117960102 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In2117960102 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out2117960102| 0)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In2117960102 |ULTIMATE.start_main_#t~ite50_Out2117960102|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2117960102, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2117960102, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2117960102, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2117960102} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2117960102|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2117960102, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2117960102, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2117960102, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2117960102} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 21:54:40,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In210859717 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In210859717 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out210859717| 0)) (and (= ~z$r_buff0_thd0~0_In210859717 |ULTIMATE.start_main_#t~ite51_Out210859717|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In210859717, ~z$w_buff0_used~0=~z$w_buff0_used~0_In210859717} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In210859717, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out210859717|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In210859717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 21:54:40,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1832606265 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1832606265 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1832606265 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1832606265 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1832606265| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out1832606265| ~z$r_buff1_thd0~0_In1832606265) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1832606265, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1832606265, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1832606265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1832606265} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1832606265|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1832606265, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1832606265, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1832606265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1832606265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 21:54:40,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:54:40,301 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e9a78b21-7739-4473-ba91-88e9be056085/bin/utaipan/witness.graphml [2019-12-07 21:54:40,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:54:40,302 INFO L168 Benchmark]: Toolchain (without parser) took 141864.19 ms. Allocated memory was 1.0 GB in the beginning and 6.8 GB in the end (delta: 5.8 GB). Free memory was 937.0 MB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 21:54:40,302 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:54:40,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -139.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:54:40,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.13 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 21:54:40,303 INFO L168 Benchmark]: Boogie Preprocessor took 31.46 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 21:54:40,303 INFO L168 Benchmark]: RCFGBuilder took 406.05 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: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:54:40,303 INFO L168 Benchmark]: TraceAbstraction took 140864.77 ms. Allocated memory was 1.1 GB in the beginning and 6.8 GB in the end (delta: 5.7 GB). Free memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 21:54:40,304 INFO L168 Benchmark]: Witness Printer took 72.05 ms. Allocated memory is still 6.8 GB. Free memory was 5.1 GB in the beginning and 5.1 GB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:54:40,305 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 439.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -139.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.13 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. * Boogie Preprocessor took 31.46 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 406.05 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: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 140864.77 ms. Allocated memory was 1.1 GB in the beginning and 6.8 GB in the end (delta: 5.7 GB). Free memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 72.05 ms. Allocated memory is still 6.8 GB. Free memory was 5.1 GB in the beginning and 5.1 GB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1311, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 140.7s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 39.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5210 SDtfs, 7057 SDslu, 22214 SDs, 0 SdLazy, 17421 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 28 SyntacticMatches, 16 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4594 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237826occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 75.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 297559 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 847 NumberOfCodeBlocks, 847 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 759 ConstructedInterpolants, 0 QuantifiedInterpolants, 316745 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...