./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe024_power.opt.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_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe024_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/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 3a0fda00dffe56741f4c5e0b5309790cce37d51a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:09:03,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:09:03,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:09:03,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:09:03,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:09:03,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:09:03,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:09:03,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:09:03,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:09:03,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:09:03,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:09:03,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:09:03,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:09:03,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:09:03,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:09:03,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:09:03,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:09:03,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:09:03,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:09:03,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:09:03,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:09:03,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:09:03,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:09:03,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:09:03,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:09:03,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:09:03,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:09:03,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:09:03,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:09:03,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:09:03,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:09:03,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:09:03,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:09:03,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:09:03,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:09:03,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:09:03,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:09:03,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:09:03,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:09:03,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:09:03,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:09:03,917 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:09:03,927 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:09:03,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:09:03,928 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:09:03,928 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:09:03,928 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:09:03,928 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:09:03,928 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:09:03,928 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:09:03,928 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:09:03,928 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:09:03,929 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:09:03,929 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:09:03,929 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:09:03,929 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:09:03,929 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:09:03,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:09:03,930 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:09:03,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:09:03,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:09:03,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:09:03,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:09:03,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:09:03,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:09:03,931 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:09:03,931 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:09:03,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:09:03,931 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:09:03,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:09:03,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:09:03,931 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:09:03,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:09:03,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:09:03,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:09:03,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:09:03,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:09:03,932 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:09:03,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:09:03,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:09:03,933 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:09:03,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:09:03,933 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_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/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 -> 3a0fda00dffe56741f4c5e0b5309790cce37d51a [2019-12-07 19:09:04,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:09:04,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:09:04,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:09:04,053 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:09:04,054 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:09:04,054 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe024_power.opt.i [2019-12-07 19:09:04,090 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/bin/utaipan/data/2b1f3fa36/e40cf0fd81b346828852ff3a455e4720/FLAGdbcc53295 [2019-12-07 19:09:04,560 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:09:04,560 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/sv-benchmarks/c/pthread-wmm/safe024_power.opt.i [2019-12-07 19:09:04,570 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/bin/utaipan/data/2b1f3fa36/e40cf0fd81b346828852ff3a455e4720/FLAGdbcc53295 [2019-12-07 19:09:04,579 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/bin/utaipan/data/2b1f3fa36/e40cf0fd81b346828852ff3a455e4720 [2019-12-07 19:09:04,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:09:04,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:09:04,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:09:04,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:09:04,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:09:04,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:09:04" (1/1) ... [2019-12-07 19:09:04,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd1e142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04, skipping insertion in model container [2019-12-07 19:09:04,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:09:04" (1/1) ... [2019-12-07 19:09:04,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:09:04,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:09:04,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:09:04,865 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:09:04,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:09:04,952 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:09:04,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04 WrapperNode [2019-12-07 19:09:04,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:09:04,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:09:04,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:09:04,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:09:04,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04" (1/1) ... [2019-12-07 19:09:04,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04" (1/1) ... [2019-12-07 19:09:04,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:09:04,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:09:04,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:09:04,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:09:04,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04" (1/1) ... [2019-12-07 19:09:04,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04" (1/1) ... [2019-12-07 19:09:05,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04" (1/1) ... [2019-12-07 19:09:05,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04" (1/1) ... [2019-12-07 19:09:05,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04" (1/1) ... [2019-12-07 19:09:05,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04" (1/1) ... [2019-12-07 19:09:05,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04" (1/1) ... [2019-12-07 19:09:05,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:09:05,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:09:05,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:09:05,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:09:05,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/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 19:09:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:09:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:09:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:09:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:09:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:09:05,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:09:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:09:05,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:09:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:09:05,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:09:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:09:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:09:05,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:09:05,060 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 19:09:05,409 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:09:05,409 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:09:05,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:09:05 BoogieIcfgContainer [2019-12-07 19:09:05,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:09:05,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:09:05,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:09:05,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:09:05,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:09:04" (1/3) ... [2019-12-07 19:09:05,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55878b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:09:05, skipping insertion in model container [2019-12-07 19:09:05,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:04" (2/3) ... [2019-12-07 19:09:05,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55878b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:09:05, skipping insertion in model container [2019-12-07 19:09:05,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:09:05" (3/3) ... [2019-12-07 19:09:05,415 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.opt.i [2019-12-07 19:09:05,421 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:09:05,421 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:09:05,426 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:09:05,426 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:09:05,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,450 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,450 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,466 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,466 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:05,480 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 19:09:05,492 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:09:05,492 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:09:05,493 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:09:05,493 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:09:05,493 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:09:05,493 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:09:05,493 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:09:05,493 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:09:05,504 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-07 19:09:05,505 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 19:09:05,558 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 19:09:05,558 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:09:05,569 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:09:05,583 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 19:09:05,618 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 19:09:05,618 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:09:05,624 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:09:05,638 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 19:09:05,638 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:09:08,737 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 19:09:08,830 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-07 19:09:08,830 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 19:09:08,832 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-07 19:09:18,443 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-07 19:09:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-07 19:09:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:09:18,449 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:18,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:09:18,449 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-07 19:09:18,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:18,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457192773] [2019-12-07 19:09:18,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:18,612 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 19:09:18,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457192773] [2019-12-07 19:09:18,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:18,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:09:18,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264123228] [2019-12-07 19:09:18,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:18,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:18,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:18,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:18,628 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-07 19:09:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:19,209 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-07 19:09:19,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:19,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 19:09:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:19,758 INFO L225 Difference]: With dead ends: 87834 [2019-12-07 19:09:19,758 INFO L226 Difference]: Without dead ends: 82738 [2019-12-07 19:09:19,759 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 19:09:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-07 19:09:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-07 19:09:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-07 19:09:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-07 19:09:24,486 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-07 19:09:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:24,487 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-07 19:09:24,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-07 19:09:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:09:24,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:24,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:24,495 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:24,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:24,495 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-07 19:09:24,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:24,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299133363] [2019-12-07 19:09:24,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:24,563 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 19:09:24,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299133363] [2019-12-07 19:09:24,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:24,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:09:24,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286656442] [2019-12-07 19:09:24,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:09:24,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:24,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:09:24,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:09:24,565 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-07 19:09:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:26,720 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-07 19:09:26,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:09:26,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:09:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:27,084 INFO L225 Difference]: With dead ends: 127286 [2019-12-07 19:09:27,084 INFO L226 Difference]: Without dead ends: 127202 [2019-12-07 19:09:27,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 19:09:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-07 19:09:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-07 19:09:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-07 19:09:32,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-07 19:09:32,798 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-07 19:09:32,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:32,799 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-07 19:09:32,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:09:32,799 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-07 19:09:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:09:32,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:32,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:32,802 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:32,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-07 19:09:32,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:32,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107639908] [2019-12-07 19:09:32,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:32,844 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 19:09:32,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107639908] [2019-12-07 19:09:32,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:32,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:09:32,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904486017] [2019-12-07 19:09:32,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:32,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:32,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:32,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:32,846 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-07 19:09:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:32,933 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-07 19:09:32,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:32,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 19:09:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:32,977 INFO L225 Difference]: With dead ends: 28492 [2019-12-07 19:09:32,977 INFO L226 Difference]: Without dead ends: 28492 [2019-12-07 19:09:32,978 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 19:09:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-07 19:09:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-07 19:09:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-07 19:09:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-07 19:09:33,462 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-07 19:09:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:33,462 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-07 19:09:33,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-07 19:09:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:09:33,464 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:33,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:33,464 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:33,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:33,464 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-07 19:09:33,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:33,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025888524] [2019-12-07 19:09:33,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:33,517 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 19:09:33,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025888524] [2019-12-07 19:09:33,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:33,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:33,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841045702] [2019-12-07 19:09:33,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:33,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:33,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:33,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:33,518 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-07 19:09:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:34,081 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-07 19:09:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:09:34,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 19:09:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:34,136 INFO L225 Difference]: With dead ends: 41156 [2019-12-07 19:09:34,136 INFO L226 Difference]: Without dead ends: 41141 [2019-12-07 19:09:34,136 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 19:09:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-07 19:09:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-07 19:09:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-07 19:09:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-07 19:09:34,714 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-07 19:09:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:34,715 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-07 19:09:34,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-07 19:09:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:09:34,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:34,723 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 19:09:34,723 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:34,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:34,723 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-07 19:09:34,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:34,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620622228] [2019-12-07 19:09:34,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:34,807 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 19:09:34,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620622228] [2019-12-07 19:09:34,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:34,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:09:34,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698205662] [2019-12-07 19:09:34,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:09:34,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:34,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:09:34,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:09:34,809 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-07 19:09:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:35,383 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-07 19:09:35,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:09:35,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 19:09:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:35,452 INFO L225 Difference]: With dead ends: 48363 [2019-12-07 19:09:35,452 INFO L226 Difference]: Without dead ends: 48336 [2019-12-07 19:09:35,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 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 19:09:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-07 19:09:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-07 19:09:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-07 19:09:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-07 19:09:36,100 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-07 19:09:36,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:36,100 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-07 19:09:36,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:09:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-07 19:09:36,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:09:36,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:36,111 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 19:09:36,111 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:36,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:36,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-07 19:09:36,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:36,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600056040] [2019-12-07 19:09:36,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:36,172 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 19:09:36,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600056040] [2019-12-07 19:09:36,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:36,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:36,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447299078] [2019-12-07 19:09:36,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:36,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:36,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:36,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:36,174 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 5 states. [2019-12-07 19:09:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:36,501 INFO L93 Difference]: Finished difference Result 44326 states and 144194 transitions. [2019-12-07 19:09:36,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:09:36,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 19:09:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:36,563 INFO L225 Difference]: With dead ends: 44326 [2019-12-07 19:09:36,563 INFO L226 Difference]: Without dead ends: 44303 [2019-12-07 19:09:36,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:09:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44303 states. [2019-12-07 19:09:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44303 to 37268. [2019-12-07 19:09:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37268 states. [2019-12-07 19:09:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37268 states to 37268 states and 122134 transitions. [2019-12-07 19:09:37,402 INFO L78 Accepts]: Start accepts. Automaton has 37268 states and 122134 transitions. Word has length 25 [2019-12-07 19:09:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:37,402 INFO L462 AbstractCegarLoop]: Abstraction has 37268 states and 122134 transitions. [2019-12-07 19:09:37,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 37268 states and 122134 transitions. [2019-12-07 19:09:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 19:09:37,414 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:37,414 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 19:09:37,414 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:37,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:37,414 INFO L82 PathProgramCache]: Analyzing trace with hash -353872392, now seen corresponding path program 1 times [2019-12-07 19:09:37,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:37,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151385349] [2019-12-07 19:09:37,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:37,447 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 19:09:37,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151385349] [2019-12-07 19:09:37,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:37,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:37,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113320410] [2019-12-07 19:09:37,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:09:37,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:37,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:09:37,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:09:37,448 INFO L87 Difference]: Start difference. First operand 37268 states and 122134 transitions. Second operand 4 states. [2019-12-07 19:09:37,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:37,496 INFO L93 Difference]: Finished difference Result 13778 states and 41802 transitions. [2019-12-07 19:09:37,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:09:37,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 19:09:37,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:37,512 INFO L225 Difference]: With dead ends: 13778 [2019-12-07 19:09:37,512 INFO L226 Difference]: Without dead ends: 13778 [2019-12-07 19:09:37,512 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 19:09:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2019-12-07 19:09:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 13498. [2019-12-07 19:09:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13498 states. [2019-12-07 19:09:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13498 states to 13498 states and 40957 transitions. [2019-12-07 19:09:37,698 INFO L78 Accepts]: Start accepts. Automaton has 13498 states and 40957 transitions. Word has length 27 [2019-12-07 19:09:37,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:37,698 INFO L462 AbstractCegarLoop]: Abstraction has 13498 states and 40957 transitions. [2019-12-07 19:09:37,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:09:37,698 INFO L276 IsEmpty]: Start isEmpty. Operand 13498 states and 40957 transitions. [2019-12-07 19:09:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:09:37,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:37,714 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] [2019-12-07 19:09:37,714 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:37,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:37,715 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-07 19:09:37,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:37,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328014461] [2019-12-07 19:09:37,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:37,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 19:09:37,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328014461] [2019-12-07 19:09:37,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:37,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:09:37,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491896659] [2019-12-07 19:09:37,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:37,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:37,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:37,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:37,759 INFO L87 Difference]: Start difference. First operand 13498 states and 40957 transitions. Second operand 5 states. [2019-12-07 19:09:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:37,808 INFO L93 Difference]: Finished difference Result 11986 states and 37151 transitions. [2019-12-07 19:09:37,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:09:37,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 19:09:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:37,822 INFO L225 Difference]: With dead ends: 11986 [2019-12-07 19:09:37,822 INFO L226 Difference]: Without dead ends: 11986 [2019-12-07 19:09:37,822 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 19:09:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11986 states. [2019-12-07 19:09:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11986 to 10977. [2019-12-07 19:09:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-07 19:09:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-07 19:09:37,987 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-07 19:09:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:37,987 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-07 19:09:37,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-07 19:09:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:09:38,002 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:38,002 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] [2019-12-07 19:09:38,002 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:38,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-07 19:09:38,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:38,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921121748] [2019-12-07 19:09:38,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:38,073 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 19:09:38,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921121748] [2019-12-07 19:09:38,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:38,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:09:38,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144186896] [2019-12-07 19:09:38,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:38,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:38,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:38,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:38,075 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 5 states. [2019-12-07 19:09:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:38,344 INFO L93 Difference]: Finished difference Result 15852 states and 48728 transitions. [2019-12-07 19:09:38,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:09:38,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 19:09:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:38,362 INFO L225 Difference]: With dead ends: 15852 [2019-12-07 19:09:38,363 INFO L226 Difference]: Without dead ends: 15852 [2019-12-07 19:09:38,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:09:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15852 states. [2019-12-07 19:09:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15852 to 14457. [2019-12-07 19:09:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14457 states. [2019-12-07 19:09:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14457 states to 14457 states and 44700 transitions. [2019-12-07 19:09:38,569 INFO L78 Accepts]: Start accepts. Automaton has 14457 states and 44700 transitions. Word has length 53 [2019-12-07 19:09:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:38,569 INFO L462 AbstractCegarLoop]: Abstraction has 14457 states and 44700 transitions. [2019-12-07 19:09:38,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 14457 states and 44700 transitions. [2019-12-07 19:09:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:09:38,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:38,587 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] [2019-12-07 19:09:38,587 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:38,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:38,588 INFO L82 PathProgramCache]: Analyzing trace with hash 194850767, now seen corresponding path program 2 times [2019-12-07 19:09:38,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:38,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073778262] [2019-12-07 19:09:38,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:38,647 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 19:09:38,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073778262] [2019-12-07 19:09:38,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:38,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:09:38,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459948399] [2019-12-07 19:09:38,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:09:38,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:38,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:09:38,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:09:38,648 INFO L87 Difference]: Start difference. First operand 14457 states and 44700 transitions. Second operand 6 states. [2019-12-07 19:09:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:39,045 INFO L93 Difference]: Finished difference Result 25137 states and 77688 transitions. [2019-12-07 19:09:39,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:09:39,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-07 19:09:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:39,077 INFO L225 Difference]: With dead ends: 25137 [2019-12-07 19:09:39,077 INFO L226 Difference]: Without dead ends: 25137 [2019-12-07 19:09:39,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:09:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25137 states. [2019-12-07 19:09:39,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25137 to 16137. [2019-12-07 19:09:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16137 states. [2019-12-07 19:09:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 49947 transitions. [2019-12-07 19:09:39,363 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 49947 transitions. Word has length 53 [2019-12-07 19:09:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:39,363 INFO L462 AbstractCegarLoop]: Abstraction has 16137 states and 49947 transitions. [2019-12-07 19:09:39,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:09:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 49947 transitions. [2019-12-07 19:09:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:09:39,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:39,378 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] [2019-12-07 19:09:39,378 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash 690646521, now seen corresponding path program 3 times [2019-12-07 19:09:39,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:39,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846510974] [2019-12-07 19:09:39,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:39,437 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 19:09:39,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846510974] [2019-12-07 19:09:39,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:39,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:09:39,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049627923] [2019-12-07 19:09:39,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:09:39,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:39,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:09:39,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:09:39,438 INFO L87 Difference]: Start difference. First operand 16137 states and 49947 transitions. Second operand 6 states. [2019-12-07 19:09:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:39,999 INFO L93 Difference]: Finished difference Result 21134 states and 64366 transitions. [2019-12-07 19:09:39,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:09:39,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-07 19:09:39,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:40,022 INFO L225 Difference]: With dead ends: 21134 [2019-12-07 19:09:40,023 INFO L226 Difference]: Without dead ends: 21134 [2019-12-07 19:09:40,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:09:40,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21134 states. [2019-12-07 19:09:40,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21134 to 16476. [2019-12-07 19:09:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16476 states. [2019-12-07 19:09:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16476 states to 16476 states and 50983 transitions. [2019-12-07 19:09:40,285 INFO L78 Accepts]: Start accepts. Automaton has 16476 states and 50983 transitions. Word has length 53 [2019-12-07 19:09:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:40,286 INFO L462 AbstractCegarLoop]: Abstraction has 16476 states and 50983 transitions. [2019-12-07 19:09:40,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:09:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 16476 states and 50983 transitions. [2019-12-07 19:09:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:09:40,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:40,300 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] [2019-12-07 19:09:40,300 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:40,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:40,300 INFO L82 PathProgramCache]: Analyzing trace with hash 798365505, now seen corresponding path program 4 times [2019-12-07 19:09:40,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:40,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651833158] [2019-12-07 19:09:40,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:40,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651833158] [2019-12-07 19:09:40,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:40,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:09:40,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60572720] [2019-12-07 19:09:40,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:09:40,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:40,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:09:40,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:09:40,367 INFO L87 Difference]: Start difference. First operand 16476 states and 50983 transitions. Second operand 7 states. [2019-12-07 19:09:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:41,124 INFO L93 Difference]: Finished difference Result 26397 states and 81239 transitions. [2019-12-07 19:09:41,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:09:41,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 19:09:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:41,157 INFO L225 Difference]: With dead ends: 26397 [2019-12-07 19:09:41,157 INFO L226 Difference]: Without dead ends: 26397 [2019-12-07 19:09:41,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:09:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26397 states. [2019-12-07 19:09:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26397 to 16499. [2019-12-07 19:09:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16499 states. [2019-12-07 19:09:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16499 states to 16499 states and 51049 transitions. [2019-12-07 19:09:41,454 INFO L78 Accepts]: Start accepts. Automaton has 16499 states and 51049 transitions. Word has length 53 [2019-12-07 19:09:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:41,454 INFO L462 AbstractCegarLoop]: Abstraction has 16499 states and 51049 transitions. [2019-12-07 19:09:41,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:09:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 16499 states and 51049 transitions. [2019-12-07 19:09:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:09:41,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:41,468 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:41,468 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:41,468 INFO L82 PathProgramCache]: Analyzing trace with hash 814608255, now seen corresponding path program 5 times [2019-12-07 19:09:41,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:41,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757527959] [2019-12-07 19:09:41,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:41,513 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 19:09:41,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757527959] [2019-12-07 19:09:41,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:41,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:09:41,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869288457] [2019-12-07 19:09:41,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:41,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:41,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:41,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:41,514 INFO L87 Difference]: Start difference. First operand 16499 states and 51049 transitions. Second operand 3 states. [2019-12-07 19:09:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:41,560 INFO L93 Difference]: Finished difference Result 16497 states and 51044 transitions. [2019-12-07 19:09:41,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:41,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 19:09:41,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:41,578 INFO L225 Difference]: With dead ends: 16497 [2019-12-07 19:09:41,578 INFO L226 Difference]: Without dead ends: 16497 [2019-12-07 19:09:41,578 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 19:09:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16497 states. [2019-12-07 19:09:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16497 to 14991. [2019-12-07 19:09:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14991 states. [2019-12-07 19:09:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14991 states to 14991 states and 46719 transitions. [2019-12-07 19:09:41,801 INFO L78 Accepts]: Start accepts. Automaton has 14991 states and 46719 transitions. Word has length 53 [2019-12-07 19:09:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:41,801 INFO L462 AbstractCegarLoop]: Abstraction has 14991 states and 46719 transitions. [2019-12-07 19:09:41,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 14991 states and 46719 transitions. [2019-12-07 19:09:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:09:41,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:41,814 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] [2019-12-07 19:09:41,814 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:41,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:41,815 INFO L82 PathProgramCache]: Analyzing trace with hash 95954180, now seen corresponding path program 1 times [2019-12-07 19:09:41,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:41,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368225504] [2019-12-07 19:09:41,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:41,859 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 19:09:41,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368225504] [2019-12-07 19:09:41,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:41,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:09:41,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073344728] [2019-12-07 19:09:41,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:41,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:41,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:41,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:41,861 INFO L87 Difference]: Start difference. First operand 14991 states and 46719 transitions. Second operand 3 states. [2019-12-07 19:09:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:41,899 INFO L93 Difference]: Finished difference Result 12892 states and 39631 transitions. [2019-12-07 19:09:41,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:41,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 19:09:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:41,914 INFO L225 Difference]: With dead ends: 12892 [2019-12-07 19:09:41,914 INFO L226 Difference]: Without dead ends: 12892 [2019-12-07 19:09:41,915 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 19:09:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12892 states. [2019-12-07 19:09:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12892 to 12436. [2019-12-07 19:09:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12436 states. [2019-12-07 19:09:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12436 states to 12436 states and 38295 transitions. [2019-12-07 19:09:42,087 INFO L78 Accepts]: Start accepts. Automaton has 12436 states and 38295 transitions. Word has length 54 [2019-12-07 19:09:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:42,087 INFO L462 AbstractCegarLoop]: Abstraction has 12436 states and 38295 transitions. [2019-12-07 19:09:42,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 12436 states and 38295 transitions. [2019-12-07 19:09:42,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:09:42,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:42,098 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] [2019-12-07 19:09:42,098 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:42,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:42,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2064257105, now seen corresponding path program 1 times [2019-12-07 19:09:42,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:42,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722257155] [2019-12-07 19:09:42,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:42,247 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 19:09:42,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722257155] [2019-12-07 19:09:42,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:42,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:09:42,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471164282] [2019-12-07 19:09:42,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:09:42,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:42,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:09:42,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:09:42,248 INFO L87 Difference]: Start difference. First operand 12436 states and 38295 transitions. Second operand 10 states. [2019-12-07 19:09:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:43,038 INFO L93 Difference]: Finished difference Result 53603 states and 164412 transitions. [2019-12-07 19:09:43,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 19:09:43,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-07 19:09:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:43,105 INFO L225 Difference]: With dead ends: 53603 [2019-12-07 19:09:43,105 INFO L226 Difference]: Without dead ends: 50933 [2019-12-07 19:09:43,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:09:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50933 states. [2019-12-07 19:09:43,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50933 to 15642. [2019-12-07 19:09:43,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15642 states. [2019-12-07 19:09:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15642 states to 15642 states and 49026 transitions. [2019-12-07 19:09:43,618 INFO L78 Accepts]: Start accepts. Automaton has 15642 states and 49026 transitions. Word has length 55 [2019-12-07 19:09:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:43,618 INFO L462 AbstractCegarLoop]: Abstraction has 15642 states and 49026 transitions. [2019-12-07 19:09:43,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:09:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 15642 states and 49026 transitions. [2019-12-07 19:09:43,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:09:43,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:43,636 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] [2019-12-07 19:09:43,636 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:43,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1492343505, now seen corresponding path program 2 times [2019-12-07 19:09:43,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:43,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949548798] [2019-12-07 19:09:43,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:43,706 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 19:09:43,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949548798] [2019-12-07 19:09:43,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:43,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:09:43,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124082843] [2019-12-07 19:09:43,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:43,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:43,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:43,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:43,707 INFO L87 Difference]: Start difference. First operand 15642 states and 49026 transitions. Second operand 5 states. [2019-12-07 19:09:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:43,820 INFO L93 Difference]: Finished difference Result 28249 states and 88418 transitions. [2019-12-07 19:09:43,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:09:43,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-07 19:09:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:43,834 INFO L225 Difference]: With dead ends: 28249 [2019-12-07 19:09:43,834 INFO L226 Difference]: Without dead ends: 13195 [2019-12-07 19:09:43,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:09:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13195 states. [2019-12-07 19:09:43,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13195 to 13195. [2019-12-07 19:09:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13195 states. [2019-12-07 19:09:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13195 states to 13195 states and 41071 transitions. [2019-12-07 19:09:44,015 INFO L78 Accepts]: Start accepts. Automaton has 13195 states and 41071 transitions. Word has length 55 [2019-12-07 19:09:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:44,015 INFO L462 AbstractCegarLoop]: Abstraction has 13195 states and 41071 transitions. [2019-12-07 19:09:44,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 13195 states and 41071 transitions. [2019-12-07 19:09:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:09:44,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:44,027 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] [2019-12-07 19:09:44,027 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:44,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:44,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 3 times [2019-12-07 19:09:44,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:44,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808234247] [2019-12-07 19:09:44,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:44,174 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 19:09:44,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808234247] [2019-12-07 19:09:44,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:44,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:09:44,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461525284] [2019-12-07 19:09:44,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:09:44,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:44,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:09:44,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:09:44,175 INFO L87 Difference]: Start difference. First operand 13195 states and 41071 transitions. Second operand 11 states. [2019-12-07 19:09:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:44,937 INFO L93 Difference]: Finished difference Result 30233 states and 94126 transitions. [2019-12-07 19:09:44,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 19:09:44,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 19:09:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:44,971 INFO L225 Difference]: With dead ends: 30233 [2019-12-07 19:09:44,972 INFO L226 Difference]: Without dead ends: 28899 [2019-12-07 19:09:44,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 19:09:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28899 states. [2019-12-07 19:09:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28899 to 19361. [2019-12-07 19:09:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19361 states. [2019-12-07 19:09:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19361 states to 19361 states and 60669 transitions. [2019-12-07 19:09:45,329 INFO L78 Accepts]: Start accepts. Automaton has 19361 states and 60669 transitions. Word has length 55 [2019-12-07 19:09:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:45,329 INFO L462 AbstractCegarLoop]: Abstraction has 19361 states and 60669 transitions. [2019-12-07 19:09:45,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:09:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 19361 states and 60669 transitions. [2019-12-07 19:09:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:09:45,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:45,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:45,345 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:45,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:45,345 INFO L82 PathProgramCache]: Analyzing trace with hash 621327827, now seen corresponding path program 4 times [2019-12-07 19:09:45,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:45,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540401665] [2019-12-07 19:09:45,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:45,467 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 19:09:45,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540401665] [2019-12-07 19:09:45,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:45,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:09:45,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076939671] [2019-12-07 19:09:45,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:09:45,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:45,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:09:45,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:09:45,468 INFO L87 Difference]: Start difference. First operand 19361 states and 60669 transitions. Second operand 11 states. [2019-12-07 19:09:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:46,126 INFO L93 Difference]: Finished difference Result 29476 states and 91212 transitions. [2019-12-07 19:09:46,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 19:09:46,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 19:09:46,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:46,151 INFO L225 Difference]: With dead ends: 29476 [2019-12-07 19:09:46,151 INFO L226 Difference]: Without dead ends: 22309 [2019-12-07 19:09:46,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 19:09:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22309 states. [2019-12-07 19:09:46,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22309 to 15218. [2019-12-07 19:09:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15218 states. [2019-12-07 19:09:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15218 states to 15218 states and 46650 transitions. [2019-12-07 19:09:46,412 INFO L78 Accepts]: Start accepts. Automaton has 15218 states and 46650 transitions. Word has length 55 [2019-12-07 19:09:46,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:46,412 INFO L462 AbstractCegarLoop]: Abstraction has 15218 states and 46650 transitions. [2019-12-07 19:09:46,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:09:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 15218 states and 46650 transitions. [2019-12-07 19:09:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:09:46,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:46,425 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] [2019-12-07 19:09:46,425 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:46,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:46,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 5 times [2019-12-07 19:09:46,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:46,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167751027] [2019-12-07 19:09:46,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:46,550 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 19:09:46,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167751027] [2019-12-07 19:09:46,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:46,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 19:09:46,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589722360] [2019-12-07 19:09:46,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:09:46,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:46,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:09:46,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:09:46,551 INFO L87 Difference]: Start difference. First operand 15218 states and 46650 transitions. Second operand 12 states. [2019-12-07 19:09:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:47,329 INFO L93 Difference]: Finished difference Result 22773 states and 68875 transitions. [2019-12-07 19:09:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 19:09:47,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-07 19:09:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:47,365 INFO L225 Difference]: With dead ends: 22773 [2019-12-07 19:09:47,365 INFO L226 Difference]: Without dead ends: 21655 [2019-12-07 19:09:47,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-07 19:09:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21655 states. [2019-12-07 19:09:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21655 to 14767. [2019-12-07 19:09:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14767 states. [2019-12-07 19:09:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14767 states to 14767 states and 45421 transitions. [2019-12-07 19:09:47,630 INFO L78 Accepts]: Start accepts. Automaton has 14767 states and 45421 transitions. Word has length 55 [2019-12-07 19:09:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:47,630 INFO L462 AbstractCegarLoop]: Abstraction has 14767 states and 45421 transitions. [2019-12-07 19:09:47,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:09:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 14767 states and 45421 transitions. [2019-12-07 19:09:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:09:47,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:47,643 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] [2019-12-07 19:09:47,643 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:47,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:47,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 6 times [2019-12-07 19:09:47,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:47,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520397068] [2019-12-07 19:09:47,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:09:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:09:47,705 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:09:47,705 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:09:47,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= 0 |v_ULTIMATE.start_main_~#t2348~0.offset_18|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24|)) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| 4)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24|) |v_ULTIMATE.start_main_~#t2348~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24| 1)) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2348~0.base_24|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2348~0.base=|v_ULTIMATE.start_main_~#t2348~0.base_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_26|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_26|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, ULTIMATE.start_main_~#t2348~0.offset=|v_ULTIMATE.start_main_~#t2348~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2348~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2350~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2350~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2348~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:09:47,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2349~0.offset_11| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2349~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2349~0.base_13| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13|) |v_ULTIMATE.start_main_~#t2349~0.offset_11| 1)) |v_#memory_int_15|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_13|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 19:09:47,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13|) |v_ULTIMATE.start_main_~#t2350~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2350~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2350~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| 4)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2350~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t2350~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2350~0.base] because there is no mapped edge [2019-12-07 19:09:47,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= (ite (not (and (not (= (mod ~x$w_buff1_used~0_Out-689499288 256) 0)) (not (= (mod ~x$w_buff0_used~0_Out-689499288 256) 0)))) 1 0) |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-689499288|) (= P1Thread1of1ForFork0_~arg.offset_Out-689499288 |P1Thread1of1ForFork0_#in~arg.offset_In-689499288|) (= 1 ~x$w_buff0~0_Out-689499288) (= ~x$w_buff0_used~0_In-689499288 ~x$w_buff1_used~0_Out-689499288) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-689499288)) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-689499288| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-689499288) (= ~x$w_buff0~0_In-689499288 ~x$w_buff1~0_Out-689499288) (= 1 ~x$w_buff0_used~0_Out-689499288) (= P1Thread1of1ForFork0_~arg.base_Out-689499288 |P1Thread1of1ForFork0_#in~arg.base_In-689499288|)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-689499288, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-689499288|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-689499288|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-689499288} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-689499288, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-689499288, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-689499288, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-689499288, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-689499288|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-689499288|, ~x$w_buff1~0=~x$w_buff1~0_Out-689499288, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-689499288|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-689499288, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-689499288} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 19:09:47,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1804311486 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1804311486 256) 0))) (or (and (= ~x~0_In-1804311486 |P2Thread1of1ForFork1_#t~ite32_Out-1804311486|) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-1804311486 |P2Thread1of1ForFork1_#t~ite32_Out-1804311486|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1804311486, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1804311486, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1804311486, ~x~0=~x~0_In-1804311486} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1804311486|, ~x$w_buff1~0=~x$w_buff1~0_In-1804311486, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1804311486, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1804311486, ~x~0=~x~0_In-1804311486} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:09:47,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:09:47,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In355213291 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In355213291 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out355213291| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In355213291 |P2Thread1of1ForFork1_#t~ite34_Out355213291|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In355213291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In355213291} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out355213291|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In355213291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In355213291} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:09:47,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-815069477 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-815069477 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-815069477| ~x$w_buff0_used~0_In-815069477) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-815069477| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-815069477, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-815069477} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-815069477, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-815069477|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-815069477} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:09:47,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1416009940 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1416009940 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1416009940 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1416009940 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1416009940 |P1Thread1of1ForFork0_#t~ite29_Out-1416009940|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1416009940|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1416009940, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1416009940, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1416009940, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1416009940} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1416009940, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1416009940, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1416009940, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1416009940|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1416009940} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:09:47,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_Out-2134642401 ~x$r_buff0_thd2~0_In-2134642401)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2134642401 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2134642401 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-2134642401 0) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2134642401, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2134642401} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2134642401|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2134642401, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2134642401} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:09:47,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1765574060 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1765574060 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1765574060 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1765574060 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1765574060|)) (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1765574060 |P1Thread1of1ForFork0_#t~ite31_Out-1765574060|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1765574060, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1765574060, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1765574060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1765574060} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1765574060|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1765574060, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1765574060, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1765574060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1765574060} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:09:47,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:09:47,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2031927639 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In2031927639| |P0Thread1of1ForFork2_#t~ite11_Out2031927639|) (= |P0Thread1of1ForFork2_#t~ite12_Out2031927639| ~x$w_buff1~0_In2031927639)) (and (= |P0Thread1of1ForFork2_#t~ite11_Out2031927639| ~x$w_buff1~0_In2031927639) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In2031927639 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In2031927639 256))) (= (mod ~x$w_buff0_used~0_In2031927639 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In2031927639 256))))) (= |P0Thread1of1ForFork2_#t~ite11_Out2031927639| |P0Thread1of1ForFork2_#t~ite12_Out2031927639|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2031927639, ~x$w_buff1~0=~x$w_buff1~0_In2031927639, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2031927639, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2031927639, ~weak$$choice2~0=~weak$$choice2~0_In2031927639, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In2031927639|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2031927639} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2031927639, ~x$w_buff1~0=~x$w_buff1~0_In2031927639, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2031927639, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2031927639, ~weak$$choice2~0=~weak$$choice2~0_In2031927639, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out2031927639|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out2031927639|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2031927639} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 19:09:47,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1805227248 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_In1805227248| |P0Thread1of1ForFork2_#t~ite14_Out1805227248|) (= ~x$w_buff0_used~0_In1805227248 |P0Thread1of1ForFork2_#t~ite15_Out1805227248|) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1805227248 256) 0))) (or (= (mod ~x$w_buff0_used~0_In1805227248 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1805227248 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1805227248 256))))) .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out1805227248| |P0Thread1of1ForFork2_#t~ite15_Out1805227248|) (= ~x$w_buff0_used~0_In1805227248 |P0Thread1of1ForFork2_#t~ite14_Out1805227248|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1805227248, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1805227248, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1805227248, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1805227248|, ~weak$$choice2~0=~weak$$choice2~0_In1805227248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1805227248} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1805227248, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1805227248, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1805227248|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1805227248, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1805227248|, ~weak$$choice2~0=~weak$$choice2~0_In1805227248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1805227248} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 19:09:47,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1440941813 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1440941813 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-1440941813 256)) .cse0) (and .cse0 (= (mod ~x$w_buff1_used~0_In-1440941813 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1440941813 256)))) (= ~x$w_buff1_used~0_In-1440941813 |P0Thread1of1ForFork2_#t~ite17_Out-1440941813|) (= |P0Thread1of1ForFork2_#t~ite18_Out-1440941813| |P0Thread1of1ForFork2_#t~ite17_Out-1440941813|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite17_In-1440941813| |P0Thread1of1ForFork2_#t~ite17_Out-1440941813|) (= ~x$w_buff1_used~0_In-1440941813 |P0Thread1of1ForFork2_#t~ite18_Out-1440941813|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1440941813, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1440941813|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1440941813, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1440941813, ~weak$$choice2~0=~weak$$choice2~0_In-1440941813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1440941813} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1440941813, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1440941813|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1440941813|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1440941813, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1440941813, ~weak$$choice2~0=~weak$$choice2~0_In-1440941813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1440941813} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 19:09:47,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 19:09:47,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:09:47,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In2106437361 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2106437361 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2106437361 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In2106437361 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In2106437361 |P2Thread1of1ForFork1_#t~ite35_Out2106437361|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out2106437361|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2106437361, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2106437361, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2106437361, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2106437361} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2106437361|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2106437361, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2106437361, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2106437361, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2106437361} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:09:47,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-2023852744 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2023852744 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-2023852744| ~x$r_buff0_thd3~0_In-2023852744)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-2023852744| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2023852744, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2023852744} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-2023852744|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2023852744, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2023852744} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:09:47,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1119432641 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1119432641 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1119432641 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1119432641 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1119432641| ~x$r_buff1_thd3~0_In1119432641) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1119432641| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1119432641, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1119432641, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1119432641, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1119432641} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1119432641|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1119432641, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1119432641, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1119432641, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1119432641} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:09:47,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:09:47,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:09:47,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In653127804 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In653127804 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out653127804| ~x$w_buff1~0_In653127804)) (and (or .cse0 .cse1) (= ~x~0_In653127804 |ULTIMATE.start_main_#t~ite41_Out653127804|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In653127804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In653127804, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In653127804, ~x~0=~x~0_In653127804} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out653127804|, ~x$w_buff1~0=~x$w_buff1~0_In653127804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In653127804, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In653127804, ~x~0=~x~0_In653127804} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 19:09:47,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 19:09:47,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1203047304 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1203047304 256)))) (or (and (= ~x$w_buff0_used~0_In1203047304 |ULTIMATE.start_main_#t~ite43_Out1203047304|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1203047304|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1203047304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1203047304} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1203047304, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1203047304|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1203047304} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:09:47,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In510353280 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In510353280 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In510353280 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In510353280 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out510353280| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite44_Out510353280| ~x$w_buff1_used~0_In510353280)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In510353280, ~x$w_buff1_used~0=~x$w_buff1_used~0_In510353280, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In510353280, ~x$w_buff0_used~0=~x$w_buff0_used~0_In510353280} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In510353280, ~x$w_buff1_used~0=~x$w_buff1_used~0_In510353280, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In510353280, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out510353280|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In510353280} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:09:47,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1830178565 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1830178565 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1830178565 |ULTIMATE.start_main_#t~ite45_Out-1830178565|)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1830178565|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1830178565, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1830178565} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1830178565, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1830178565|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1830178565} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:09:47,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-429232852 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-429232852 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-429232852 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-429232852 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-429232852| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-429232852 |ULTIMATE.start_main_#t~ite46_Out-429232852|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-429232852, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-429232852, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-429232852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-429232852} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-429232852, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-429232852|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-429232852, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-429232852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-429232852} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:09:47,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:09:47,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:09:47 BasicIcfg [2019-12-07 19:09:47,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:09:47,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:09:47,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:09:47,765 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:09:47,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:09:05" (3/4) ... [2019-12-07 19:09:47,767 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:09:47,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= 0 |v_ULTIMATE.start_main_~#t2348~0.offset_18|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24|)) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| 4)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24|) |v_ULTIMATE.start_main_~#t2348~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24| 1)) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2348~0.base_24|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2348~0.base=|v_ULTIMATE.start_main_~#t2348~0.base_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_26|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_26|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, ULTIMATE.start_main_~#t2348~0.offset=|v_ULTIMATE.start_main_~#t2348~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2348~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2350~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2350~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2348~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:09:47,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2349~0.offset_11| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2349~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2349~0.base_13| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13|) |v_ULTIMATE.start_main_~#t2349~0.offset_11| 1)) |v_#memory_int_15|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_13|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 19:09:47,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13|) |v_ULTIMATE.start_main_~#t2350~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2350~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2350~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| 4)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2350~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t2350~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2350~0.base] because there is no mapped edge [2019-12-07 19:09:47,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= (ite (not (and (not (= (mod ~x$w_buff1_used~0_Out-689499288 256) 0)) (not (= (mod ~x$w_buff0_used~0_Out-689499288 256) 0)))) 1 0) |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-689499288|) (= P1Thread1of1ForFork0_~arg.offset_Out-689499288 |P1Thread1of1ForFork0_#in~arg.offset_In-689499288|) (= 1 ~x$w_buff0~0_Out-689499288) (= ~x$w_buff0_used~0_In-689499288 ~x$w_buff1_used~0_Out-689499288) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-689499288)) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-689499288| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-689499288) (= ~x$w_buff0~0_In-689499288 ~x$w_buff1~0_Out-689499288) (= 1 ~x$w_buff0_used~0_Out-689499288) (= P1Thread1of1ForFork0_~arg.base_Out-689499288 |P1Thread1of1ForFork0_#in~arg.base_In-689499288|)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-689499288, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-689499288|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-689499288|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-689499288} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-689499288, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-689499288, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-689499288, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-689499288, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-689499288|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-689499288|, ~x$w_buff1~0=~x$w_buff1~0_Out-689499288, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-689499288|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-689499288, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-689499288} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 19:09:47,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1804311486 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1804311486 256) 0))) (or (and (= ~x~0_In-1804311486 |P2Thread1of1ForFork1_#t~ite32_Out-1804311486|) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-1804311486 |P2Thread1of1ForFork1_#t~ite32_Out-1804311486|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1804311486, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1804311486, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1804311486, ~x~0=~x~0_In-1804311486} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1804311486|, ~x$w_buff1~0=~x$w_buff1~0_In-1804311486, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1804311486, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1804311486, ~x~0=~x~0_In-1804311486} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:09:47,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:09:47,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In355213291 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In355213291 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out355213291| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In355213291 |P2Thread1of1ForFork1_#t~ite34_Out355213291|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In355213291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In355213291} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out355213291|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In355213291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In355213291} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:09:47,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-815069477 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-815069477 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-815069477| ~x$w_buff0_used~0_In-815069477) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-815069477| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-815069477, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-815069477} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-815069477, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-815069477|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-815069477} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:09:47,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1416009940 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1416009940 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1416009940 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1416009940 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1416009940 |P1Thread1of1ForFork0_#t~ite29_Out-1416009940|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1416009940|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1416009940, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1416009940, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1416009940, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1416009940} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1416009940, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1416009940, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1416009940, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1416009940|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1416009940} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:09:47,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_Out-2134642401 ~x$r_buff0_thd2~0_In-2134642401)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2134642401 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2134642401 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-2134642401 0) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2134642401, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2134642401} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2134642401|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2134642401, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2134642401} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:09:47,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1765574060 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1765574060 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1765574060 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1765574060 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1765574060|)) (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1765574060 |P1Thread1of1ForFork0_#t~ite31_Out-1765574060|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1765574060, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1765574060, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1765574060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1765574060} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1765574060|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1765574060, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1765574060, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1765574060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1765574060} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:09:47,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:09:47,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2031927639 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In2031927639| |P0Thread1of1ForFork2_#t~ite11_Out2031927639|) (= |P0Thread1of1ForFork2_#t~ite12_Out2031927639| ~x$w_buff1~0_In2031927639)) (and (= |P0Thread1of1ForFork2_#t~ite11_Out2031927639| ~x$w_buff1~0_In2031927639) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In2031927639 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In2031927639 256))) (= (mod ~x$w_buff0_used~0_In2031927639 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In2031927639 256))))) (= |P0Thread1of1ForFork2_#t~ite11_Out2031927639| |P0Thread1of1ForFork2_#t~ite12_Out2031927639|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2031927639, ~x$w_buff1~0=~x$w_buff1~0_In2031927639, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2031927639, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2031927639, ~weak$$choice2~0=~weak$$choice2~0_In2031927639, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In2031927639|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2031927639} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2031927639, ~x$w_buff1~0=~x$w_buff1~0_In2031927639, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2031927639, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2031927639, ~weak$$choice2~0=~weak$$choice2~0_In2031927639, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out2031927639|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out2031927639|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2031927639} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 19:09:47,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1805227248 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_In1805227248| |P0Thread1of1ForFork2_#t~ite14_Out1805227248|) (= ~x$w_buff0_used~0_In1805227248 |P0Thread1of1ForFork2_#t~ite15_Out1805227248|) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1805227248 256) 0))) (or (= (mod ~x$w_buff0_used~0_In1805227248 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1805227248 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1805227248 256))))) .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out1805227248| |P0Thread1of1ForFork2_#t~ite15_Out1805227248|) (= ~x$w_buff0_used~0_In1805227248 |P0Thread1of1ForFork2_#t~ite14_Out1805227248|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1805227248, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1805227248, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1805227248, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1805227248|, ~weak$$choice2~0=~weak$$choice2~0_In1805227248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1805227248} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1805227248, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1805227248, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1805227248|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1805227248, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1805227248|, ~weak$$choice2~0=~weak$$choice2~0_In1805227248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1805227248} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 19:09:47,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1440941813 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1440941813 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-1440941813 256)) .cse0) (and .cse0 (= (mod ~x$w_buff1_used~0_In-1440941813 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1440941813 256)))) (= ~x$w_buff1_used~0_In-1440941813 |P0Thread1of1ForFork2_#t~ite17_Out-1440941813|) (= |P0Thread1of1ForFork2_#t~ite18_Out-1440941813| |P0Thread1of1ForFork2_#t~ite17_Out-1440941813|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite17_In-1440941813| |P0Thread1of1ForFork2_#t~ite17_Out-1440941813|) (= ~x$w_buff1_used~0_In-1440941813 |P0Thread1of1ForFork2_#t~ite18_Out-1440941813|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1440941813, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1440941813|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1440941813, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1440941813, ~weak$$choice2~0=~weak$$choice2~0_In-1440941813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1440941813} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1440941813, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1440941813|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1440941813|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1440941813, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1440941813, ~weak$$choice2~0=~weak$$choice2~0_In-1440941813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1440941813} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 19:09:47,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 19:09:47,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:09:47,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In2106437361 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2106437361 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2106437361 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In2106437361 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In2106437361 |P2Thread1of1ForFork1_#t~ite35_Out2106437361|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out2106437361|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2106437361, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2106437361, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2106437361, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2106437361} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2106437361|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2106437361, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2106437361, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2106437361, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2106437361} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:09:47,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-2023852744 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2023852744 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-2023852744| ~x$r_buff0_thd3~0_In-2023852744)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-2023852744| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2023852744, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2023852744} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-2023852744|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2023852744, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2023852744} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:09:47,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1119432641 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1119432641 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1119432641 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1119432641 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1119432641| ~x$r_buff1_thd3~0_In1119432641) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1119432641| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1119432641, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1119432641, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1119432641, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1119432641} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1119432641|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1119432641, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1119432641, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1119432641, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1119432641} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:09:47,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:09:47,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:09:47,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In653127804 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In653127804 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out653127804| ~x$w_buff1~0_In653127804)) (and (or .cse0 .cse1) (= ~x~0_In653127804 |ULTIMATE.start_main_#t~ite41_Out653127804|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In653127804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In653127804, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In653127804, ~x~0=~x~0_In653127804} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out653127804|, ~x$w_buff1~0=~x$w_buff1~0_In653127804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In653127804, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In653127804, ~x~0=~x~0_In653127804} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 19:09:47,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 19:09:47,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1203047304 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1203047304 256)))) (or (and (= ~x$w_buff0_used~0_In1203047304 |ULTIMATE.start_main_#t~ite43_Out1203047304|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1203047304|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1203047304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1203047304} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1203047304, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1203047304|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1203047304} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:09:47,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In510353280 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In510353280 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In510353280 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In510353280 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out510353280| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite44_Out510353280| ~x$w_buff1_used~0_In510353280)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In510353280, ~x$w_buff1_used~0=~x$w_buff1_used~0_In510353280, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In510353280, ~x$w_buff0_used~0=~x$w_buff0_used~0_In510353280} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In510353280, ~x$w_buff1_used~0=~x$w_buff1_used~0_In510353280, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In510353280, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out510353280|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In510353280} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:09:47,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1830178565 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1830178565 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1830178565 |ULTIMATE.start_main_#t~ite45_Out-1830178565|)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1830178565|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1830178565, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1830178565} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1830178565, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1830178565|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1830178565} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:09:47,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-429232852 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-429232852 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-429232852 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-429232852 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-429232852| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-429232852 |ULTIMATE.start_main_#t~ite46_Out-429232852|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-429232852, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-429232852, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-429232852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-429232852} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-429232852, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-429232852|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-429232852, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-429232852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-429232852} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:09:47,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:09:47,826 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_26d5b66f-8419-4408-b1ef-cdf2bf7ab5d3/bin/utaipan/witness.graphml [2019-12-07 19:09:47,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:09:47,827 INFO L168 Benchmark]: Toolchain (without parser) took 43245.15 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -199.0 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 19:09:47,827 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:09:47,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:47,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:47,828 INFO L168 Benchmark]: Boogie Preprocessor took 25.94 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 19:09:47,828 INFO L168 Benchmark]: RCFGBuilder took 392.94 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: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:47,829 INFO L168 Benchmark]: TraceAbstraction took 42353.80 ms. Allocated memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-12-07 19:09:47,829 INFO L168 Benchmark]: Witness Printer took 60.92 ms. Allocated memory is still 4.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:47,830 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 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.94 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 392.94 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: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42353.80 ms. Allocated memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 60.92 ms. Allocated memory is still 4.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2348, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2349, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2350, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 42.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3557 SDtfs, 5773 SDslu, 11475 SDs, 0 SdLazy, 5974 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 35 SyntacticMatches, 21 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 129871 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 165643 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...