./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021_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_012e73cd-dbfe-4935-b903-e22999059c66/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/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 7cd84424f476a75a642ba1265ba8d2f45e7bcede ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:00:33,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 22:00:33,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 22:00:33,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 22:00:33,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 22:00:33,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 22:00:33,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 22:00:33,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 22:00:33,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 22:00:33,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 22:00:33,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 22:00:33,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 22:00:33,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 22:00:33,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 22:00:33,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 22:00:33,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 22:00:33,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 22:00:33,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 22:00:33,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 22:00:33,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 22:00:33,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 22:00:33,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 22:00:33,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 22:00:33,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 22:00:33,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 22:00:33,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 22:00:33,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 22:00:33,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 22:00:33,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 22:00:33,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 22:00:33,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 22:00:33,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 22:00:33,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 22:00:33,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 22:00:33,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 22:00:33,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 22:00:33,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 22:00:33,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 22:00:33,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 22:00:33,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 22:00:33,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 22:00:33,971 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 22:00:33,981 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 22:00:33,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 22:00:33,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 22:00:33,982 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 22:00:33,982 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 22:00:33,982 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 22:00:33,982 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 22:00:33,982 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 22:00:33,982 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 22:00:33,983 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 22:00:33,983 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 22:00:33,983 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 22:00:33,983 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 22:00:33,983 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 22:00:33,983 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 22:00:33,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 22:00:33,984 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 22:00:33,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 22:00:33,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 22:00:33,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 22:00:33,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 22:00:33,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 22:00:33,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 22:00:33,984 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 22:00:33,984 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 22:00:33,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 22:00:33,985 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 22:00:33,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 22:00:33,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 22:00:33,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 22:00:33,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 22:00:33,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 22:00:33,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 22:00:33,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 22:00:33,986 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 22:00:33,986 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 22:00:33,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 22:00:33,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 22:00:33,986 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 22:00:33,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 22:00:33,986 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_012e73cd-dbfe-4935-b903-e22999059c66/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 -> 7cd84424f476a75a642ba1265ba8d2f45e7bcede [2019-12-07 22:00:34,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 22:00:34,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 22:00:34,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 22:00:34,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 22:00:34,099 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 22:00:34,100 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix021_power.opt.i [2019-12-07 22:00:34,136 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/bin/utaipan/data/0ef2f8c04/aa5bb000aaf94c93aa8a08b2a1e8e21a/FLAG39afcec50 [2019-12-07 22:00:34,630 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 22:00:34,630 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/sv-benchmarks/c/pthread-wmm/mix021_power.opt.i [2019-12-07 22:00:34,641 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/bin/utaipan/data/0ef2f8c04/aa5bb000aaf94c93aa8a08b2a1e8e21a/FLAG39afcec50 [2019-12-07 22:00:35,120 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/bin/utaipan/data/0ef2f8c04/aa5bb000aaf94c93aa8a08b2a1e8e21a [2019-12-07 22:00:35,122 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 22:00:35,123 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 22:00:35,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 22:00:35,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 22:00:35,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 22:00:35,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:00:35" (1/1) ... [2019-12-07 22:00:35,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ca17ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35, skipping insertion in model container [2019-12-07 22:00:35,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:00:35" (1/1) ... [2019-12-07 22:00:35,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 22:00:35,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 22:00:35,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:00:35,419 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 22:00:35,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:00:35,508 INFO L208 MainTranslator]: Completed translation [2019-12-07 22:00:35,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35 WrapperNode [2019-12-07 22:00:35,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 22:00:35,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 22:00:35,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 22:00:35,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 22:00:35,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35" (1/1) ... [2019-12-07 22:00:35,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35" (1/1) ... [2019-12-07 22:00:35,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 22:00:35,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 22:00:35,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 22:00:35,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 22:00:35,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35" (1/1) ... [2019-12-07 22:00:35,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35" (1/1) ... [2019-12-07 22:00:35,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35" (1/1) ... [2019-12-07 22:00:35,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35" (1/1) ... [2019-12-07 22:00:35,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35" (1/1) ... [2019-12-07 22:00:35,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35" (1/1) ... [2019-12-07 22:00:35,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35" (1/1) ... [2019-12-07 22:00:35,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 22:00:35,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 22:00:35,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 22:00:35,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 22:00:35,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/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 22:00:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 22:00:35,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 22:00:35,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 22:00:35,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 22:00:35,617 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 22:00:35,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 22:00:35,617 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 22:00:35,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 22:00:35,617 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 22:00:35,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 22:00:35,617 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 22:00:35,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 22:00:35,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 22:00:35,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 22:00:35,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 22:00:35,619 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 22:00:36,025 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 22:00:36,025 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 22:00:36,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:00:36 BoogieIcfgContainer [2019-12-07 22:00:36,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 22:00:36,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 22:00:36,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 22:00:36,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 22:00:36,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:00:35" (1/3) ... [2019-12-07 22:00:36,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201c1e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:00:36, skipping insertion in model container [2019-12-07 22:00:36,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:00:35" (2/3) ... [2019-12-07 22:00:36,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201c1e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:00:36, skipping insertion in model container [2019-12-07 22:00:36,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:00:36" (3/3) ... [2019-12-07 22:00:36,031 INFO L109 eAbstractionObserver]: Analyzing ICFG mix021_power.opt.i [2019-12-07 22:00:36,038 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 22:00:36,038 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 22:00:36,043 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 22:00:36,044 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 22:00:36,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,076 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,076 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,078 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,078 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,092 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,092 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,093 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,093 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,093 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:00:36,119 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 22:00:36,131 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 22:00:36,131 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 22:00:36,131 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 22:00:36,131 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 22:00:36,131 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 22:00:36,131 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 22:00:36,132 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 22:00:36,132 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 22:00:36,142 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 253 transitions [2019-12-07 22:00:36,143 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 210 places, 253 transitions [2019-12-07 22:00:36,210 INFO L134 PetriNetUnfolder]: 56/249 cut-off events. [2019-12-07 22:00:36,210 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 22:00:36,223 INFO L76 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 56/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 12/203 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 22:00:36,246 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 210 places, 253 transitions [2019-12-07 22:00:36,286 INFO L134 PetriNetUnfolder]: 56/249 cut-off events. [2019-12-07 22:00:36,286 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 22:00:36,295 INFO L76 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 56/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 12/203 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 22:00:36,320 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 22:00:36,321 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 22:00:40,085 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 22:00:40,346 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 22:00:40,468 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146481 [2019-12-07 22:00:40,469 INFO L214 etLargeBlockEncoding]: Total number of compositions: 131 [2019-12-07 22:00:40,471 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-07 22:00:48,854 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 93550 states. [2019-12-07 22:00:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 93550 states. [2019-12-07 22:00:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 22:00:48,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:00:48,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:00:48,861 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:00:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:00:48,865 INFO L82 PathProgramCache]: Analyzing trace with hash 155254263, now seen corresponding path program 1 times [2019-12-07 22:00:48,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:00:48,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374729995] [2019-12-07 22:00:48,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:00:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:00:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:00:49,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374729995] [2019-12-07 22:00:49,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:00:49,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 22:00:49,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119119114] [2019-12-07 22:00:49,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:00:49,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:00:49,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:00:49,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:00:49,038 INFO L87 Difference]: Start difference. First operand 93550 states. Second operand 3 states. [2019-12-07 22:00:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:00:49,811 INFO L93 Difference]: Finished difference Result 92966 states and 426320 transitions. [2019-12-07 22:00:49,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:00:49,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 22:00:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:00:50,271 INFO L225 Difference]: With dead ends: 92966 [2019-12-07 22:00:50,271 INFO L226 Difference]: Without dead ends: 86602 [2019-12-07 22:00:50,272 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 22:00:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86602 states. [2019-12-07 22:00:53,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86602 to 86602. [2019-12-07 22:00:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86602 states. [2019-12-07 22:00:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86602 states to 86602 states and 396876 transitions. [2019-12-07 22:00:53,390 INFO L78 Accepts]: Start accepts. Automaton has 86602 states and 396876 transitions. Word has length 9 [2019-12-07 22:00:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:00:53,391 INFO L462 AbstractCegarLoop]: Abstraction has 86602 states and 396876 transitions. [2019-12-07 22:00:53,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:00:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 86602 states and 396876 transitions. [2019-12-07 22:00:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 22:00:53,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:00:53,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:00:53,397 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:00:53,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:00:53,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1923219547, now seen corresponding path program 1 times [2019-12-07 22:00:53,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:00:53,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794309698] [2019-12-07 22:00:53,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:00:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:00:53,458 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 22:00:53,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794309698] [2019-12-07 22:00:53,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:00:53,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:00:53,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80803120] [2019-12-07 22:00:53,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:00:53,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:00:53,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:00:53,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:00:53,460 INFO L87 Difference]: Start difference. First operand 86602 states and 396876 transitions. Second operand 4 states. [2019-12-07 22:00:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:00:56,137 INFO L93 Difference]: Finished difference Result 138074 states and 610572 transitions. [2019-12-07 22:00:56,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:00:56,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 22:00:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:00:56,529 INFO L225 Difference]: With dead ends: 138074 [2019-12-07 22:00:56,529 INFO L226 Difference]: Without dead ends: 138002 [2019-12-07 22:00:56,530 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 22:00:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138002 states. [2019-12-07 22:01:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138002 to 133994. [2019-12-07 22:01:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133994 states. [2019-12-07 22:01:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133994 states to 133994 states and 595808 transitions. [2019-12-07 22:01:00,603 INFO L78 Accepts]: Start accepts. Automaton has 133994 states and 595808 transitions. Word has length 15 [2019-12-07 22:01:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:00,603 INFO L462 AbstractCegarLoop]: Abstraction has 133994 states and 595808 transitions. [2019-12-07 22:01:00,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:01:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 133994 states and 595808 transitions. [2019-12-07 22:01:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 22:01:00,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:00,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:01:00,609 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:01:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:00,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1961000002, now seen corresponding path program 1 times [2019-12-07 22:01:00,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:00,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242773200] [2019-12-07 22:01:00,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:00,658 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 22:01:00,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242773200] [2019-12-07 22:01:00,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:01:00,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:01:00,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154393411] [2019-12-07 22:01:00,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:01:00,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:00,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:01:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:01:00,660 INFO L87 Difference]: Start difference. First operand 133994 states and 595808 transitions. Second operand 4 states. [2019-12-07 22:01:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:01,566 INFO L93 Difference]: Finished difference Result 171690 states and 753612 transitions. [2019-12-07 22:01:01,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:01:01,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 22:01:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:02,012 INFO L225 Difference]: With dead ends: 171690 [2019-12-07 22:01:02,012 INFO L226 Difference]: Without dead ends: 171630 [2019-12-07 22:01:02,013 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 22:01:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171630 states. [2019-12-07 22:01:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171630 to 153202. [2019-12-07 22:01:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153202 states. [2019-12-07 22:01:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153202 states to 153202 states and 678068 transitions. [2019-12-07 22:01:08,735 INFO L78 Accepts]: Start accepts. Automaton has 153202 states and 678068 transitions. Word has length 18 [2019-12-07 22:01:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:08,736 INFO L462 AbstractCegarLoop]: Abstraction has 153202 states and 678068 transitions. [2019-12-07 22:01:08,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:01:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 153202 states and 678068 transitions. [2019-12-07 22:01:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 22:01:08,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:08,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:01:08,747 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:01:08,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:08,747 INFO L82 PathProgramCache]: Analyzing trace with hash 661487434, now seen corresponding path program 1 times [2019-12-07 22:01:08,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:08,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726616776] [2019-12-07 22:01:08,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:08,777 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 22:01:08,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726616776] [2019-12-07 22:01:08,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:01:08,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:01:08,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920641252] [2019-12-07 22:01:08,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:01:08,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:08,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:01:08,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:01:08,778 INFO L87 Difference]: Start difference. First operand 153202 states and 678068 transitions. Second operand 3 states. [2019-12-07 22:01:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:10,054 INFO L93 Difference]: Finished difference Result 255766 states and 1092468 transitions. [2019-12-07 22:01:10,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:01:10,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 22:01:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:11,196 INFO L225 Difference]: With dead ends: 255766 [2019-12-07 22:01:11,196 INFO L226 Difference]: Without dead ends: 255766 [2019-12-07 22:01:11,197 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 22:01:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255766 states. [2019-12-07 22:01:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255766 to 227670. [2019-12-07 22:01:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227670 states. [2019-12-07 22:01:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227670 states to 227670 states and 984460 transitions. [2019-12-07 22:01:20,260 INFO L78 Accepts]: Start accepts. Automaton has 227670 states and 984460 transitions. Word has length 19 [2019-12-07 22:01:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:20,261 INFO L462 AbstractCegarLoop]: Abstraction has 227670 states and 984460 transitions. [2019-12-07 22:01:20,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:01:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 227670 states and 984460 transitions. [2019-12-07 22:01:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 22:01:20,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:20,271 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] [2019-12-07 22:01:20,272 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:01:20,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:20,272 INFO L82 PathProgramCache]: Analyzing trace with hash 301900253, now seen corresponding path program 1 times [2019-12-07 22:01:20,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:20,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436568425] [2019-12-07 22:01:20,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:20,316 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 22:01:20,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436568425] [2019-12-07 22:01:20,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:01:20,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:01:20,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418921048] [2019-12-07 22:01:20,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:01:20,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:20,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:01:20,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:01:20,318 INFO L87 Difference]: Start difference. First operand 227670 states and 984460 transitions. Second operand 3 states. [2019-12-07 22:01:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:21,388 INFO L93 Difference]: Finished difference Result 227670 states and 973664 transitions. [2019-12-07 22:01:21,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:01:21,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 22:01:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:22,028 INFO L225 Difference]: With dead ends: 227670 [2019-12-07 22:01:22,028 INFO L226 Difference]: Without dead ends: 227670 [2019-12-07 22:01:22,029 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 22:01:24,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227670 states. [2019-12-07 22:01:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227670 to 225646. [2019-12-07 22:01:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225646 states. [2019-12-07 22:01:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225646 states to 225646 states and 965864 transitions. [2019-12-07 22:01:31,321 INFO L78 Accepts]: Start accepts. Automaton has 225646 states and 965864 transitions. Word has length 20 [2019-12-07 22:01:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:31,321 INFO L462 AbstractCegarLoop]: Abstraction has 225646 states and 965864 transitions. [2019-12-07 22:01:31,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:01:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 225646 states and 965864 transitions. [2019-12-07 22:01:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 22:01:31,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:31,330 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] [2019-12-07 22:01:31,330 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:01:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:31,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1488828346, now seen corresponding path program 1 times [2019-12-07 22:01:31,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:31,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803119840] [2019-12-07 22:01:31,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:31,393 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 22:01:31,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803119840] [2019-12-07 22:01:31,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:01:31,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 22:01:31,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708189115] [2019-12-07 22:01:31,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:01:31,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:31,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:01:31,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:01:31,394 INFO L87 Difference]: Start difference. First operand 225646 states and 965864 transitions. Second operand 3 states. [2019-12-07 22:01:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:33,413 INFO L93 Difference]: Finished difference Result 392289 states and 1609867 transitions. [2019-12-07 22:01:33,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:01:33,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 22:01:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:34,937 INFO L225 Difference]: With dead ends: 392289 [2019-12-07 22:01:34,937 INFO L226 Difference]: Without dead ends: 390867 [2019-12-07 22:01:34,937 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 22:01:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390867 states. [2019-12-07 22:01:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390867 to 376641. [2019-12-07 22:01:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376641 states. [2019-12-07 22:01:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376641 states to 376641 states and 1560668 transitions. [2019-12-07 22:01:48,274 INFO L78 Accepts]: Start accepts. Automaton has 376641 states and 1560668 transitions. Word has length 20 [2019-12-07 22:01:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:48,274 INFO L462 AbstractCegarLoop]: Abstraction has 376641 states and 1560668 transitions. [2019-12-07 22:01:48,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:01:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 376641 states and 1560668 transitions. [2019-12-07 22:01:48,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 22:01:48,292 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:48,292 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] [2019-12-07 22:01:48,292 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:01:48,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:48,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1251839182, now seen corresponding path program 1 times [2019-12-07 22:01:48,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:48,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610923809] [2019-12-07 22:01:48,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:48,321 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 22:01:48,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610923809] [2019-12-07 22:01:48,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:01:48,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:01:48,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316255941] [2019-12-07 22:01:48,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:01:48,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:48,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:01:48,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:01:48,323 INFO L87 Difference]: Start difference. First operand 376641 states and 1560668 transitions. Second operand 4 states. [2019-12-07 22:01:51,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:51,130 INFO L93 Difference]: Finished difference Result 465181 states and 1907392 transitions. [2019-12-07 22:01:51,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:01:51,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 22:01:51,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:52,444 INFO L225 Difference]: With dead ends: 465181 [2019-12-07 22:01:52,445 INFO L226 Difference]: Without dead ends: 465109 [2019-12-07 22:01:52,445 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 22:02:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465109 states. [2019-12-07 22:02:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465109 to 381324. [2019-12-07 22:02:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381324 states. [2019-12-07 22:02:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381324 states to 381324 states and 1579994 transitions. [2019-12-07 22:02:06,641 INFO L78 Accepts]: Start accepts. Automaton has 381324 states and 1579994 transitions. Word has length 21 [2019-12-07 22:02:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:06,641 INFO L462 AbstractCegarLoop]: Abstraction has 381324 states and 1579994 transitions. [2019-12-07 22:02:06,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:02:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 381324 states and 1579994 transitions. [2019-12-07 22:02:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 22:02:06,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:06,659 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] [2019-12-07 22:02:06,659 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:06,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:06,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1027281216, now seen corresponding path program 1 times [2019-12-07 22:02:06,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:06,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562095883] [2019-12-07 22:02:06,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:07,241 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 22:02:07,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562095883] [2019-12-07 22:02:07,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:07,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:02:07,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327247118] [2019-12-07 22:02:07,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:02:07,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:07,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:02:07,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:02:07,242 INFO L87 Difference]: Start difference. First operand 381324 states and 1579994 transitions. Second operand 3 states. [2019-12-07 22:02:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:08,581 INFO L93 Difference]: Finished difference Result 319676 states and 1263297 transitions. [2019-12-07 22:02:08,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:02:08,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 22:02:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:09,390 INFO L225 Difference]: With dead ends: 319676 [2019-12-07 22:02:09,390 INFO L226 Difference]: Without dead ends: 319676 [2019-12-07 22:02:09,391 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 22:02:12,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319676 states. [2019-12-07 22:02:16,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319676 to 319676. [2019-12-07 22:02:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319676 states. [2019-12-07 22:02:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319676 states to 319676 states and 1263297 transitions. [2019-12-07 22:02:17,613 INFO L78 Accepts]: Start accepts. Automaton has 319676 states and 1263297 transitions. Word has length 21 [2019-12-07 22:02:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:17,614 INFO L462 AbstractCegarLoop]: Abstraction has 319676 states and 1263297 transitions. [2019-12-07 22:02:17,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:02:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 319676 states and 1263297 transitions. [2019-12-07 22:02:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 22:02:17,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:17,630 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:17,631 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:17,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:17,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1200590819, now seen corresponding path program 1 times [2019-12-07 22:02:17,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:17,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733585783] [2019-12-07 22:02:17,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:17,661 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 22:02:17,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733585783] [2019-12-07 22:02:17,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:17,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:02:17,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862438250] [2019-12-07 22:02:17,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:02:17,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:17,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:02:17,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:02:17,663 INFO L87 Difference]: Start difference. First operand 319676 states and 1263297 transitions. Second operand 3 states. [2019-12-07 22:02:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:21,607 INFO L93 Difference]: Finished difference Result 423180 states and 1593177 transitions. [2019-12-07 22:02:21,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:02:21,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 22:02:21,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:22,643 INFO L225 Difference]: With dead ends: 423180 [2019-12-07 22:02:22,643 INFO L226 Difference]: Without dead ends: 320684 [2019-12-07 22:02:22,643 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 22:02:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320684 states. [2019-12-07 22:02:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320684 to 269178. [2019-12-07 22:02:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269178 states. [2019-12-07 22:02:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269178 states to 269178 states and 947222 transitions. [2019-12-07 22:02:29,187 INFO L78 Accepts]: Start accepts. Automaton has 269178 states and 947222 transitions. Word has length 22 [2019-12-07 22:02:29,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:29,188 INFO L462 AbstractCegarLoop]: Abstraction has 269178 states and 947222 transitions. [2019-12-07 22:02:29,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:02:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 269178 states and 947222 transitions. [2019-12-07 22:02:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 22:02:29,202 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:29,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:29,202 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash -468870348, now seen corresponding path program 1 times [2019-12-07 22:02:29,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:29,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225172577] [2019-12-07 22:02:29,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:29,245 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 22:02:29,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225172577] [2019-12-07 22:02:29,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:29,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:02:29,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038155022] [2019-12-07 22:02:29,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:02:29,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:29,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:02:29,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:02:29,247 INFO L87 Difference]: Start difference. First operand 269178 states and 947222 transitions. Second operand 4 states. [2019-12-07 22:02:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:30,587 INFO L93 Difference]: Finished difference Result 277160 states and 978789 transitions. [2019-12-07 22:02:30,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:02:30,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 22:02:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:31,170 INFO L225 Difference]: With dead ends: 277160 [2019-12-07 22:02:31,170 INFO L226 Difference]: Without dead ends: 277160 [2019-12-07 22:02:31,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 22:02:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277160 states. [2019-12-07 22:02:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277160 to 194517. [2019-12-07 22:02:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194517 states. [2019-12-07 22:02:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194517 states to 194517 states and 692515 transitions. [2019-12-07 22:02:36,772 INFO L78 Accepts]: Start accepts. Automaton has 194517 states and 692515 transitions. Word has length 22 [2019-12-07 22:02:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:36,773 INFO L462 AbstractCegarLoop]: Abstraction has 194517 states and 692515 transitions. [2019-12-07 22:02:36,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:02:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 194517 states and 692515 transitions. [2019-12-07 22:02:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 22:02:36,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:36,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:36,793 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash -342281171, now seen corresponding path program 1 times [2019-12-07 22:02:36,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:36,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607268656] [2019-12-07 22:02:36,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:36,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 22:02:36,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607268656] [2019-12-07 22:02:36,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:36,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:02:36,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313792846] [2019-12-07 22:02:36,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:02:36,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:02:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:02:36,824 INFO L87 Difference]: Start difference. First operand 194517 states and 692515 transitions. Second operand 5 states. [2019-12-07 22:02:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:38,462 INFO L93 Difference]: Finished difference Result 276451 states and 964218 transitions. [2019-12-07 22:02:38,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 22:02:38,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 22:02:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:39,020 INFO L225 Difference]: With dead ends: 276451 [2019-12-07 22:02:39,020 INFO L226 Difference]: Without dead ends: 276213 [2019-12-07 22:02:39,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 22:02:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276213 states. [2019-12-07 22:02:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276213 to 211333. [2019-12-07 22:02:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211333 states. [2019-12-07 22:02:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211333 states to 211333 states and 750844 transitions. [2019-12-07 22:02:46,710 INFO L78 Accepts]: Start accepts. Automaton has 211333 states and 750844 transitions. Word has length 25 [2019-12-07 22:02:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:46,711 INFO L462 AbstractCegarLoop]: Abstraction has 211333 states and 750844 transitions. [2019-12-07 22:02:46,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:02:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 211333 states and 750844 transitions. [2019-12-07 22:02:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 22:02:46,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:46,744 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] [2019-12-07 22:02:46,744 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:46,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:46,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1997113759, now seen corresponding path program 1 times [2019-12-07 22:02:46,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:46,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303864783] [2019-12-07 22:02:46,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:46,787 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 22:02:46,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303864783] [2019-12-07 22:02:46,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:46,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:02:46,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343665558] [2019-12-07 22:02:46,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:02:46,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:46,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:02:46,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:02:46,788 INFO L87 Difference]: Start difference. First operand 211333 states and 750844 transitions. Second operand 5 states. [2019-12-07 22:02:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:48,476 INFO L93 Difference]: Finished difference Result 289698 states and 1009412 transitions. [2019-12-07 22:02:48,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 22:02:48,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 22:02:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:49,060 INFO L225 Difference]: With dead ends: 289698 [2019-12-07 22:02:49,060 INFO L226 Difference]: Without dead ends: 289203 [2019-12-07 22:02:49,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 22:02:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289203 states. [2019-12-07 22:02:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289203 to 198244. [2019-12-07 22:02:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198244 states. [2019-12-07 22:02:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198244 states to 198244 states and 704182 transitions. [2019-12-07 22:02:54,744 INFO L78 Accepts]: Start accepts. Automaton has 198244 states and 704182 transitions. Word has length 28 [2019-12-07 22:02:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:54,745 INFO L462 AbstractCegarLoop]: Abstraction has 198244 states and 704182 transitions. [2019-12-07 22:02:54,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:02:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 198244 states and 704182 transitions. [2019-12-07 22:02:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 22:02:54,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:54,865 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] [2019-12-07 22:02:54,866 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:54,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:54,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1648973845, now seen corresponding path program 1 times [2019-12-07 22:02:54,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:54,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951827300] [2019-12-07 22:02:54,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:54,893 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 22:02:54,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951827300] [2019-12-07 22:02:54,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:54,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:02:54,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119916008] [2019-12-07 22:02:54,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:02:54,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:54,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:02:54,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:02:54,895 INFO L87 Difference]: Start difference. First operand 198244 states and 704182 transitions. Second operand 4 states. [2019-12-07 22:02:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:55,156 INFO L93 Difference]: Finished difference Result 85077 states and 273632 transitions. [2019-12-07 22:02:55,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:02:55,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 22:02:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:55,290 INFO L225 Difference]: With dead ends: 85077 [2019-12-07 22:02:55,290 INFO L226 Difference]: Without dead ends: 85077 [2019-12-07 22:02:55,291 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 22:02:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85077 states. [2019-12-07 22:02:56,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85077 to 84907. [2019-12-07 22:02:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84907 states. [2019-12-07 22:02:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84907 states to 84907 states and 273248 transitions. [2019-12-07 22:02:57,079 INFO L78 Accepts]: Start accepts. Automaton has 84907 states and 273248 transitions. Word has length 36 [2019-12-07 22:02:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:57,079 INFO L462 AbstractCegarLoop]: Abstraction has 84907 states and 273248 transitions. [2019-12-07 22:02:57,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:02:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 84907 states and 273248 transitions. [2019-12-07 22:02:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 22:02:57,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:57,117 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] [2019-12-07 22:02:57,118 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1946767640, now seen corresponding path program 1 times [2019-12-07 22:02:57,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:57,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953887862] [2019-12-07 22:02:57,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:57,156 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 22:02:57,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953887862] [2019-12-07 22:02:57,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:57,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:02:57,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993410774] [2019-12-07 22:02:57,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:02:57,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:57,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:02:57,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:02:57,157 INFO L87 Difference]: Start difference. First operand 84907 states and 273248 transitions. Second operand 5 states. [2019-12-07 22:02:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:57,225 INFO L93 Difference]: Finished difference Result 19363 states and 56037 transitions. [2019-12-07 22:02:57,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:02:57,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 22:02:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:57,246 INFO L225 Difference]: With dead ends: 19363 [2019-12-07 22:02:57,246 INFO L226 Difference]: Without dead ends: 19324 [2019-12-07 22:02:57,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:02:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19324 states. [2019-12-07 22:02:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19324 to 18118. [2019-12-07 22:02:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18118 states. [2019-12-07 22:02:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18118 states to 18118 states and 53233 transitions. [2019-12-07 22:02:57,468 INFO L78 Accepts]: Start accepts. Automaton has 18118 states and 53233 transitions. Word has length 37 [2019-12-07 22:02:57,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:57,468 INFO L462 AbstractCegarLoop]: Abstraction has 18118 states and 53233 transitions. [2019-12-07 22:02:57,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:02:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 18118 states and 53233 transitions. [2019-12-07 22:02:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 22:02:57,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:57,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:57,482 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:57,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:57,483 INFO L82 PathProgramCache]: Analyzing trace with hash 579553906, now seen corresponding path program 1 times [2019-12-07 22:02:57,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:57,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517987598] [2019-12-07 22:02:57,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:57,521 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 22:02:57,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517987598] [2019-12-07 22:02:57,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:57,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 22:02:57,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921112355] [2019-12-07 22:02:57,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 22:02:57,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:57,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 22:02:57,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:02:57,522 INFO L87 Difference]: Start difference. First operand 18118 states and 53233 transitions. Second operand 6 states. [2019-12-07 22:02:57,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:57,583 INFO L93 Difference]: Finished difference Result 15032 states and 46256 transitions. [2019-12-07 22:02:57,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:02:57,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 22:02:57,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:57,597 INFO L225 Difference]: With dead ends: 15032 [2019-12-07 22:02:57,597 INFO L226 Difference]: Without dead ends: 11582 [2019-12-07 22:02:57,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:02:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11582 states. [2019-12-07 22:02:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11582 to 10290. [2019-12-07 22:02:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10290 states. [2019-12-07 22:02:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10290 states to 10290 states and 31407 transitions. [2019-12-07 22:02:57,727 INFO L78 Accepts]: Start accepts. Automaton has 10290 states and 31407 transitions. Word has length 48 [2019-12-07 22:02:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:57,727 INFO L462 AbstractCegarLoop]: Abstraction has 10290 states and 31407 transitions. [2019-12-07 22:02:57,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 22:02:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 10290 states and 31407 transitions. [2019-12-07 22:02:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 22:02:57,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:57,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:57,736 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1839454534, now seen corresponding path program 1 times [2019-12-07 22:02:57,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:57,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072305003] [2019-12-07 22:02:57,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:57,815 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 22:02:57,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072305003] [2019-12-07 22:02:57,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:57,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:02:57,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037052009] [2019-12-07 22:02:57,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:02:57,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:02:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:02:57,817 INFO L87 Difference]: Start difference. First operand 10290 states and 31407 transitions. Second operand 4 states. [2019-12-07 22:02:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:58,028 INFO L93 Difference]: Finished difference Result 16796 states and 50929 transitions. [2019-12-07 22:02:58,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:02:58,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 22:02:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:58,048 INFO L225 Difference]: With dead ends: 16796 [2019-12-07 22:02:58,048 INFO L226 Difference]: Without dead ends: 16796 [2019-12-07 22:02:58,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 22:02:58,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16796 states. [2019-12-07 22:02:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16796 to 11142. [2019-12-07 22:02:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11142 states. [2019-12-07 22:02:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11142 states to 11142 states and 33727 transitions. [2019-12-07 22:02:58,218 INFO L78 Accepts]: Start accepts. Automaton has 11142 states and 33727 transitions. Word has length 65 [2019-12-07 22:02:58,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:58,218 INFO L462 AbstractCegarLoop]: Abstraction has 11142 states and 33727 transitions. [2019-12-07 22:02:58,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:02:58,218 INFO L276 IsEmpty]: Start isEmpty. Operand 11142 states and 33727 transitions. [2019-12-07 22:02:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 22:02:58,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:58,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:58,228 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:58,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash -256453500, now seen corresponding path program 2 times [2019-12-07 22:02:58,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:58,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892588591] [2019-12-07 22:02:58,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:58,297 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 22:02:58,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892588591] [2019-12-07 22:02:58,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:58,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:02:58,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583712455] [2019-12-07 22:02:58,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:02:58,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:58,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:02:58,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:02:58,298 INFO L87 Difference]: Start difference. First operand 11142 states and 33727 transitions. Second operand 4 states. [2019-12-07 22:02:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:58,536 INFO L93 Difference]: Finished difference Result 17644 states and 52455 transitions. [2019-12-07 22:02:58,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:02:58,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 22:02:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:58,555 INFO L225 Difference]: With dead ends: 17644 [2019-12-07 22:02:58,555 INFO L226 Difference]: Without dead ends: 15854 [2019-12-07 22:02:58,555 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 22:02:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15854 states. [2019-12-07 22:02:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15854 to 10098. [2019-12-07 22:02:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10098 states. [2019-12-07 22:02:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 30331 transitions. [2019-12-07 22:02:58,703 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 30331 transitions. Word has length 65 [2019-12-07 22:02:58,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:58,703 INFO L462 AbstractCegarLoop]: Abstraction has 10098 states and 30331 transitions. [2019-12-07 22:02:58,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:02:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 30331 transitions. [2019-12-07 22:02:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 22:02:58,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:58,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:58,711 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:58,712 INFO L82 PathProgramCache]: Analyzing trace with hash -346208662, now seen corresponding path program 3 times [2019-12-07 22:02:58,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:58,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268249907] [2019-12-07 22:02:58,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:58,768 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 22:02:58,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268249907] [2019-12-07 22:02:58,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:58,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:02:58,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505929358] [2019-12-07 22:02:58,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 22:02:58,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 22:02:58,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:02:58,770 INFO L87 Difference]: Start difference. First operand 10098 states and 30331 transitions. Second operand 6 states. [2019-12-07 22:02:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:58,898 INFO L93 Difference]: Finished difference Result 18344 states and 55175 transitions. [2019-12-07 22:02:58,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 22:02:58,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-07 22:02:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:58,914 INFO L225 Difference]: With dead ends: 18344 [2019-12-07 22:02:58,914 INFO L226 Difference]: Without dead ends: 12330 [2019-12-07 22:02:58,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 22:02:58,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12330 states. [2019-12-07 22:02:59,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12330 to 10260. [2019-12-07 22:02:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10260 states. [2019-12-07 22:02:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10260 states to 10260 states and 30742 transitions. [2019-12-07 22:02:59,050 INFO L78 Accepts]: Start accepts. Automaton has 10260 states and 30742 transitions. Word has length 65 [2019-12-07 22:02:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:59,051 INFO L462 AbstractCegarLoop]: Abstraction has 10260 states and 30742 transitions. [2019-12-07 22:02:59,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 22:02:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 10260 states and 30742 transitions. [2019-12-07 22:02:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 22:02:59,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:59,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:59,059 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:59,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1884051960, now seen corresponding path program 1 times [2019-12-07 22:02:59,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:59,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436610060] [2019-12-07 22:02:59,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:59,110 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 22:02:59,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436610060] [2019-12-07 22:02:59,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:59,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:02:59,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745370483] [2019-12-07 22:02:59,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:02:59,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:59,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:02:59,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:02:59,111 INFO L87 Difference]: Start difference. First operand 10260 states and 30742 transitions. Second operand 4 states. [2019-12-07 22:02:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:59,259 INFO L93 Difference]: Finished difference Result 9825 states and 29036 transitions. [2019-12-07 22:02:59,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:02:59,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 22:02:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:59,270 INFO L225 Difference]: With dead ends: 9825 [2019-12-07 22:02:59,270 INFO L226 Difference]: Without dead ends: 9825 [2019-12-07 22:02:59,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 4 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 22:02:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9825 states. [2019-12-07 22:02:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9825 to 9678. [2019-12-07 22:02:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9678 states. [2019-12-07 22:02:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9678 states to 9678 states and 28629 transitions. [2019-12-07 22:02:59,389 INFO L78 Accepts]: Start accepts. Automaton has 9678 states and 28629 transitions. Word has length 66 [2019-12-07 22:02:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:59,389 INFO L462 AbstractCegarLoop]: Abstraction has 9678 states and 28629 transitions. [2019-12-07 22:02:59,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:02:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 9678 states and 28629 transitions. [2019-12-07 22:02:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 22:02:59,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:59,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:59,397 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:59,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1338605312, now seen corresponding path program 1 times [2019-12-07 22:02:59,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:59,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804934091] [2019-12-07 22:02:59,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:59,464 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 22:02:59,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804934091] [2019-12-07 22:02:59,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:59,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:02:59,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813115543] [2019-12-07 22:02:59,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:02:59,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:59,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:02:59,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:02:59,465 INFO L87 Difference]: Start difference. First operand 9678 states and 28629 transitions. Second operand 5 states. [2019-12-07 22:02:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:59,543 INFO L93 Difference]: Finished difference Result 16996 states and 49077 transitions. [2019-12-07 22:02:59,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:02:59,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 22:02:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:59,550 INFO L225 Difference]: With dead ends: 16996 [2019-12-07 22:02:59,550 INFO L226 Difference]: Without dead ends: 5990 [2019-12-07 22:02:59,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 22:02:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2019-12-07 22:02:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 5054. [2019-12-07 22:02:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5054 states. [2019-12-07 22:02:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5054 states to 5054 states and 13299 transitions. [2019-12-07 22:02:59,615 INFO L78 Accepts]: Start accepts. Automaton has 5054 states and 13299 transitions. Word has length 66 [2019-12-07 22:02:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:59,615 INFO L462 AbstractCegarLoop]: Abstraction has 5054 states and 13299 transitions. [2019-12-07 22:02:59,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:02:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 5054 states and 13299 transitions. [2019-12-07 22:02:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 22:02:59,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:59,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:59,619 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:59,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:59,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1779877316, now seen corresponding path program 2 times [2019-12-07 22:02:59,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:59,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567859935] [2019-12-07 22:02:59,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:59,648 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 22:02:59,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567859935] [2019-12-07 22:02:59,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:59,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:02:59,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441160929] [2019-12-07 22:02:59,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:02:59,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:59,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:02:59,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:02:59,649 INFO L87 Difference]: Start difference. First operand 5054 states and 13299 transitions. Second operand 3 states. [2019-12-07 22:02:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:59,665 INFO L93 Difference]: Finished difference Result 5569 states and 14462 transitions. [2019-12-07 22:02:59,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:02:59,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 22:02:59,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:59,666 INFO L225 Difference]: With dead ends: 5569 [2019-12-07 22:02:59,666 INFO L226 Difference]: Without dead ends: 599 [2019-12-07 22:02:59,666 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 22:02:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-12-07 22:02:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-12-07 22:02:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-07 22:02:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1291 transitions. [2019-12-07 22:02:59,672 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1291 transitions. Word has length 66 [2019-12-07 22:02:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:59,672 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1291 transitions. [2019-12-07 22:02:59,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:02:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1291 transitions. [2019-12-07 22:02:59,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 22:02:59,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:59,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:59,673 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:02:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:59,673 INFO L82 PathProgramCache]: Analyzing trace with hash 977277596, now seen corresponding path program 3 times [2019-12-07 22:02:59,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:59,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053127445] [2019-12-07 22:02:59,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:59,830 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 22:02:59,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053127445] [2019-12-07 22:02:59,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:02:59,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 22:02:59,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632449959] [2019-12-07 22:02:59,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 22:02:59,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 22:02:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 22:02:59,831 INFO L87 Difference]: Start difference. First operand 599 states and 1291 transitions. Second operand 12 states. [2019-12-07 22:03:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:03:00,430 INFO L93 Difference]: Finished difference Result 1039 states and 2206 transitions. [2019-12-07 22:03:00,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 22:03:00,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 22:03:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:03:00,432 INFO L225 Difference]: With dead ends: 1039 [2019-12-07 22:03:00,432 INFO L226 Difference]: Without dead ends: 708 [2019-12-07 22:03:00,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2019-12-07 22:03:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-12-07 22:03:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 662. [2019-12-07 22:03:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-12-07 22:03:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1387 transitions. [2019-12-07 22:03:00,439 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1387 transitions. Word has length 66 [2019-12-07 22:03:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:03:00,439 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 1387 transitions. [2019-12-07 22:03:00,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 22:03:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1387 transitions. [2019-12-07 22:03:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 22:03:00,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:03:00,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:03:00,440 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:03:00,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:03:00,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1081052920, now seen corresponding path program 4 times [2019-12-07 22:03:00,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:03:00,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882190016] [2019-12-07 22:03:00,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:03:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 22:03:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 22:03:00,536 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 22:03:00,536 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 22:03:00,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] ULTIMATE.startENTRY-->L849: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= 0 v_~x~0_105) (= 0 v_~z$flush_delayed~0_384) (= v_~z$w_buff1_used~0_989 0) (= 0 v_~__unbuffered_p2_EAX~0_146) (= |v_#NULL.offset_7| 0) (= 0 v_~z$mem_tmp~0_347) (= v_~z$r_buff1_thd2~0_303 0) (< 0 |v_#StackHeapBarrier_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t557~0.base_37| 1) |v_#valid_90|) (= 0 v_~z$r_buff0_thd3~0_515) (= v_~z$r_buff0_thd2~0_71 0) (= v_~__unbuffered_p3_EAX~0_112 0) (= v_~z$w_buff0_used~0_1397 0) (= v_~main$tmp_guard1~0_91 0) (= v_~weak$$choice2~0_438 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_71 0) (= v_~z$r_buff1_thd0~0_430 0) (= v_~z$r_buff1_thd1~0_299 0) (= 0 v_~weak$$choice0~0_336) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~y~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff1~0_562 0) (= 0 |v_#NULL.base_7|) (= 0 v_~__unbuffered_p3_EBX~0_93) (= v_~a~0_37 0) (= 0 v_~z$r_buff0_thd4~0_677) (= v_~main$tmp_guard0~0_22 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t557~0.base_37|) (= 0 |v_ULTIMATE.start_main_~#t557~0.offset_25|) (= v_~z~0_307 0) (= 0 v_~z$r_buff1_thd4~0_523) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t557~0.base_37| 4)) (= v_~z$w_buff0~0_773 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t557~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t557~0.base_37|) |v_ULTIMATE.start_main_~#t557~0.offset_25| 0)) |v_#memory_int_23|) (= v_~z$r_buff0_thd0~0_170 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t557~0.base_37|) 0) (= 0 v_~z$r_buff1_thd3~0_601))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_24|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_303, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_184|, ~a~0=v_~a~0_37, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_677, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, #length=|v_#length_31|, ULTIMATE.start_main_~#t558~0.base=|v_ULTIMATE.start_main_~#t558~0.base_30|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ULTIMATE.start_main_~#t557~0.base=|v_ULTIMATE.start_main_~#t557~0.base_37|, ~z$mem_tmp~0=v_~z$mem_tmp~0_347, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_989, ~z$flush_delayed~0=v_~z$flush_delayed~0_384, ULTIMATE.start_main_~#t557~0.offset=|v_ULTIMATE.start_main_~#t557~0.offset_25|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~weak$$choice0~0=v_~weak$$choice0~0_336, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_409|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_299, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_515, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ~x~0=v_~x~0_105, ULTIMATE.start_main_~#t558~0.offset=|v_ULTIMATE.start_main_~#t558~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_523, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_562, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t559~0.base=|v_ULTIMATE.start_main_~#t559~0.base_22|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_430, ULTIMATE.start_main_~#t560~0.offset=|v_ULTIMATE.start_main_~#t560~0.offset_18|, ~y~0=v_~y~0_119, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1397, ~z$w_buff0~0=v_~z$w_buff0~0_773, ULTIMATE.start_main_~#t560~0.base=|v_ULTIMATE.start_main_~#t560~0.base_23|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_601, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_93, ULTIMATE.start_main_~#t559~0.offset=|v_ULTIMATE.start_main_~#t559~0.offset_18|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_67|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_57|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t558~0.base, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t557~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t557~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t558~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t559~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t560~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t560~0.base, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t559~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 22:03:00,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L849-1-->L851: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t558~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t558~0.base_12|) |v_ULTIMATE.start_main_~#t558~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t558~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t558~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t558~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t558~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t558~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t558~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t558~0.offset=|v_ULTIMATE.start_main_~#t558~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t558~0.base=|v_ULTIMATE.start_main_~#t558~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t558~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t558~0.base, #length] because there is no mapped edge [2019-12-07 22:03:00,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L851-1-->L853: Formula: (and (not (= |v_ULTIMATE.start_main_~#t559~0.base_12| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t559~0.base_12|)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t559~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t559~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t559~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t559~0.base_12|) |v_ULTIMATE.start_main_~#t559~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t559~0.base_12|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t559~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t559~0.base=|v_ULTIMATE.start_main_~#t559~0.base_12|, ULTIMATE.start_main_~#t559~0.offset=|v_ULTIMATE.start_main_~#t559~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t559~0.base, ULTIMATE.start_main_~#t559~0.offset] because there is no mapped edge [2019-12-07 22:03:00,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t560~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t560~0.base_13|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t560~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t560~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t560~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t560~0.base_13|) |v_ULTIMATE.start_main_~#t560~0.offset_11| 3)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t560~0.offset_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t560~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, ULTIMATE.start_main_~#t560~0.base=|v_ULTIMATE.start_main_~#t560~0.base_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~#t560~0.offset=|v_ULTIMATE.start_main_~#t560~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t560~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t560~0.offset] because there is no mapped edge [2019-12-07 22:03:00,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_216 v_~z$w_buff1_used~0_129) (= v_~z$w_buff0~0_91 v_~z$w_buff1~0_66) (= v_P3Thread1of1ForFork2_~arg.offset_32 |v_P3Thread1of1ForFork2_#in~arg.offset_34|) (= v_~z$w_buff0_used~0_215 1) (= 1 v_~z$w_buff0~0_90) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_215 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_129 256))))) 1 0)) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 0)) (= |v_P3Thread1of1ForFork2_#in~arg.base_34| v_P3Thread1of1ForFork2_~arg.base_32) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_216, ~z$w_buff0~0=v_~z$w_buff0~0_91, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_215, ~z$w_buff0~0=v_~z$w_buff0~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, ~z$w_buff1~0=v_~z$w_buff1~0_66, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_32, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 22:03:00,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L811-2-->L811-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork2_#t~ite29_Out437190920| |P3Thread1of1ForFork2_#t~ite28_Out437190920|)) (.cse0 (= (mod ~z$w_buff0_used~0_In437190920 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In437190920 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |P3Thread1of1ForFork2_#t~ite28_Out437190920| ~z$w_buff0~0_In437190920)) (and .cse1 (or .cse0 .cse2) (= ~z$w_buff1~0_In437190920 |P3Thread1of1ForFork2_#t~ite28_Out437190920|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In437190920, ~z$w_buff0~0=~z$w_buff0~0_In437190920, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In437190920, ~z$w_buff1~0=~z$w_buff1~0_In437190920} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out437190920|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out437190920|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In437190920, ~z$w_buff0~0=~z$w_buff0~0_In437190920, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In437190920, ~z$w_buff1~0=~z$w_buff1~0_In437190920} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 22:03:00,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L816-->L817: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_78} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 22:03:00,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1890983143 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out1890983143| ~z~0_In1890983143) .cse0) (and (= |P3Thread1of1ForFork2_#t~ite48_Out1890983143| ~z$mem_tmp~0_In1890983143) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1890983143, ~z$flush_delayed~0=~z$flush_delayed~0_In1890983143, ~z~0=~z~0_In1890983143} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1890983143, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1890983143|, ~z$flush_delayed~0=~z$flush_delayed~0_In1890983143, ~z~0=~z~0_In1890983143} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 22:03:00,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= v_~a~0_14 1) (= v_~x~0_22 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 22:03:00,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~x~0_15 2) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_36 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_36, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 22:03:00,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In247523838 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In247523838 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In247523838 |P3Thread1of1ForFork2_#t~ite51_Out247523838|)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out247523838|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In247523838, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In247523838} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out247523838|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In247523838, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In247523838} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 22:03:00,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In433296149 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out433296149| ~z~0_In433296149) .cse0) (and (= |P2Thread1of1ForFork1_#t~ite25_Out433296149| ~z$mem_tmp~0_In433296149) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In433296149, ~z$flush_delayed~0=~z$flush_delayed~0_In433296149, ~z~0=~z~0_In433296149} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In433296149, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out433296149|, ~z$flush_delayed~0=~z$flush_delayed~0_In433296149, ~z~0=~z~0_In433296149} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 22:03:00,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L781-2-->P2EXIT: Formula: (and (= v_~z~0_127 |v_P2Thread1of1ForFork1_#t~ite25_38|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_91) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~z~0=v_~z~0_127, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 22:03:00,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In244292929 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In244292929 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In244292929 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In244292929 256)))) (or (and (= ~z$w_buff1_used~0_In244292929 |P3Thread1of1ForFork2_#t~ite52_Out244292929|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out244292929|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In244292929, ~z$w_buff0_used~0=~z$w_buff0_used~0_In244292929, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In244292929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In244292929} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out244292929|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In244292929, ~z$w_buff0_used~0=~z$w_buff0_used~0_In244292929, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In244292929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In244292929} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 22:03:00,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L829-->L830: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_In-1936153864 ~z$r_buff0_thd4~0_Out-1936153864)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1936153864 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1936153864 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-1936153864) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1936153864, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1936153864} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1936153864|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1936153864, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1936153864} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 22:03:00,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In1308123328 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1308123328 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1308123328 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1308123328 256)))) (or (and (= ~z$r_buff1_thd4~0_In1308123328 |P3Thread1of1ForFork2_#t~ite54_Out1308123328|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out1308123328|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1308123328, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1308123328, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1308123328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1308123328} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out1308123328|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1308123328, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1308123328, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1308123328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1308123328} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 22:03:00,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L830-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_141, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 22:03:00,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_34) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 22:03:00,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L861-2-->L861-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1385234038 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1385234038 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite59_Out1385234038| |ULTIMATE.start_main_#t~ite60_Out1385234038|))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In1385234038 |ULTIMATE.start_main_#t~ite59_Out1385234038|)) (and (or .cse2 .cse1) .cse0 (= |ULTIMATE.start_main_#t~ite59_Out1385234038| ~z~0_In1385234038)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1385234038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1385234038, ~z$w_buff1~0=~z$w_buff1~0_In1385234038, ~z~0=~z~0_In1385234038} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1385234038|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1385234038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1385234038, ~z$w_buff1~0=~z$w_buff1~0_In1385234038, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1385234038|, ~z~0=~z~0_In1385234038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 22:03:00,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L862-->L862-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1688932646 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1688932646 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out1688932646|)) (and (= ~z$w_buff0_used~0_In1688932646 |ULTIMATE.start_main_#t~ite61_Out1688932646|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1688932646, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1688932646} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1688932646, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1688932646|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1688932646} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 22:03:00,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L863-->L863-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-648465828 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-648465828 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-648465828 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-648465828 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-648465828|)) (and (= |ULTIMATE.start_main_#t~ite62_Out-648465828| ~z$w_buff1_used~0_In-648465828) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-648465828, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-648465828, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-648465828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648465828} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-648465828|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-648465828, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-648465828, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-648465828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648465828} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 22:03:00,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In546309580 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In546309580 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In546309580 |ULTIMATE.start_main_#t~ite63_Out546309580|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out546309580|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In546309580, ~z$w_buff0_used~0=~z$w_buff0_used~0_In546309580} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out546309580|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In546309580, ~z$w_buff0_used~0=~z$w_buff0_used~0_In546309580} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 22:03:00,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L865-->L865-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In381839217 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In381839217 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In381839217 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In381839217 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out381839217| ~z$r_buff1_thd0~0_In381839217)) (and (= |ULTIMATE.start_main_#t~ite64_Out381839217| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In381839217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In381839217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In381839217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In381839217} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In381839217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In381839217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In381839217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In381839217, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out381839217|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 22:03:00,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_182 |v_ULTIMATE.start_main_#t~ite64_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~y~0_49 2) (= 1 v_~__unbuffered_p3_EAX~0_33) (= v_~x~0_29 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_45|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 22:03:00,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:03:00 BasicIcfg [2019-12-07 22:03:00,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 22:03:00,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 22:03:00,626 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 22:03:00,626 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 22:03:00,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:00:36" (3/4) ... [2019-12-07 22:03:00,628 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 22:03:00,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] ULTIMATE.startENTRY-->L849: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= 0 v_~x~0_105) (= 0 v_~z$flush_delayed~0_384) (= v_~z$w_buff1_used~0_989 0) (= 0 v_~__unbuffered_p2_EAX~0_146) (= |v_#NULL.offset_7| 0) (= 0 v_~z$mem_tmp~0_347) (= v_~z$r_buff1_thd2~0_303 0) (< 0 |v_#StackHeapBarrier_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t557~0.base_37| 1) |v_#valid_90|) (= 0 v_~z$r_buff0_thd3~0_515) (= v_~z$r_buff0_thd2~0_71 0) (= v_~__unbuffered_p3_EAX~0_112 0) (= v_~z$w_buff0_used~0_1397 0) (= v_~main$tmp_guard1~0_91 0) (= v_~weak$$choice2~0_438 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_71 0) (= v_~z$r_buff1_thd0~0_430 0) (= v_~z$r_buff1_thd1~0_299 0) (= 0 v_~weak$$choice0~0_336) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~y~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff1~0_562 0) (= 0 |v_#NULL.base_7|) (= 0 v_~__unbuffered_p3_EBX~0_93) (= v_~a~0_37 0) (= 0 v_~z$r_buff0_thd4~0_677) (= v_~main$tmp_guard0~0_22 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t557~0.base_37|) (= 0 |v_ULTIMATE.start_main_~#t557~0.offset_25|) (= v_~z~0_307 0) (= 0 v_~z$r_buff1_thd4~0_523) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t557~0.base_37| 4)) (= v_~z$w_buff0~0_773 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t557~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t557~0.base_37|) |v_ULTIMATE.start_main_~#t557~0.offset_25| 0)) |v_#memory_int_23|) (= v_~z$r_buff0_thd0~0_170 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t557~0.base_37|) 0) (= 0 v_~z$r_buff1_thd3~0_601))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_24|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_303, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_184|, ~a~0=v_~a~0_37, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_677, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, #length=|v_#length_31|, ULTIMATE.start_main_~#t558~0.base=|v_ULTIMATE.start_main_~#t558~0.base_30|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ULTIMATE.start_main_~#t557~0.base=|v_ULTIMATE.start_main_~#t557~0.base_37|, ~z$mem_tmp~0=v_~z$mem_tmp~0_347, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_989, ~z$flush_delayed~0=v_~z$flush_delayed~0_384, ULTIMATE.start_main_~#t557~0.offset=|v_ULTIMATE.start_main_~#t557~0.offset_25|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~weak$$choice0~0=v_~weak$$choice0~0_336, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_409|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_299, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_515, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ~x~0=v_~x~0_105, ULTIMATE.start_main_~#t558~0.offset=|v_ULTIMATE.start_main_~#t558~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_523, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_562, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t559~0.base=|v_ULTIMATE.start_main_~#t559~0.base_22|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_430, ULTIMATE.start_main_~#t560~0.offset=|v_ULTIMATE.start_main_~#t560~0.offset_18|, ~y~0=v_~y~0_119, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1397, ~z$w_buff0~0=v_~z$w_buff0~0_773, ULTIMATE.start_main_~#t560~0.base=|v_ULTIMATE.start_main_~#t560~0.base_23|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_601, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_93, ULTIMATE.start_main_~#t559~0.offset=|v_ULTIMATE.start_main_~#t559~0.offset_18|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_67|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_57|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t558~0.base, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t557~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t557~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t558~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t559~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t560~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t560~0.base, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t559~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 22:03:00,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L849-1-->L851: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t558~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t558~0.base_12|) |v_ULTIMATE.start_main_~#t558~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t558~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t558~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t558~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t558~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t558~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t558~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t558~0.offset=|v_ULTIMATE.start_main_~#t558~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t558~0.base=|v_ULTIMATE.start_main_~#t558~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t558~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t558~0.base, #length] because there is no mapped edge [2019-12-07 22:03:00,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L851-1-->L853: Formula: (and (not (= |v_ULTIMATE.start_main_~#t559~0.base_12| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t559~0.base_12|)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t559~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t559~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t559~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t559~0.base_12|) |v_ULTIMATE.start_main_~#t559~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t559~0.base_12|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t559~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t559~0.base=|v_ULTIMATE.start_main_~#t559~0.base_12|, ULTIMATE.start_main_~#t559~0.offset=|v_ULTIMATE.start_main_~#t559~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t559~0.base, ULTIMATE.start_main_~#t559~0.offset] because there is no mapped edge [2019-12-07 22:03:00,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t560~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t560~0.base_13|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t560~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t560~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t560~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t560~0.base_13|) |v_ULTIMATE.start_main_~#t560~0.offset_11| 3)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t560~0.offset_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t560~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, ULTIMATE.start_main_~#t560~0.base=|v_ULTIMATE.start_main_~#t560~0.base_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~#t560~0.offset=|v_ULTIMATE.start_main_~#t560~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t560~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t560~0.offset] because there is no mapped edge [2019-12-07 22:03:00,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_216 v_~z$w_buff1_used~0_129) (= v_~z$w_buff0~0_91 v_~z$w_buff1~0_66) (= v_P3Thread1of1ForFork2_~arg.offset_32 |v_P3Thread1of1ForFork2_#in~arg.offset_34|) (= v_~z$w_buff0_used~0_215 1) (= 1 v_~z$w_buff0~0_90) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_215 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_129 256))))) 1 0)) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 0)) (= |v_P3Thread1of1ForFork2_#in~arg.base_34| v_P3Thread1of1ForFork2_~arg.base_32) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_216, ~z$w_buff0~0=v_~z$w_buff0~0_91, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_215, ~z$w_buff0~0=v_~z$w_buff0~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, ~z$w_buff1~0=v_~z$w_buff1~0_66, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_32, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 22:03:00,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L811-2-->L811-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork2_#t~ite29_Out437190920| |P3Thread1of1ForFork2_#t~ite28_Out437190920|)) (.cse0 (= (mod ~z$w_buff0_used~0_In437190920 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In437190920 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |P3Thread1of1ForFork2_#t~ite28_Out437190920| ~z$w_buff0~0_In437190920)) (and .cse1 (or .cse0 .cse2) (= ~z$w_buff1~0_In437190920 |P3Thread1of1ForFork2_#t~ite28_Out437190920|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In437190920, ~z$w_buff0~0=~z$w_buff0~0_In437190920, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In437190920, ~z$w_buff1~0=~z$w_buff1~0_In437190920} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out437190920|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out437190920|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In437190920, ~z$w_buff0~0=~z$w_buff0~0_In437190920, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In437190920, ~z$w_buff1~0=~z$w_buff1~0_In437190920} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 22:03:00,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L816-->L817: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_78} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 22:03:00,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1890983143 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out1890983143| ~z~0_In1890983143) .cse0) (and (= |P3Thread1of1ForFork2_#t~ite48_Out1890983143| ~z$mem_tmp~0_In1890983143) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1890983143, ~z$flush_delayed~0=~z$flush_delayed~0_In1890983143, ~z~0=~z~0_In1890983143} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1890983143, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1890983143|, ~z$flush_delayed~0=~z$flush_delayed~0_In1890983143, ~z~0=~z~0_In1890983143} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 22:03:00,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= v_~a~0_14 1) (= v_~x~0_22 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 22:03:00,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~x~0_15 2) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_36 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_36, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 22:03:00,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In247523838 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In247523838 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In247523838 |P3Thread1of1ForFork2_#t~ite51_Out247523838|)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out247523838|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In247523838, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In247523838} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out247523838|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In247523838, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In247523838} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 22:03:00,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In433296149 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out433296149| ~z~0_In433296149) .cse0) (and (= |P2Thread1of1ForFork1_#t~ite25_Out433296149| ~z$mem_tmp~0_In433296149) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In433296149, ~z$flush_delayed~0=~z$flush_delayed~0_In433296149, ~z~0=~z~0_In433296149} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In433296149, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out433296149|, ~z$flush_delayed~0=~z$flush_delayed~0_In433296149, ~z~0=~z~0_In433296149} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 22:03:00,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L781-2-->P2EXIT: Formula: (and (= v_~z~0_127 |v_P2Thread1of1ForFork1_#t~ite25_38|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_91) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~z~0=v_~z~0_127, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 22:03:00,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In244292929 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In244292929 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In244292929 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In244292929 256)))) (or (and (= ~z$w_buff1_used~0_In244292929 |P3Thread1of1ForFork2_#t~ite52_Out244292929|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out244292929|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In244292929, ~z$w_buff0_used~0=~z$w_buff0_used~0_In244292929, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In244292929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In244292929} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out244292929|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In244292929, ~z$w_buff0_used~0=~z$w_buff0_used~0_In244292929, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In244292929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In244292929} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 22:03:00,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L829-->L830: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_In-1936153864 ~z$r_buff0_thd4~0_Out-1936153864)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1936153864 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1936153864 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-1936153864) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1936153864, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1936153864} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1936153864|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1936153864, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1936153864} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 22:03:00,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In1308123328 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1308123328 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1308123328 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1308123328 256)))) (or (and (= ~z$r_buff1_thd4~0_In1308123328 |P3Thread1of1ForFork2_#t~ite54_Out1308123328|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out1308123328|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1308123328, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1308123328, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1308123328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1308123328} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out1308123328|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1308123328, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1308123328, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1308123328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1308123328} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 22:03:00,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L830-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_141, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 22:03:00,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_34) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 22:03:00,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L861-2-->L861-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1385234038 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1385234038 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite59_Out1385234038| |ULTIMATE.start_main_#t~ite60_Out1385234038|))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In1385234038 |ULTIMATE.start_main_#t~ite59_Out1385234038|)) (and (or .cse2 .cse1) .cse0 (= |ULTIMATE.start_main_#t~ite59_Out1385234038| ~z~0_In1385234038)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1385234038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1385234038, ~z$w_buff1~0=~z$w_buff1~0_In1385234038, ~z~0=~z~0_In1385234038} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1385234038|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1385234038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1385234038, ~z$w_buff1~0=~z$w_buff1~0_In1385234038, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1385234038|, ~z~0=~z~0_In1385234038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 22:03:00,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L862-->L862-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1688932646 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1688932646 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out1688932646|)) (and (= ~z$w_buff0_used~0_In1688932646 |ULTIMATE.start_main_#t~ite61_Out1688932646|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1688932646, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1688932646} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1688932646, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1688932646|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1688932646} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 22:03:00,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L863-->L863-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-648465828 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-648465828 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-648465828 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-648465828 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-648465828|)) (and (= |ULTIMATE.start_main_#t~ite62_Out-648465828| ~z$w_buff1_used~0_In-648465828) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-648465828, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-648465828, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-648465828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648465828} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-648465828|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-648465828, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-648465828, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-648465828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648465828} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 22:03:00,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In546309580 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In546309580 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In546309580 |ULTIMATE.start_main_#t~ite63_Out546309580|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out546309580|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In546309580, ~z$w_buff0_used~0=~z$w_buff0_used~0_In546309580} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out546309580|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In546309580, ~z$w_buff0_used~0=~z$w_buff0_used~0_In546309580} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 22:03:00,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L865-->L865-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In381839217 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In381839217 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In381839217 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In381839217 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out381839217| ~z$r_buff1_thd0~0_In381839217)) (and (= |ULTIMATE.start_main_#t~ite64_Out381839217| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In381839217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In381839217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In381839217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In381839217} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In381839217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In381839217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In381839217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In381839217, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out381839217|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 22:03:00,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_182 |v_ULTIMATE.start_main_#t~ite64_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~y~0_49 2) (= 1 v_~__unbuffered_p3_EAX~0_33) (= v_~x~0_29 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_45|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 22:03:00,708 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_012e73cd-dbfe-4935-b903-e22999059c66/bin/utaipan/witness.graphml [2019-12-07 22:03:00,708 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 22:03:00,710 INFO L168 Benchmark]: Toolchain (without parser) took 145586.69 ms. Allocated memory was 1.0 GB in the beginning and 8.4 GB in the end (delta: 7.4 GB). Free memory was 938.9 MB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2019-12-07 22:03:00,710 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 959.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:03:00,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 938.9 MB in the beginning and 1.1 GB in the end (delta: -132.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 22:03:00,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.87 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 22:03:00,710 INFO L168 Benchmark]: Boogie Preprocessor took 27.02 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 22:03:00,711 INFO L168 Benchmark]: RCFGBuilder took 450.43 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: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. [2019-12-07 22:03:00,711 INFO L168 Benchmark]: TraceAbstraction took 144598.42 ms. Allocated memory was 1.1 GB in the beginning and 8.4 GB in the end (delta: 7.3 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-12-07 22:03:00,711 INFO L168 Benchmark]: Witness Printer took 82.62 ms. Allocated memory is still 8.4 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 11.5 GB. [2019-12-07 22:03:00,713 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 959.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 938.9 MB in the beginning and 1.1 GB in the end (delta: -132.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.87 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.02 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 450.43 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: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 144598.42 ms. Allocated memory was 1.1 GB in the beginning and 8.4 GB in the end (delta: 7.3 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 82.62 ms. Allocated memory is still 8.4 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 210 ProgramPointsBefore, 115 ProgramPointsAfterwards, 253 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 50 ConcurrentYvCompositions, 28 ChoiceCompositions, 10258 VarBasedMoverChecksPositive, 419 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 389 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 146481 CheckedPairsTotal, 131 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L849] FCALL, FORK 0 pthread_create(&t557, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t558, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t559, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t560, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L800] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L801] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L802] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L803] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = (_Bool)1 [L807] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 4 z$flush_delayed = weak$$choice2 [L810] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L812] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L813] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L814] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z = z$flush_delayed ? z$mem_tmp : z [L820] 4 z$flush_delayed = (_Bool)0 [L823] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L779] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 198 locations, 2 error locations. Result: UNSAFE, OverallTime: 144.4s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 33.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4761 SDtfs, 5008 SDslu, 7278 SDs, 0 SdLazy, 2557 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381324occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 96.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 457832 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 886 NumberOfCodeBlocks, 886 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 798 ConstructedInterpolants, 0 QuantifiedInterpolants, 182250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...