./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_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_96f81af2-82f2-41a2-ae5d-d730897fab8c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/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 e4a72557a25d3ff27b5a7864de9df538301d131d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:06:33,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:06:33,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:06:33,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:06:33,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:06:33,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:06:33,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:06:33,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:06:33,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:06:33,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:06:33,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:06:33,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:06:33,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:06:33,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:06:33,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:06:33,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:06:33,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:06:33,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:06:33,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:06:33,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:06:33,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:06:33,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:06:33,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:06:33,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:06:33,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:06:33,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:06:33,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:06:33,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:06:33,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:06:33,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:06:33,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:06:33,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:06:33,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:06:33,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:06:33,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:06:33,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:06:33,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:06:33,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:06:33,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:06:33,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:06:33,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:06:33,982 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:06:33,992 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:06:33,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:06:33,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:06:33,993 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:06:33,993 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:06:33,994 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:06:33,994 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:06:33,994 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:06:33,994 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:06:33,994 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:06:33,994 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:06:33,994 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:06:33,994 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:06:33,995 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:06:33,995 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:06:33,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:06:33,995 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:06:33,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:06:33,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:06:33,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:06:33,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:06:33,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:06:33,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:06:33,996 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:06:33,996 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:06:33,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:06:33,996 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:06:33,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:06:33,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:06:33,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:06:33,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:06:33,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:06:33,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:06:33,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:06:33,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:06:33,997 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:06:33,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:06:33,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:06:33,998 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:06:33,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:06:33,998 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_96f81af2-82f2-41a2-ae5d-d730897fab8c/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 -> e4a72557a25d3ff27b5a7864de9df538301d131d [2019-12-07 14:06:34,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:06:34,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:06:34,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:06:34,108 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:06:34,109 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:06:34,109 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i [2019-12-07 14:06:34,147 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/bin/utaipan/data/30c34cc2d/fbfe845c5b7a483e860776c1e08c4918/FLAG0c235101d [2019-12-07 14:06:34,501 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:06:34,501 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/sv-benchmarks/c/pthread-wmm/mix031_power.opt.i [2019-12-07 14:06:34,511 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/bin/utaipan/data/30c34cc2d/fbfe845c5b7a483e860776c1e08c4918/FLAG0c235101d [2019-12-07 14:06:34,520 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/bin/utaipan/data/30c34cc2d/fbfe845c5b7a483e860776c1e08c4918 [2019-12-07 14:06:34,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:06:34,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:06:34,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:06:34,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:06:34,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:06:34,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:06:34" (1/1) ... [2019-12-07 14:06:34,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34, skipping insertion in model container [2019-12-07 14:06:34,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:06:34" (1/1) ... [2019-12-07 14:06:34,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:06:34,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:06:34,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:06:34,831 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:06:34,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:06:34,913 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:06:34,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34 WrapperNode [2019-12-07 14:06:34,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:06:34,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:06:34,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:06:34,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:06:34,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34" (1/1) ... [2019-12-07 14:06:34,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34" (1/1) ... [2019-12-07 14:06:34,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:06:34,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:06:34,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:06:34,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:06:34,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34" (1/1) ... [2019-12-07 14:06:34,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34" (1/1) ... [2019-12-07 14:06:34,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34" (1/1) ... [2019-12-07 14:06:34,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34" (1/1) ... [2019-12-07 14:06:34,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34" (1/1) ... [2019-12-07 14:06:34,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34" (1/1) ... [2019-12-07 14:06:34,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34" (1/1) ... [2019-12-07 14:06:34,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:06:34,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:06:34,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:06:34,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:06:34,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/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 14:06:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:06:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:06:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:06:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:06:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:06:35,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:06:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:06:35,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:06:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:06:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:06:35,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:06:35,021 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 14:06:35,356 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:06:35,357 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:06:35,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:06:35 BoogieIcfgContainer [2019-12-07 14:06:35,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:06:35,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:06:35,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:06:35,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:06:35,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:06:34" (1/3) ... [2019-12-07 14:06:35,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a1c4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:06:35, skipping insertion in model container [2019-12-07 14:06:35,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:06:34" (2/3) ... [2019-12-07 14:06:35,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a1c4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:06:35, skipping insertion in model container [2019-12-07 14:06:35,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:06:35" (3/3) ... [2019-12-07 14:06:35,362 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.opt.i [2019-12-07 14:06:35,368 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:06:35,368 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:06:35,373 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:06:35,373 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:06:35,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,408 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,408 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,408 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,408 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,408 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:06:35,424 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:06:35,440 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:06:35,440 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:06:35,440 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:06:35,441 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:06:35,441 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:06:35,441 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:06:35,441 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:06:35,441 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:06:35,451 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-12-07 14:06:35,452 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-07 14:06:35,505 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-07 14:06:35,505 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:06:35,516 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 14:06:35,529 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-07 14:06:35,553 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-07 14:06:35,554 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:06:35,558 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 14:06:35,570 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 14:06:35,571 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:06:38,039 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 14:06:38,186 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-07 14:06:38,424 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-12-07 14:06:38,424 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-07 14:06:38,426 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-07 14:06:38,669 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-07 14:06:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-07 14:06:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:06:38,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:38,675 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:06:38,676 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:38,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:38,679 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-12-07 14:06:38,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:38,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592563967] [2019-12-07 14:06:38,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:38,823 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 14:06:38,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592563967] [2019-12-07 14:06:38,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:38,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:06:38,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42879567] [2019-12-07 14:06:38,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:06:38,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:06:38,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:06:38,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:06:38,843 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-07 14:06:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:38,986 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-12-07 14:06:38,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:06:38,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:06:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:39,038 INFO L225 Difference]: With dead ends: 6414 [2019-12-07 14:06:39,038 INFO L226 Difference]: Without dead ends: 6042 [2019-12-07 14:06:39,039 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 14:06:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-07 14:06:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-07 14:06:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-07 14:06:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-12-07 14:06:39,262 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-12-07 14:06:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:39,262 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-12-07 14:06:39,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:06:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-12-07 14:06:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:06:39,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:39,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:06:39,265 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:39,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:39,265 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-12-07 14:06:39,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:39,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037253842] [2019-12-07 14:06:39,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:39,322 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 14:06:39,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037253842] [2019-12-07 14:06:39,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:39,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:06:39,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382143614] [2019-12-07 14:06:39,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:06:39,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:06:39,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:06:39,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:06:39,324 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 4 states. [2019-12-07 14:06:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:39,568 INFO L93 Difference]: Finished difference Result 9128 states and 29363 transitions. [2019-12-07 14:06:39,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:06:39,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:06:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:39,620 INFO L225 Difference]: With dead ends: 9128 [2019-12-07 14:06:39,620 INFO L226 Difference]: Without dead ends: 9113 [2019-12-07 14:06:39,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:06:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9113 states. [2019-12-07 14:06:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9113 to 8369. [2019-12-07 14:06:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2019-12-07 14:06:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 27318 transitions. [2019-12-07 14:06:39,860 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 27318 transitions. Word has length 11 [2019-12-07 14:06:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:39,860 INFO L462 AbstractCegarLoop]: Abstraction has 8369 states and 27318 transitions. [2019-12-07 14:06:39,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:06:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 27318 transitions. [2019-12-07 14:06:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:06:39,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:39,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:06:39,865 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:39,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:39,865 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-12-07 14:06:39,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:39,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123626134] [2019-12-07 14:06:39,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:39,897 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 14:06:39,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123626134] [2019-12-07 14:06:39,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:39,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:06:39,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697503475] [2019-12-07 14:06:39,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:06:39,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:06:39,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:06:39,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:06:39,899 INFO L87 Difference]: Start difference. First operand 8369 states and 27318 transitions. Second operand 3 states. [2019-12-07 14:06:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:40,009 INFO L93 Difference]: Finished difference Result 11252 states and 36788 transitions. [2019-12-07 14:06:40,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:06:40,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 14:06:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:40,038 INFO L225 Difference]: With dead ends: 11252 [2019-12-07 14:06:40,039 INFO L226 Difference]: Without dead ends: 11252 [2019-12-07 14:06:40,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:06:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11252 states. [2019-12-07 14:06:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11252 to 9819. [2019-12-07 14:06:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9819 states. [2019-12-07 14:06:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9819 states to 9819 states and 32327 transitions. [2019-12-07 14:06:40,243 INFO L78 Accepts]: Start accepts. Automaton has 9819 states and 32327 transitions. Word has length 14 [2019-12-07 14:06:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:40,244 INFO L462 AbstractCegarLoop]: Abstraction has 9819 states and 32327 transitions. [2019-12-07 14:06:40,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:06:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 9819 states and 32327 transitions. [2019-12-07 14:06:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:06:40,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:40,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:06:40,246 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:40,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-12-07 14:06:40,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:40,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517539144] [2019-12-07 14:06:40,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:40,285 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 14:06:40,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517539144] [2019-12-07 14:06:40,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:40,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:06:40,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170089750] [2019-12-07 14:06:40,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:06:40,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:06:40,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:06:40,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:06:40,287 INFO L87 Difference]: Start difference. First operand 9819 states and 32327 transitions. Second operand 4 states. [2019-12-07 14:06:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:40,422 INFO L93 Difference]: Finished difference Result 11915 states and 38297 transitions. [2019-12-07 14:06:40,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:06:40,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:06:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:40,453 INFO L225 Difference]: With dead ends: 11915 [2019-12-07 14:06:40,454 INFO L226 Difference]: Without dead ends: 11904 [2019-12-07 14:06:40,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:06:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11904 states. [2019-12-07 14:06:40,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11904 to 10744. [2019-12-07 14:06:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10744 states. [2019-12-07 14:06:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 35020 transitions. [2019-12-07 14:06:40,725 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 35020 transitions. Word has length 14 [2019-12-07 14:06:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:40,725 INFO L462 AbstractCegarLoop]: Abstraction has 10744 states and 35020 transitions. [2019-12-07 14:06:40,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:06:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 35020 transitions. [2019-12-07 14:06:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:06:40,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:40,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:06:40,727 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:40,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:40,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-12-07 14:06:40,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:40,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272014484] [2019-12-07 14:06:40,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:40,767 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 14:06:40,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272014484] [2019-12-07 14:06:40,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:40,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:06:40,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530782293] [2019-12-07 14:06:40,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:06:40,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:06:40,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:06:40,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:06:40,768 INFO L87 Difference]: Start difference. First operand 10744 states and 35020 transitions. Second operand 4 states. [2019-12-07 14:06:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:40,888 INFO L93 Difference]: Finished difference Result 12870 states and 41385 transitions. [2019-12-07 14:06:40,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:06:40,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:06:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:40,907 INFO L225 Difference]: With dead ends: 12870 [2019-12-07 14:06:40,907 INFO L226 Difference]: Without dead ends: 12857 [2019-12-07 14:06:40,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:06:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12857 states. [2019-12-07 14:06:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12857 to 10870. [2019-12-07 14:06:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10870 states. [2019-12-07 14:06:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10870 states to 10870 states and 35539 transitions. [2019-12-07 14:06:41,083 INFO L78 Accepts]: Start accepts. Automaton has 10870 states and 35539 transitions. Word has length 14 [2019-12-07 14:06:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:41,083 INFO L462 AbstractCegarLoop]: Abstraction has 10870 states and 35539 transitions. [2019-12-07 14:06:41,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:06:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 10870 states and 35539 transitions. [2019-12-07 14:06:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:06:41,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:41,087 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:06:41,087 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:41,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:41,087 INFO L82 PathProgramCache]: Analyzing trace with hash -133127032, now seen corresponding path program 1 times [2019-12-07 14:06:41,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:41,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867524893] [2019-12-07 14:06:41,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:41,139 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 14:06:41,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867524893] [2019-12-07 14:06:41,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:41,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:06:41,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297309534] [2019-12-07 14:06:41,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:06:41,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:06:41,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:06:41,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:06:41,140 INFO L87 Difference]: Start difference. First operand 10870 states and 35539 transitions. Second operand 3 states. [2019-12-07 14:06:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:41,182 INFO L93 Difference]: Finished difference Result 10914 states and 35611 transitions. [2019-12-07 14:06:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:06:41,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 14:06:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:41,196 INFO L225 Difference]: With dead ends: 10914 [2019-12-07 14:06:41,196 INFO L226 Difference]: Without dead ends: 10914 [2019-12-07 14:06:41,196 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 14:06:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10914 states. [2019-12-07 14:06:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10914 to 10867. [2019-12-07 14:06:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10867 states. [2019-12-07 14:06:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 35530 transitions. [2019-12-07 14:06:41,405 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 35530 transitions. Word has length 16 [2019-12-07 14:06:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:41,405 INFO L462 AbstractCegarLoop]: Abstraction has 10867 states and 35530 transitions. [2019-12-07 14:06:41,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:06:41,405 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 35530 transitions. [2019-12-07 14:06:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:06:41,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:41,409 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:06:41,409 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:41,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1519842378, now seen corresponding path program 1 times [2019-12-07 14:06:41,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:41,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974525586] [2019-12-07 14:06:41,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:41,439 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 14:06:41,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974525586] [2019-12-07 14:06:41,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:41,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:06:41,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433560091] [2019-12-07 14:06:41,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:06:41,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:06:41,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:06:41,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:06:41,440 INFO L87 Difference]: Start difference. First operand 10867 states and 35530 transitions. Second operand 3 states. [2019-12-07 14:06:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:41,449 INFO L93 Difference]: Finished difference Result 1664 states and 4070 transitions. [2019-12-07 14:06:41,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:06:41,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 14:06:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:41,451 INFO L225 Difference]: With dead ends: 1664 [2019-12-07 14:06:41,451 INFO L226 Difference]: Without dead ends: 1664 [2019-12-07 14:06:41,451 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 14:06:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-12-07 14:06:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2019-12-07 14:06:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-12-07 14:06:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 4070 transitions. [2019-12-07 14:06:41,466 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 4070 transitions. Word has length 17 [2019-12-07 14:06:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:41,466 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 4070 transitions. [2019-12-07 14:06:41,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:06:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 4070 transitions. [2019-12-07 14:06:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:06:41,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06: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] [2019-12-07 14:06:41,468 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:41,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-12-07 14:06:41,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:41,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261963731] [2019-12-07 14:06:41,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06: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 14:06:41,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261963731] [2019-12-07 14:06:41,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:41,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:06:41,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140551568] [2019-12-07 14:06:41,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:06:41,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:06:41,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:06:41,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:06:41,514 INFO L87 Difference]: Start difference. First operand 1664 states and 4070 transitions. Second operand 5 states. [2019-12-07 14:06:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:41,645 INFO L93 Difference]: Finished difference Result 2291 states and 5479 transitions. [2019-12-07 14:06:41,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:06:41,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 14:06:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:41,647 INFO L225 Difference]: With dead ends: 2291 [2019-12-07 14:06:41,647 INFO L226 Difference]: Without dead ends: 2289 [2019-12-07 14:06:41,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 14:06:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2019-12-07 14:06:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1836. [2019-12-07 14:06:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2019-12-07 14:06:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 4456 transitions. [2019-12-07 14:06:41,667 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 4456 transitions. Word has length 26 [2019-12-07 14:06:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:41,667 INFO L462 AbstractCegarLoop]: Abstraction has 1836 states and 4456 transitions. [2019-12-07 14:06:41,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:06:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 4456 transitions. [2019-12-07 14:06:41,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:06:41,669 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:41,669 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] [2019-12-07 14:06:41,669 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:41,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:41,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2141135354, now seen corresponding path program 1 times [2019-12-07 14:06:41,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:41,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197741918] [2019-12-07 14:06:41,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:41,735 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 14:06:41,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197741918] [2019-12-07 14:06:41,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:41,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:06:41,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841449325] [2019-12-07 14:06:41,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:06:41,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:06:41,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:06:41,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:06:41,736 INFO L87 Difference]: Start difference. First operand 1836 states and 4456 transitions. Second operand 3 states. [2019-12-07 14:06:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:41,748 INFO L93 Difference]: Finished difference Result 1764 states and 4221 transitions. [2019-12-07 14:06:41,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:06:41,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 14:06:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:41,750 INFO L225 Difference]: With dead ends: 1764 [2019-12-07 14:06:41,750 INFO L226 Difference]: Without dead ends: 1764 [2019-12-07 14:06:41,750 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 14:06:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-07 14:06:41,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1691. [2019-12-07 14:06:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2019-12-07 14:06:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 4048 transitions. [2019-12-07 14:06:41,766 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 4048 transitions. Word has length 26 [2019-12-07 14:06:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:41,766 INFO L462 AbstractCegarLoop]: Abstraction has 1691 states and 4048 transitions. [2019-12-07 14:06:41,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:06:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 4048 transitions. [2019-12-07 14:06:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:06:41,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:41,767 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 14:06:41,768 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:41,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:41,768 INFO L82 PathProgramCache]: Analyzing trace with hash 225797087, now seen corresponding path program 1 times [2019-12-07 14:06:41,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:41,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495379231] [2019-12-07 14:06:41,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:41,809 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 14:06:41,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495379231] [2019-12-07 14:06:41,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:41,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:06:41,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516360340] [2019-12-07 14:06:41,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:06:41,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:06:41,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:06:41,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:06:41,810 INFO L87 Difference]: Start difference. First operand 1691 states and 4048 transitions. Second operand 4 states. [2019-12-07 14:06:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:41,823 INFO L93 Difference]: Finished difference Result 738 states and 1681 transitions. [2019-12-07 14:06:41,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:06:41,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 14:06:41,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:41,824 INFO L225 Difference]: With dead ends: 738 [2019-12-07 14:06:41,825 INFO L226 Difference]: Without dead ends: 738 [2019-12-07 14:06:41,825 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 14:06:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-07 14:06:41,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 669. [2019-12-07 14:06:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-12-07 14:06:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1547 transitions. [2019-12-07 14:06:41,834 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1547 transitions. Word has length 27 [2019-12-07 14:06:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:41,834 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 1547 transitions. [2019-12-07 14:06:41,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:06:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1547 transitions. [2019-12-07 14:06:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:06:41,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:41,836 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] [2019-12-07 14:06:41,836 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:41,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:41,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1722201146, now seen corresponding path program 1 times [2019-12-07 14:06:41,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:41,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592029346] [2019-12-07 14:06:41,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:41,920 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 14:06:41,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592029346] [2019-12-07 14:06:41,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:41,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:06:41,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404317447] [2019-12-07 14:06:41,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:06:41,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:06:41,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:06:41,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:06:41,921 INFO L87 Difference]: Start difference. First operand 669 states and 1547 transitions. Second operand 5 states. [2019-12-07 14:06:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:41,941 INFO L93 Difference]: Finished difference Result 1076 states and 2526 transitions. [2019-12-07 14:06:41,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:06:41,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 14:06:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:41,942 INFO L225 Difference]: With dead ends: 1076 [2019-12-07 14:06:41,942 INFO L226 Difference]: Without dead ends: 426 [2019-12-07 14:06:41,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:06:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-12-07 14:06:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-12-07 14:06:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-12-07 14:06:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1010 transitions. [2019-12-07 14:06:41,948 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1010 transitions. Word has length 42 [2019-12-07 14:06:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:41,949 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 1010 transitions. [2019-12-07 14:06:41,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:06:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1010 transitions. [2019-12-07 14:06:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:06:41,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:41,950 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] [2019-12-07 14:06:41,950 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:41,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash -146556572, now seen corresponding path program 2 times [2019-12-07 14:06:41,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:41,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390278740] [2019-12-07 14:06:41,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:42,018 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 14:06:42,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390278740] [2019-12-07 14:06:42,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:42,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:06:42,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3789428] [2019-12-07 14:06:42,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:06:42,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:06:42,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:06:42,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:06:42,019 INFO L87 Difference]: Start difference. First operand 426 states and 1010 transitions. Second operand 7 states. [2019-12-07 14:06:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:42,123 INFO L93 Difference]: Finished difference Result 818 states and 1885 transitions. [2019-12-07 14:06:42,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:06:42,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 14:06:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:42,124 INFO L225 Difference]: With dead ends: 818 [2019-12-07 14:06:42,124 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 14:06:42,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:06:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 14:06:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 474. [2019-12-07 14:06:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-12-07 14:06:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1092 transitions. [2019-12-07 14:06:42,129 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1092 transitions. Word has length 42 [2019-12-07 14:06:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:42,129 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 1092 transitions. [2019-12-07 14:06:42,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:06:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1092 transitions. [2019-12-07 14:06:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:06:42,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:42,130 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] [2019-12-07 14:06:42,131 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:06:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:42,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 3 times [2019-12-07 14:06:42,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:06:42,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040292776] [2019-12-07 14:06:42,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:06:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:06:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:06:42,193 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 14:06:42,193 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:06:42,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t835~0.base_37|) 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t835~0.base_37|) (= v_~y$r_buff1_thd0~0_156 0) (= |v_ULTIMATE.start_main_~#t835~0.offset_26| 0) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t835~0.base_37| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t835~0.base_37| 4)) (= 0 v_~y$r_buff0_thd2~0_193) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_37|) |v_ULTIMATE.start_main_~#t835~0.offset_26| 0)) |v_#memory_int_15|) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t835~0.offset=|v_ULTIMATE.start_main_~#t835~0.offset_26|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t835~0.base=|v_ULTIMATE.start_main_~#t835~0.base_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_18|, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t835~0.offset, ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t835~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ULTIMATE.start_main_~#t836~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t836~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:06:42,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12|) |v_ULTIMATE.start_main_~#t836~0.offset_10| 1)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t836~0.base_12| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t836~0.base_12| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t836~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t836~0.offset_10|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_12|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t836~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t836~0.base, #length] because there is no mapped edge [2019-12-07 14:06:42,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~z~0_Out-1944521484 1) (= ~__unbuffered_p1_EBX~0_Out-1944521484 ~a~0_In-1944521484) (= ~y$r_buff1_thd0~0_Out-1944521484 ~y$r_buff0_thd0~0_In-1944521484) (= ~z~0_Out-1944521484 ~__unbuffered_p1_EAX~0_Out-1944521484) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1944521484 0)) (= ~y$r_buff1_thd2~0_Out-1944521484 ~y$r_buff0_thd2~0_In-1944521484) (= ~y$r_buff0_thd2~0_Out-1944521484 1) (= ~y$r_buff0_thd1~0_In-1944521484 ~y$r_buff1_thd1~0_Out-1944521484)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1944521484, ~a~0=~a~0_In-1944521484, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1944521484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1944521484, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1944521484} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1944521484, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1944521484, ~a~0=~a~0_In-1944521484, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1944521484, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1944521484, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1944521484, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1944521484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1944521484, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1944521484, ~z~0=~z~0_Out-1944521484, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1944521484} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:06:42,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In156394695 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In156394695 256)))) (or (and (= ~y$w_buff0_used~0_In156394695 |P1Thread1of1ForFork1_#t~ite28_Out156394695|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite28_Out156394695|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In156394695, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In156394695} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In156394695, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In156394695, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out156394695|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 14:06:42,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2139064109 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In2139064109 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In2139064109 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2139064109 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out2139064109|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In2139064109 |P1Thread1of1ForFork1_#t~ite29_Out2139064109|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2139064109, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2139064109, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2139064109, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2139064109} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2139064109, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2139064109|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2139064109, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2139064109, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2139064109} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 14:06:42,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 14:06:42,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1690297922 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1690297922 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1690297922 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-1690297922 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd1~0_In-1690297922 256)) .cse1))) (= |P0Thread1of1ForFork0_#t~ite24_Out-1690297922| |P0Thread1of1ForFork0_#t~ite23_Out-1690297922|) (= ~y$r_buff1_thd1~0_In-1690297922 |P0Thread1of1ForFork0_#t~ite23_Out-1690297922|)) (and (= |P0Thread1of1ForFork0_#t~ite23_In-1690297922| |P0Thread1of1ForFork0_#t~ite23_Out-1690297922|) (not .cse0) (= ~y$r_buff1_thd1~0_In-1690297922 |P0Thread1of1ForFork0_#t~ite24_Out-1690297922|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1690297922, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690297922, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1690297922, ~weak$$choice2~0=~weak$$choice2~0_In-1690297922, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1690297922, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-1690297922|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1690297922, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690297922, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1690297922, ~weak$$choice2~0=~weak$$choice2~0_In-1690297922, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-1690297922|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-1690297922|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1690297922} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-07 14:06:42,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 14:06:42,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1324442022 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_In-1324442022 ~y$r_buff0_thd2~0_Out-1324442022)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1324442022 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out-1324442022)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1324442022, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1324442022} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1324442022|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1324442022, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1324442022} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:06:42,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In373609639 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In373609639 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In373609639 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In373609639 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out373609639|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite31_Out373609639| ~y$r_buff1_thd2~0_In373609639) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In373609639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In373609639, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In373609639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In373609639} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In373609639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In373609639, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out373609639|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In373609639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In373609639} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:06:42,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 14:06:42,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:06:42,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1231918282 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1231918282 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out-1231918282| ~y$w_buff1~0_In-1231918282) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1231918282| ~y~0_In-1231918282)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1231918282, ~y~0=~y~0_In-1231918282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1231918282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1231918282} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1231918282, ~y~0=~y~0_In-1231918282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1231918282, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1231918282|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1231918282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:06:42,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:06:42,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1531320721 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1531320721 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out1531320721|)) (and (= |ULTIMATE.start_main_#t~ite36_Out1531320721| ~y$w_buff0_used~0_In1531320721) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1531320721, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1531320721} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1531320721, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1531320721, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1531320721|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 14:06:42,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1015225986 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1015225986 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1015225986 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1015225986 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-1015225986| ~y$w_buff1_used~0_In-1015225986) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-1015225986|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1015225986, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1015225986, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1015225986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1015225986} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1015225986, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1015225986, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1015225986|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1015225986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1015225986} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 14:06:42,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-165845895 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-165845895 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-165845895| ~y$r_buff0_thd0~0_In-165845895)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-165845895| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-165845895, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-165845895} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-165845895, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-165845895, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-165845895|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:06:42,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-268576227 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-268576227 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-268576227 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-268576227 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-268576227 |ULTIMATE.start_main_#t~ite39_Out-268576227|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-268576227|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-268576227, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-268576227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-268576227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-268576227} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-268576227, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-268576227|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-268576227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-268576227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-268576227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:06:42,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:06:42,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:06:42 BasicIcfg [2019-12-07 14:06:42,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:06:42,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:06:42,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:06:42,241 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:06:42,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:06:35" (3/4) ... [2019-12-07 14:06:42,243 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:06:42,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t835~0.base_37|) 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t835~0.base_37|) (= v_~y$r_buff1_thd0~0_156 0) (= |v_ULTIMATE.start_main_~#t835~0.offset_26| 0) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t835~0.base_37| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t835~0.base_37| 4)) (= 0 v_~y$r_buff0_thd2~0_193) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_37|) |v_ULTIMATE.start_main_~#t835~0.offset_26| 0)) |v_#memory_int_15|) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t835~0.offset=|v_ULTIMATE.start_main_~#t835~0.offset_26|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t835~0.base=|v_ULTIMATE.start_main_~#t835~0.base_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_18|, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t835~0.offset, ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t835~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ULTIMATE.start_main_~#t836~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t836~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:06:42,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12|) |v_ULTIMATE.start_main_~#t836~0.offset_10| 1)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t836~0.base_12| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t836~0.base_12| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t836~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t836~0.offset_10|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_12|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t836~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t836~0.base, #length] because there is no mapped edge [2019-12-07 14:06:42,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~z~0_Out-1944521484 1) (= ~__unbuffered_p1_EBX~0_Out-1944521484 ~a~0_In-1944521484) (= ~y$r_buff1_thd0~0_Out-1944521484 ~y$r_buff0_thd0~0_In-1944521484) (= ~z~0_Out-1944521484 ~__unbuffered_p1_EAX~0_Out-1944521484) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1944521484 0)) (= ~y$r_buff1_thd2~0_Out-1944521484 ~y$r_buff0_thd2~0_In-1944521484) (= ~y$r_buff0_thd2~0_Out-1944521484 1) (= ~y$r_buff0_thd1~0_In-1944521484 ~y$r_buff1_thd1~0_Out-1944521484)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1944521484, ~a~0=~a~0_In-1944521484, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1944521484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1944521484, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1944521484} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1944521484, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1944521484, ~a~0=~a~0_In-1944521484, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1944521484, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1944521484, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1944521484, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1944521484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1944521484, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1944521484, ~z~0=~z~0_Out-1944521484, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1944521484} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:06:42,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In156394695 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In156394695 256)))) (or (and (= ~y$w_buff0_used~0_In156394695 |P1Thread1of1ForFork1_#t~ite28_Out156394695|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite28_Out156394695|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In156394695, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In156394695} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In156394695, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In156394695, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out156394695|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 14:06:42,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2139064109 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In2139064109 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In2139064109 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2139064109 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out2139064109|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In2139064109 |P1Thread1of1ForFork1_#t~ite29_Out2139064109|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2139064109, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2139064109, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2139064109, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2139064109} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2139064109, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2139064109|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2139064109, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2139064109, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2139064109} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 14:06:42,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 14:06:42,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1690297922 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1690297922 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1690297922 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-1690297922 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd1~0_In-1690297922 256)) .cse1))) (= |P0Thread1of1ForFork0_#t~ite24_Out-1690297922| |P0Thread1of1ForFork0_#t~ite23_Out-1690297922|) (= ~y$r_buff1_thd1~0_In-1690297922 |P0Thread1of1ForFork0_#t~ite23_Out-1690297922|)) (and (= |P0Thread1of1ForFork0_#t~ite23_In-1690297922| |P0Thread1of1ForFork0_#t~ite23_Out-1690297922|) (not .cse0) (= ~y$r_buff1_thd1~0_In-1690297922 |P0Thread1of1ForFork0_#t~ite24_Out-1690297922|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1690297922, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690297922, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1690297922, ~weak$$choice2~0=~weak$$choice2~0_In-1690297922, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1690297922, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-1690297922|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1690297922, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690297922, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1690297922, ~weak$$choice2~0=~weak$$choice2~0_In-1690297922, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-1690297922|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-1690297922|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1690297922} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-07 14:06:42,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 14:06:42,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1324442022 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_In-1324442022 ~y$r_buff0_thd2~0_Out-1324442022)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1324442022 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out-1324442022)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1324442022, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1324442022} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1324442022|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1324442022, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1324442022} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:06:42,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In373609639 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In373609639 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In373609639 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In373609639 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out373609639|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite31_Out373609639| ~y$r_buff1_thd2~0_In373609639) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In373609639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In373609639, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In373609639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In373609639} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In373609639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In373609639, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out373609639|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In373609639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In373609639} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:06:42,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 14:06:42,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:06:42,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1231918282 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1231918282 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out-1231918282| ~y$w_buff1~0_In-1231918282) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1231918282| ~y~0_In-1231918282)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1231918282, ~y~0=~y~0_In-1231918282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1231918282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1231918282} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1231918282, ~y~0=~y~0_In-1231918282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1231918282, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1231918282|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1231918282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:06:42,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:06:42,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1531320721 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1531320721 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out1531320721|)) (and (= |ULTIMATE.start_main_#t~ite36_Out1531320721| ~y$w_buff0_used~0_In1531320721) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1531320721, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1531320721} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1531320721, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1531320721, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1531320721|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 14:06:42,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1015225986 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1015225986 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1015225986 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1015225986 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-1015225986| ~y$w_buff1_used~0_In-1015225986) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-1015225986|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1015225986, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1015225986, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1015225986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1015225986} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1015225986, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1015225986, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1015225986|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1015225986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1015225986} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 14:06:42,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-165845895 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-165845895 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-165845895| ~y$r_buff0_thd0~0_In-165845895)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-165845895| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-165845895, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-165845895} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-165845895, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-165845895, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-165845895|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:06:42,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-268576227 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-268576227 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-268576227 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-268576227 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-268576227 |ULTIMATE.start_main_#t~ite39_Out-268576227|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-268576227|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-268576227, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-268576227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-268576227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-268576227} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-268576227, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-268576227|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-268576227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-268576227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-268576227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:06:42,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:06:42,297 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_96f81af2-82f2-41a2-ae5d-d730897fab8c/bin/utaipan/witness.graphml [2019-12-07 14:06:42,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:06:42,298 INFO L168 Benchmark]: Toolchain (without parser) took 7775.71 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.6 MB). Free memory was 940.9 MB in the beginning and 945.8 MB in the end (delta: -4.9 MB). Peak memory consumption was 386.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:06:42,299 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:06:42,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -140.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:06:42,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.70 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 14:06:42,300 INFO L168 Benchmark]: Boogie Preprocessor took 24.14 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 14:06:42,300 INFO L168 Benchmark]: RCFGBuilder took 382.14 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: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:06:42,300 INFO L168 Benchmark]: TraceAbstraction took 6882.34 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 280.0 MB). Free memory was 1.0 GB in the beginning and 959.3 MB in the end (delta: 66.0 MB). Peak memory consumption was 346.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:06:42,301 INFO L168 Benchmark]: Witness Printer took 56.84 ms. Allocated memory is still 1.4 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:06:42,302 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -140.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.70 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 24.14 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 382.14 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: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6882.34 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 280.0 MB). Free memory was 1.0 GB in the beginning and 959.3 MB in the end (delta: 66.0 MB). Peak memory consumption was 346.0 MB. Max. memory is 11.5 GB. * Witness Printer took 56.84 ms. Allocated memory is still 1.4 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 139 ProgramPointsBefore, 67 ProgramPointsAfterwards, 167 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 178 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 44937 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L818] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 6.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1235 SDtfs, 1012 SDslu, 1817 SDs, 0 SdLazy, 710 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10870occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 6024 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 34932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...