./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036_pso.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_5b42673b-aeb5-45f4-b76c-9a239103f480/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/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 ed7989611a29782090ffd275937aa1df9d5fe6ef ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 16:14:01,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:14:01,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:14:01,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:14:01,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:14:01,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:14:01,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:14:01,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:14:01,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:14:01,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:14:01,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:14:01,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:14:01,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:14:01,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:14:01,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:14:01,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:14:01,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:14:01,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:14:01,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:14:01,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:14:01,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:14:01,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:14:01,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:14:01,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:14:01,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:14:01,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:14:01,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:14:01,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:14:01,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:14:01,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:14:01,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:14:01,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:14:01,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:14:01,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:14:01,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:14:01,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:14:01,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:14:01,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:14:01,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:14:01,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:14:01,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:14:01,328 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:14:01,338 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:14:01,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:14:01,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:14:01,339 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:14:01,339 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:14:01,339 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:14:01,339 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:14:01,339 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:14:01,339 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:14:01,339 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:14:01,339 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:14:01,340 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:14:01,340 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:14:01,340 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:14:01,340 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:14:01,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:14:01,340 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:14:01,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:14:01,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:14:01,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:14:01,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:14:01,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:14:01,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:14:01,341 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:14:01,341 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:14:01,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:14:01,342 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:14:01,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:14:01,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:14:01,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:14:01,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:14:01,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:14:01,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:14:01,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:14:01,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:14:01,343 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:14:01,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:14:01,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:14:01,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:14:01,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:14:01,343 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_5b42673b-aeb5-45f4-b76c-9a239103f480/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 -> ed7989611a29782090ffd275937aa1df9d5fe6ef [2019-12-07 16:14:01,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:14:01,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:14:01,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:14:01,455 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:14:01,455 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:14:01,456 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt.i [2019-12-07 16:14:01,497 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/bin/utaipan/data/12261e121/67bd22df8c784cd9a3256d35bdefdfdc/FLAGe62af63ea [2019-12-07 16:14:01,960 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:14:01,960 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/sv-benchmarks/c/pthread-wmm/mix036_pso.opt.i [2019-12-07 16:14:01,972 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/bin/utaipan/data/12261e121/67bd22df8c784cd9a3256d35bdefdfdc/FLAGe62af63ea [2019-12-07 16:14:01,981 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/bin/utaipan/data/12261e121/67bd22df8c784cd9a3256d35bdefdfdc [2019-12-07 16:14:01,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:14:01,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:14:01,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:14:01,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:14:01,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:14:01,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:14:01" (1/1) ... [2019-12-07 16:14:01,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3482028c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:01, skipping insertion in model container [2019-12-07 16:14:01,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:14:01" (1/1) ... [2019-12-07 16:14:01,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:14:02,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:14:02,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:14:02,301 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:14:02,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:14:02,402 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:14:02,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:02 WrapperNode [2019-12-07 16:14:02,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:14:02,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:14:02,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:14:02,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:14:02,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:02" (1/1) ... [2019-12-07 16:14:02,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:02" (1/1) ... [2019-12-07 16:14:02,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:14:02,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:14:02,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:14:02,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:14:02,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:02" (1/1) ... [2019-12-07 16:14:02,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:02" (1/1) ... [2019-12-07 16:14:02,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:02" (1/1) ... [2019-12-07 16:14:02,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:02" (1/1) ... [2019-12-07 16:14:02,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:02" (1/1) ... [2019-12-07 16:14:02,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:02" (1/1) ... [2019-12-07 16:14:02,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:02" (1/1) ... [2019-12-07 16:14:02,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:14:02,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:14:02,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:14:02,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:14:02,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/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 16:14:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:14:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:14:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:14:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:14:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:14:02,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:14:02,506 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:14:02,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:14:02,506 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:14:02,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:14:02,506 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 16:14:02,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 16:14:02,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:14:02,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:14:02,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:14:02,507 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 16:14:02,841 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:14:02,842 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:14:02,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:14:02 BoogieIcfgContainer [2019-12-07 16:14:02,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:14:02,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:14:02,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:14:02,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:14:02,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:14:01" (1/3) ... [2019-12-07 16:14:02,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73227d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:14:02, skipping insertion in model container [2019-12-07 16:14:02,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:02" (2/3) ... [2019-12-07 16:14:02,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73227d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:14:02, skipping insertion in model container [2019-12-07 16:14:02,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:14:02" (3/3) ... [2019-12-07 16:14:02,848 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt.i [2019-12-07 16:14:02,854 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:14:02,854 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:14:02,859 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:14:02,860 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:14:02,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,887 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,887 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,888 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,888 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,889 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,890 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,900 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,900 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,900 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,901 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,901 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:02,916 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 16:14:02,928 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:14:02,928 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:14:02,929 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:14:02,929 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:14:02,929 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:14:02,929 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:14:02,929 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:14:02,929 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:14:02,939 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 193 transitions [2019-12-07 16:14:02,941 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-07 16:14:02,992 INFO L134 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-07 16:14:02,992 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:14:03,000 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 579 event pairs. 12/164 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 16:14:03,012 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-07 16:14:03,037 INFO L134 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-07 16:14:03,037 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:14:03,041 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 579 event pairs. 12/164 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 16:14:03,053 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 16:14:03,053 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:14:05,993 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-07 16:14:06,219 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-07 16:14:06,337 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48496 [2019-12-07 16:14:06,337 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-07 16:14:06,339 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 87 transitions [2019-12-07 16:14:07,606 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26302 states. [2019-12-07 16:14:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 26302 states. [2019-12-07 16:14:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:14:07,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:07,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:14:07,613 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 16:14:07,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:07,617 INFO L82 PathProgramCache]: Analyzing trace with hash -887935004, now seen corresponding path program 1 times [2019-12-07 16:14:07,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:07,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915255114] [2019-12-07 16:14:07,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:07,775 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 16:14:07,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915255114] [2019-12-07 16:14:07,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:07,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:14:07,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572278876] [2019-12-07 16:14:07,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:07,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:07,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:07,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:07,791 INFO L87 Difference]: Start difference. First operand 26302 states. Second operand 3 states. [2019-12-07 16:14:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:08,111 INFO L93 Difference]: Finished difference Result 25630 states and 112008 transitions. [2019-12-07 16:14:08,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:08,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 16:14:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:08,278 INFO L225 Difference]: With dead ends: 25630 [2019-12-07 16:14:08,278 INFO L226 Difference]: Without dead ends: 24142 [2019-12-07 16:14:08,279 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 16:14:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24142 states. [2019-12-07 16:14:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24142 to 24142. [2019-12-07 16:14:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24142 states. [2019-12-07 16:14:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24142 states to 24142 states and 105356 transitions. [2019-12-07 16:14:09,150 INFO L78 Accepts]: Start accepts. Automaton has 24142 states and 105356 transitions. Word has length 9 [2019-12-07 16:14:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:09,151 INFO L462 AbstractCegarLoop]: Abstraction has 24142 states and 105356 transitions. [2019-12-07 16:14:09,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 24142 states and 105356 transitions. [2019-12-07 16:14:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:14:09,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:09,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:14:09,158 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 16:14:09,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:09,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1247749362, now seen corresponding path program 1 times [2019-12-07 16:14:09,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:09,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718653751] [2019-12-07 16:14:09,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:09,218 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 16:14:09,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718653751] [2019-12-07 16:14:09,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:09,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:14:09,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118678430] [2019-12-07 16:14:09,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:14:09,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:09,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:14:09,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:14:09,221 INFO L87 Difference]: Start difference. First operand 24142 states and 105356 transitions. Second operand 4 states. [2019-12-07 16:14:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:09,564 INFO L93 Difference]: Finished difference Result 36454 states and 153868 transitions. [2019-12-07 16:14:09,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:14:09,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 16:14:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:09,764 INFO L225 Difference]: With dead ends: 36454 [2019-12-07 16:14:09,764 INFO L226 Difference]: Without dead ends: 36394 [2019-12-07 16:14:09,765 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 16:14:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36394 states. [2019-12-07 16:14:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36394 to 33062. [2019-12-07 16:14:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-07 16:14:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 141336 transitions. [2019-12-07 16:14:10,644 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 141336 transitions. Word has length 15 [2019-12-07 16:14:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:10,645 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 141336 transitions. [2019-12-07 16:14:10,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:14:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 141336 transitions. [2019-12-07 16:14:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:14:10,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:10,650 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 16:14:10,650 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 16:14:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:10,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1635073164, now seen corresponding path program 1 times [2019-12-07 16:14:10,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:10,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101840713] [2019-12-07 16:14:10,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:10,684 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 16:14:10,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101840713] [2019-12-07 16:14:10,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:10,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:10,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147011132] [2019-12-07 16:14:10,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:10,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:10,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:10,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:10,685 INFO L87 Difference]: Start difference. First operand 33062 states and 141336 transitions. Second operand 3 states. [2019-12-07 16:14:10,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:10,868 INFO L93 Difference]: Finished difference Result 41522 states and 174636 transitions. [2019-12-07 16:14:10,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:10,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:14:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:10,965 INFO L225 Difference]: With dead ends: 41522 [2019-12-07 16:14:10,965 INFO L226 Difference]: Without dead ends: 41522 [2019-12-07 16:14:10,965 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 16:14:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41522 states. [2019-12-07 16:14:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41522 to 35834. [2019-12-07 16:14:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35834 states. [2019-12-07 16:14:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35834 states to 35834 states and 152544 transitions. [2019-12-07 16:14:11,867 INFO L78 Accepts]: Start accepts. Automaton has 35834 states and 152544 transitions. Word has length 18 [2019-12-07 16:14:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:11,868 INFO L462 AbstractCegarLoop]: Abstraction has 35834 states and 152544 transitions. [2019-12-07 16:14:11,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 35834 states and 152544 transitions. [2019-12-07 16:14:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:14:11,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:11,874 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 16:14:11,874 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 16:14:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:11,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1634952543, now seen corresponding path program 1 times [2019-12-07 16:14:11,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:11,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084090266] [2019-12-07 16:14:11,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:11,925 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 16:14:11,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084090266] [2019-12-07 16:14:11,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:11,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:14:11,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478933083] [2019-12-07 16:14:11,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:14:11,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:11,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:14:11,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:14:11,926 INFO L87 Difference]: Start difference. First operand 35834 states and 152544 transitions. Second operand 4 states. [2019-12-07 16:14:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:12,314 INFO L93 Difference]: Finished difference Result 43266 states and 181176 transitions. [2019-12-07 16:14:12,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:14:12,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 16:14:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:12,409 INFO L225 Difference]: With dead ends: 43266 [2019-12-07 16:14:12,410 INFO L226 Difference]: Without dead ends: 43226 [2019-12-07 16:14:12,410 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 16:14:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43226 states. [2019-12-07 16:14:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43226 to 37670. [2019-12-07 16:14:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37670 states. [2019-12-07 16:14:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37670 states to 37670 states and 159820 transitions. [2019-12-07 16:14:13,392 INFO L78 Accepts]: Start accepts. Automaton has 37670 states and 159820 transitions. Word has length 18 [2019-12-07 16:14:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:13,393 INFO L462 AbstractCegarLoop]: Abstraction has 37670 states and 159820 transitions. [2019-12-07 16:14:13,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:14:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 37670 states and 159820 transitions. [2019-12-07 16:14:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:14:13,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:13,398 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 16:14:13,398 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 16:14:13,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:13,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1770652005, now seen corresponding path program 1 times [2019-12-07 16:14:13,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:13,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229165435] [2019-12-07 16:14:13,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:13,444 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 16:14:13,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229165435] [2019-12-07 16:14:13,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:13,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:14:13,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026246153] [2019-12-07 16:14:13,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:14:13,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:13,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:14:13,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:14:13,446 INFO L87 Difference]: Start difference. First operand 37670 states and 159820 transitions. Second operand 4 states. [2019-12-07 16:14:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:13,749 INFO L93 Difference]: Finished difference Result 47658 states and 200116 transitions. [2019-12-07 16:14:13,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:14:13,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 16:14:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:13,854 INFO L225 Difference]: With dead ends: 47658 [2019-12-07 16:14:13,854 INFO L226 Difference]: Without dead ends: 47598 [2019-12-07 16:14:13,855 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 16:14:14,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47598 states. [2019-12-07 16:14:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47598 to 39262. [2019-12-07 16:14:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39262 states. [2019-12-07 16:14:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39262 states to 39262 states and 166916 transitions. [2019-12-07 16:14:15,783 INFO L78 Accepts]: Start accepts. Automaton has 39262 states and 166916 transitions. Word has length 18 [2019-12-07 16:14:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:15,783 INFO L462 AbstractCegarLoop]: Abstraction has 39262 states and 166916 transitions. [2019-12-07 16:14:15,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:14:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 39262 states and 166916 transitions. [2019-12-07 16:14:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:14:15,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:15,791 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 16:14:15,791 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 16:14:15,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1431333081, now seen corresponding path program 1 times [2019-12-07 16:14:15,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:15,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292068481] [2019-12-07 16:14:15,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:15,824 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 16:14:15,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292068481] [2019-12-07 16:14:15,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:15,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:14:15,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470539343] [2019-12-07 16:14:15,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:15,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:15,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:15,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:15,825 INFO L87 Difference]: Start difference. First operand 39262 states and 166916 transitions. Second operand 3 states. [2019-12-07 16:14:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:15,973 INFO L93 Difference]: Finished difference Result 37206 states and 156212 transitions. [2019-12-07 16:14:15,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:15,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:14:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:16,054 INFO L225 Difference]: With dead ends: 37206 [2019-12-07 16:14:16,055 INFO L226 Difference]: Without dead ends: 37206 [2019-12-07 16:14:16,055 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 16:14:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37206 states. [2019-12-07 16:14:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37206 to 36326. [2019-12-07 16:14:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36326 states. [2019-12-07 16:14:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36326 states to 36326 states and 152780 transitions. [2019-12-07 16:14:16,775 INFO L78 Accepts]: Start accepts. Automaton has 36326 states and 152780 transitions. Word has length 20 [2019-12-07 16:14:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:16,776 INFO L462 AbstractCegarLoop]: Abstraction has 36326 states and 152780 transitions. [2019-12-07 16:14:16,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 36326 states and 152780 transitions. [2019-12-07 16:14:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:14:16,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:16,782 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 16:14:16,782 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 16:14:16,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1560525539, now seen corresponding path program 1 times [2019-12-07 16:14:16,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:16,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626835734] [2019-12-07 16:14:16,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:16,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 16:14:16,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626835734] [2019-12-07 16:14:16,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:16,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:14:16,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69687343] [2019-12-07 16:14:16,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:16,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:16,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:16,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:16,817 INFO L87 Difference]: Start difference. First operand 36326 states and 152780 transitions. Second operand 3 states. [2019-12-07 16:14:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:17,083 INFO L93 Difference]: Finished difference Result 35770 states and 150420 transitions. [2019-12-07 16:14:17,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:17,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:14:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:17,161 INFO L225 Difference]: With dead ends: 35770 [2019-12-07 16:14:17,161 INFO L226 Difference]: Without dead ends: 35770 [2019-12-07 16:14:17,162 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 16:14:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35770 states. [2019-12-07 16:14:17,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35770 to 35770. [2019-12-07 16:14:17,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35770 states. [2019-12-07 16:14:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35770 states to 35770 states and 150420 transitions. [2019-12-07 16:14:17,854 INFO L78 Accepts]: Start accepts. Automaton has 35770 states and 150420 transitions. Word has length 20 [2019-12-07 16:14:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:17,855 INFO L462 AbstractCegarLoop]: Abstraction has 35770 states and 150420 transitions. [2019-12-07 16:14:17,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 35770 states and 150420 transitions. [2019-12-07 16:14:17,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:14:17,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:17,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] [2019-12-07 16:14:17,865 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 16:14:17,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:17,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1345365099, now seen corresponding path program 1 times [2019-12-07 16:14:17,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:17,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612246342] [2019-12-07 16:14:17,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:17,898 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 16:14:17,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612246342] [2019-12-07 16:14:17,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:17,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:14:17,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613088756] [2019-12-07 16:14:17,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:17,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:17,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:17,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:17,899 INFO L87 Difference]: Start difference. First operand 35770 states and 150420 transitions. Second operand 3 states. [2019-12-07 16:14:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:18,011 INFO L93 Difference]: Finished difference Result 28238 states and 110065 transitions. [2019-12-07 16:14:18,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:18,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 16:14:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:18,068 INFO L225 Difference]: With dead ends: 28238 [2019-12-07 16:14:18,068 INFO L226 Difference]: Without dead ends: 28238 [2019-12-07 16:14:18,069 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 16:14:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28238 states. [2019-12-07 16:14:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28238 to 28238. [2019-12-07 16:14:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28238 states. [2019-12-07 16:14:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28238 states to 28238 states and 110065 transitions. [2019-12-07 16:14:18,597 INFO L78 Accepts]: Start accepts. Automaton has 28238 states and 110065 transitions. Word has length 22 [2019-12-07 16:14:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:18,597 INFO L462 AbstractCegarLoop]: Abstraction has 28238 states and 110065 transitions. [2019-12-07 16:14:18,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 28238 states and 110065 transitions. [2019-12-07 16:14:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:14:18,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:18,606 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] [2019-12-07 16:14:18,606 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 16:14:18,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:18,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1477949356, now seen corresponding path program 1 times [2019-12-07 16:14:18,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:18,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488101383] [2019-12-07 16:14:18,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:18,642 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 16:14:18,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488101383] [2019-12-07 16:14:18,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:18,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:18,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219548928] [2019-12-07 16:14:18,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:14:18,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:18,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:14:18,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:14:18,644 INFO L87 Difference]: Start difference. First operand 28238 states and 110065 transitions. Second operand 4 states. [2019-12-07 16:14:18,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:18,695 INFO L93 Difference]: Finished difference Result 12386 states and 40891 transitions. [2019-12-07 16:14:18,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:14:18,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 16:14:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:18,712 INFO L225 Difference]: With dead ends: 12386 [2019-12-07 16:14:18,712 INFO L226 Difference]: Without dead ends: 12386 [2019-12-07 16:14:18,712 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 16:14:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2019-12-07 16:14:18,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12386. [2019-12-07 16:14:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12386 states. [2019-12-07 16:14:18,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 40891 transitions. [2019-12-07 16:14:18,983 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 40891 transitions. Word has length 23 [2019-12-07 16:14:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:18,984 INFO L462 AbstractCegarLoop]: Abstraction has 12386 states and 40891 transitions. [2019-12-07 16:14:18,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:14:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 40891 transitions. [2019-12-07 16:14:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:14:18,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:18,989 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:14:18,989 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 16:14:18,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:18,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1240332056, now seen corresponding path program 1 times [2019-12-07 16:14:18,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:18,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870614943] [2019-12-07 16:14:18,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:19,045 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 16:14:19,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870614943] [2019-12-07 16:14:19,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:19,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:19,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679476774] [2019-12-07 16:14:19,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:14:19,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:19,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:14:19,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:14:19,046 INFO L87 Difference]: Start difference. First operand 12386 states and 40891 transitions. Second operand 4 states. [2019-12-07 16:14:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:19,129 INFO L93 Difference]: Finished difference Result 18927 states and 62433 transitions. [2019-12-07 16:14:19,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:14:19,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 16:14:19,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:19,153 INFO L225 Difference]: With dead ends: 18927 [2019-12-07 16:14:19,153 INFO L226 Difference]: Without dead ends: 18211 [2019-12-07 16:14:19,154 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 16:14:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18211 states. [2019-12-07 16:14:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18211 to 18203. [2019-12-07 16:14:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18203 states. [2019-12-07 16:14:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18203 states to 18203 states and 60116 transitions. [2019-12-07 16:14:19,411 INFO L78 Accepts]: Start accepts. Automaton has 18203 states and 60116 transitions. Word has length 24 [2019-12-07 16:14:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:19,411 INFO L462 AbstractCegarLoop]: Abstraction has 18203 states and 60116 transitions. [2019-12-07 16:14:19,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:14:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 18203 states and 60116 transitions. [2019-12-07 16:14:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:14:19,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:19,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:14:19,418 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 16:14:19,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:19,418 INFO L82 PathProgramCache]: Analyzing trace with hash -871587162, now seen corresponding path program 2 times [2019-12-07 16:14:19,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:19,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125072879] [2019-12-07 16:14:19,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:19,466 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 16:14:19,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125072879] [2019-12-07 16:14:19,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:19,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:14:19,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104314429] [2019-12-07 16:14:19,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:14:19,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:19,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:14:19,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:14:19,467 INFO L87 Difference]: Start difference. First operand 18203 states and 60116 transitions. Second operand 5 states. [2019-12-07 16:14:19,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:19,568 INFO L93 Difference]: Finished difference Result 24077 states and 79335 transitions. [2019-12-07 16:14:19,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:14:19,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 16:14:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:19,581 INFO L225 Difference]: With dead ends: 24077 [2019-12-07 16:14:19,581 INFO L226 Difference]: Without dead ends: 9927 [2019-12-07 16:14:19,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:14:19,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9927 states. [2019-12-07 16:14:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9927 to 9919. [2019-12-07 16:14:19,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9919 states. [2019-12-07 16:14:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9919 states to 9919 states and 32721 transitions. [2019-12-07 16:14:19,725 INFO L78 Accepts]: Start accepts. Automaton has 9919 states and 32721 transitions. Word has length 24 [2019-12-07 16:14:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:19,726 INFO L462 AbstractCegarLoop]: Abstraction has 9919 states and 32721 transitions. [2019-12-07 16:14:19,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:14:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 9919 states and 32721 transitions. [2019-12-07 16:14:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:14:19,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:19,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:14:19,729 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 16:14:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:19,730 INFO L82 PathProgramCache]: Analyzing trace with hash -665452260, now seen corresponding path program 3 times [2019-12-07 16:14:19,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:19,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131527117] [2019-12-07 16:14:19,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:19,764 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 16:14:19,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131527117] [2019-12-07 16:14:19,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:19,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:14:19,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439064644] [2019-12-07 16:14:19,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:14:19,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:19,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:14:19,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:14:19,765 INFO L87 Difference]: Start difference. First operand 9919 states and 32721 transitions. Second operand 5 states. [2019-12-07 16:14:19,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:19,794 INFO L93 Difference]: Finished difference Result 3118 states and 9484 transitions. [2019-12-07 16:14:19,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:14:19,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 16:14:19,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:19,797 INFO L225 Difference]: With dead ends: 3118 [2019-12-07 16:14:19,797 INFO L226 Difference]: Without dead ends: 3118 [2019-12-07 16:14:19,797 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 16:14:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3118 states. [2019-12-07 16:14:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3118 to 3118. [2019-12-07 16:14:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2019-12-07 16:14:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 9484 transitions. [2019-12-07 16:14:19,830 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 9484 transitions. Word has length 24 [2019-12-07 16:14:19,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:19,830 INFO L462 AbstractCegarLoop]: Abstraction has 3118 states and 9484 transitions. [2019-12-07 16:14:19,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:14:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 9484 transitions. [2019-12-07 16:14:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 16:14:19,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:19,833 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] [2019-12-07 16:14:19,833 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 16:14:19,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash 808807491, now seen corresponding path program 1 times [2019-12-07 16:14:19,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:19,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423146360] [2019-12-07 16:14:19,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:19,867 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 16:14:19,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423146360] [2019-12-07 16:14:19,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:19,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:19,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142775732] [2019-12-07 16:14:19,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:14:19,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:19,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:14:19,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:14:19,868 INFO L87 Difference]: Start difference. First operand 3118 states and 9484 transitions. Second operand 5 states. [2019-12-07 16:14:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:19,980 INFO L93 Difference]: Finished difference Result 4115 states and 12094 transitions. [2019-12-07 16:14:19,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:14:19,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-07 16:14:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:19,984 INFO L225 Difference]: With dead ends: 4115 [2019-12-07 16:14:19,984 INFO L226 Difference]: Without dead ends: 4019 [2019-12-07 16:14:19,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:14:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2019-12-07 16:14:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 3214. [2019-12-07 16:14:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3214 states. [2019-12-07 16:14:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 9712 transitions. [2019-12-07 16:14:20,021 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 9712 transitions. Word has length 32 [2019-12-07 16:14:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:20,021 INFO L462 AbstractCegarLoop]: Abstraction has 3214 states and 9712 transitions. [2019-12-07 16:14:20,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:14:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 9712 transitions. [2019-12-07 16:14:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 16:14:20,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:20,024 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] [2019-12-07 16:14:20,024 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 16:14:20,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:20,025 INFO L82 PathProgramCache]: Analyzing trace with hash 911486793, now seen corresponding path program 1 times [2019-12-07 16:14:20,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:20,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776393298] [2019-12-07 16:14:20,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:20,043 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 16:14:20,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776393298] [2019-12-07 16:14:20,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:20,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:20,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971417378] [2019-12-07 16:14:20,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:20,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:20,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:20,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:20,044 INFO L87 Difference]: Start difference. First operand 3214 states and 9712 transitions. Second operand 3 states. [2019-12-07 16:14:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:20,076 INFO L93 Difference]: Finished difference Result 3720 states and 10667 transitions. [2019-12-07 16:14:20,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:20,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 16:14:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:20,080 INFO L225 Difference]: With dead ends: 3720 [2019-12-07 16:14:20,080 INFO L226 Difference]: Without dead ends: 3720 [2019-12-07 16:14:20,080 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 16:14:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3720 states. [2019-12-07 16:14:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3720 to 3200. [2019-12-07 16:14:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3200 states. [2019-12-07 16:14:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 9279 transitions. [2019-12-07 16:14:20,114 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 9279 transitions. Word has length 32 [2019-12-07 16:14:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:20,114 INFO L462 AbstractCegarLoop]: Abstraction has 3200 states and 9279 transitions. [2019-12-07 16:14:20,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 9279 transitions. [2019-12-07 16:14:20,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:14:20,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:20,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] [2019-12-07 16:14:20,117 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 16:14:20,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:20,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1231778147, now seen corresponding path program 1 times [2019-12-07 16:14:20,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:20,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116159209] [2019-12-07 16:14:20,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:20,154 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 16:14:20,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116159209] [2019-12-07 16:14:20,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:20,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:20,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149497787] [2019-12-07 16:14:20,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:14:20,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:20,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:14:20,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:14:20,155 INFO L87 Difference]: Start difference. First operand 3200 states and 9279 transitions. Second operand 5 states. [2019-12-07 16:14:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:20,288 INFO L93 Difference]: Finished difference Result 3781 states and 10752 transitions. [2019-12-07 16:14:20,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:14:20,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 16:14:20,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:20,291 INFO L225 Difference]: With dead ends: 3781 [2019-12-07 16:14:20,291 INFO L226 Difference]: Without dead ends: 3637 [2019-12-07 16:14:20,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:14:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2019-12-07 16:14:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 2989. [2019-12-07 16:14:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-07 16:14:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8690 transitions. [2019-12-07 16:14:20,324 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8690 transitions. Word has length 33 [2019-12-07 16:14:20,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:20,324 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8690 transitions. [2019-12-07 16:14:20,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:14:20,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8690 transitions. [2019-12-07 16:14:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:14:20,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:20,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:14:20,328 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 16:14:20,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:20,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1430651403, now seen corresponding path program 1 times [2019-12-07 16:14:20,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:20,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841171487] [2019-12-07 16:14:20,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:20,361 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 16:14:20,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841171487] [2019-12-07 16:14:20,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:20,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:14:20,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019028721] [2019-12-07 16:14:20,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:14:20,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:20,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:14:20,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:14:20,362 INFO L87 Difference]: Start difference. First operand 2989 states and 8690 transitions. Second operand 6 states. [2019-12-07 16:14:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:20,399 INFO L93 Difference]: Finished difference Result 2192 states and 6796 transitions. [2019-12-07 16:14:20,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:14:20,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 16:14:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:20,402 INFO L225 Difference]: With dead ends: 2192 [2019-12-07 16:14:20,402 INFO L226 Difference]: Without dead ends: 2192 [2019-12-07 16:14:20,402 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 16:14:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-12-07 16:14:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2192. [2019-12-07 16:14:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-07 16:14:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 6796 transitions. [2019-12-07 16:14:20,426 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 6796 transitions. Word has length 33 [2019-12-07 16:14:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:20,426 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 6796 transitions. [2019-12-07 16:14:20,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:14:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 6796 transitions. [2019-12-07 16:14:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 16:14:20,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:20,429 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 16:14:20,429 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 16:14:20,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:20,429 INFO L82 PathProgramCache]: Analyzing trace with hash -229481117, now seen corresponding path program 1 times [2019-12-07 16:14:20,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:20,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017015894] [2019-12-07 16:14:20,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:20,593 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 16:14:20,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017015894] [2019-12-07 16:14:20,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:20,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 16:14:20,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205031365] [2019-12-07 16:14:20,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:14:20,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:20,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:14:20,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:14:20,595 INFO L87 Difference]: Start difference. First operand 2192 states and 6796 transitions. Second operand 11 states. [2019-12-07 16:14:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:21,355 INFO L93 Difference]: Finished difference Result 4639 states and 12982 transitions. [2019-12-07 16:14:21,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 16:14:21,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-12-07 16:14:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:21,357 INFO L225 Difference]: With dead ends: 4639 [2019-12-07 16:14:21,357 INFO L226 Difference]: Without dead ends: 1583 [2019-12-07 16:14:21,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:14:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2019-12-07 16:14:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1583. [2019-12-07 16:14:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2019-12-07 16:14:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 4391 transitions. [2019-12-07 16:14:21,372 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 4391 transitions. Word has length 48 [2019-12-07 16:14:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:21,372 INFO L462 AbstractCegarLoop]: Abstraction has 1583 states and 4391 transitions. [2019-12-07 16:14:21,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:14:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 4391 transitions. [2019-12-07 16:14:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 16:14:21,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:21,374 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 16:14:21,374 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 16:14:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1173728045, now seen corresponding path program 2 times [2019-12-07 16:14:21,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:21,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010943331] [2019-12-07 16:14:21,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:21,527 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 16:14:21,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010943331] [2019-12-07 16:14:21,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:21,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 16:14:21,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140910892] [2019-12-07 16:14:21,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:14:21,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:14:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:14:21,528 INFO L87 Difference]: Start difference. First operand 1583 states and 4391 transitions. Second operand 11 states. [2019-12-07 16:14:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:22,337 INFO L93 Difference]: Finished difference Result 4669 states and 12791 transitions. [2019-12-07 16:14:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 16:14:22,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-12-07 16:14:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:22,338 INFO L225 Difference]: With dead ends: 4669 [2019-12-07 16:14:22,338 INFO L226 Difference]: Without dead ends: 452 [2019-12-07 16:14:22,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:14:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-07 16:14:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2019-12-07 16:14:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-12-07 16:14:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 981 transitions. [2019-12-07 16:14:22,342 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 981 transitions. Word has length 48 [2019-12-07 16:14:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:22,342 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 981 transitions. [2019-12-07 16:14:22,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:14:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 981 transitions. [2019-12-07 16:14:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 16:14:22,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:22,343 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 16:14:22,344 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 16:14:22,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:22,344 INFO L82 PathProgramCache]: Analyzing trace with hash -954630289, now seen corresponding path program 3 times [2019-12-07 16:14:22,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:22,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711482251] [2019-12-07 16:14:22,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:22,423 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 16:14:22,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711482251] [2019-12-07 16:14:22,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:22,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:14:22,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197355437] [2019-12-07 16:14:22,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:14:22,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:22,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:14:22,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:14:22,424 INFO L87 Difference]: Start difference. First operand 452 states and 981 transitions. Second operand 7 states. [2019-12-07 16:14:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:22,552 INFO L93 Difference]: Finished difference Result 862 states and 1827 transitions. [2019-12-07 16:14:22,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:14:22,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 16:14:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:22,553 INFO L225 Difference]: With dead ends: 862 [2019-12-07 16:14:22,553 INFO L226 Difference]: Without dead ends: 576 [2019-12-07 16:14:22,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:14:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-07 16:14:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 518. [2019-12-07 16:14:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-12-07 16:14:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1090 transitions. [2019-12-07 16:14:22,558 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1090 transitions. Word has length 48 [2019-12-07 16:14:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:22,558 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 1090 transitions. [2019-12-07 16:14:22,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:14:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1090 transitions. [2019-12-07 16:14:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 16:14:22,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:22,559 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 16:14:22,559 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 16:14:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:22,559 INFO L82 PathProgramCache]: Analyzing trace with hash 477153033, now seen corresponding path program 4 times [2019-12-07 16:14:22,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:22,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565872691] [2019-12-07 16:14:22,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:14:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:14:22,630 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:14:22,630 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:14:22,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_99| 0 0))) (and (< 0 |v_#StackHeapBarrier_23|) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~z$r_buff0_thd3~0_325) (= 0 v_~z$r_buff0_thd4~0_238) (= v_~weak$$choice2~0_127 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= 0 |v_ULTIMATE.start_main_~#t949~0.offset_29|) (= v_~z$w_buff0~0_307 0) (= v_~__unbuffered_p3_EAX~0_136 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_136) (= |v_#valid_97| (store .cse0 |v_ULTIMATE.start_main_~#t949~0.base_44| 1)) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_179 0) (= 0 v_~z$r_buff1_thd4~0_175) (= v_~z$w_buff0_used~0_604 0) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t949~0.base_44|) 0) (= v_~z~0_135 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~weak$$choice0~0_20) (= v_~z$w_buff1~0_205 0) (= v_~z$r_buff1_thd1~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_119 0) (= v_~b~0_92 0) (= v_~z$r_buff0_thd2~0_73 0) (= v_~z$r_buff0_thd1~0_73 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t949~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t949~0.base_44|) |v_ULTIMATE.start_main_~#t949~0.offset_29| 0)) |v_#memory_int_29|) (= v_~a~0_119 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_37 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t949~0.base_44| 4)) (= v_~z$w_buff1_used~0_405 0) (= 0 v_~z$flush_delayed~0_40) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd3~0_260) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_31 0) (= v_~__unbuffered_cnt~0_126 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t949~0.base_44|) (= v_~z$mem_tmp~0_21 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_39|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_119, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_119, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_26|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_238, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_136, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_~#t949~0.offset=|v_ULTIMATE.start_main_~#t949~0.offset_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t949~0.base=|v_ULTIMATE.start_main_~#t949~0.base_44|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_85|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_405, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_43|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_26|, ~z$flush_delayed~0=v_~z$flush_delayed~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_119, ~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_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_37, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_175, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_20|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_179, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_604, ~z$w_buff0~0=v_~z$w_buff0~0_307, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_260, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_59|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_136, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_39|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_63|, ~b~0=v_~b~0_92, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_127, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t951~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t949~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t949~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t950~0.offset, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t952~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t952~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t951~0.base, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, 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 16:14:22,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L845-1-->L847: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t950~0.base_12| 4)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12|)) (= |v_ULTIMATE.start_main_~#t950~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t950~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t950~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12|) |v_ULTIMATE.start_main_~#t950~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_12|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t950~0.offset] because there is no mapped edge [2019-12-07 16:14:22,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L847-1-->L849: Formula: (and (= (store |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13| 1) |v_#valid_54|) (= 0 (select |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13|)) (= |v_ULTIMATE.start_main_~#t951~0.offset_11| 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13|) |v_ULTIMATE.start_main_~#t951~0.offset_11| 2))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t951~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t951~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t951~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_11|, #length=|v_#length_23|, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t951~0.offset, #length, ULTIMATE.start_main_~#t951~0.base] because there is no mapped edge [2019-12-07 16:14:22,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L849-1-->L851: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t952~0.base_10| 4)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10|) |v_ULTIMATE.start_main_~#t952~0.offset_9| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t952~0.base_10|) (= |v_ULTIMATE.start_main_~#t952~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t952~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t952~0.base, #length, ULTIMATE.start_main_~#t952~0.offset] because there is no mapped edge [2019-12-07 16:14:22,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L4-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_24 v_~z$r_buff1_thd4~0_12) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14 0)) (= 1 v_~a~0_5) (= v_~__unbuffered_p3_EBX~0_6 v_~b~0_6) (= v_~z$r_buff1_thd1~0_5 v_~z$r_buff0_thd1~0_6) (= v_~z$r_buff0_thd0~0_23 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff1_thd2~0_5 v_~z$r_buff0_thd2~0_6) (= v_~__unbuffered_p3_EAX~0_7 v_~a~0_5) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd4~0_23 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14, ~b~0=v_~b~0_6, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~a~0=v_~a~0_5, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~b~0=v_~b~0_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_5, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_23, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 16:14:22,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_27) (= v_~b~0_68 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~b~0=v_~b~0_68, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 16:14:22,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_19) (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~x~0_30 1) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_15| v_P1Thread1of1ForFork0_~arg.offset_13) (= v_P1Thread1of1ForFork0_~arg.base_13 |v_P1Thread1of1ForFork0_#in~arg.base_15|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_13, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_25, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 16:14:22,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L780-->L780-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1426966662 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1426966662 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In-1426966662 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In-1426966662 256) 0) (and (= (mod ~z$w_buff1_used~0_In-1426966662 256) 0) .cse0))) .cse1 (= |P2Thread1of1ForFork1_#t~ite9_Out-1426966662| |P2Thread1of1ForFork1_#t~ite8_Out-1426966662|) (= ~z$w_buff0~0_In-1426966662 |P2Thread1of1ForFork1_#t~ite8_Out-1426966662|)) (and (= ~z$w_buff0~0_In-1426966662 |P2Thread1of1ForFork1_#t~ite9_Out-1426966662|) (= |P2Thread1of1ForFork1_#t~ite8_In-1426966662| |P2Thread1of1ForFork1_#t~ite8_Out-1426966662|) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1426966662, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426966662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1426966662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426966662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1426966662, ~weak$$choice2~0=~weak$$choice2~0_In-1426966662, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-1426966662|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1426966662, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426966662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1426966662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426966662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1426966662, ~weak$$choice2~0=~weak$$choice2~0_In-1426966662, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-1426966662|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1426966662|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 16:14:22,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L784-->L785: Formula: (and (= v_~z$r_buff0_thd3~0_131 v_~z$r_buff0_thd3~0_130) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_10|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_6|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_38, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 16:14:22,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L787-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~z~0_40 v_~z$mem_tmp~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 16:14:22,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-294615920 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-294615920 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-294615920|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-294615920 |P3Thread1of1ForFork2_#t~ite28_Out-294615920|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-294615920, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-294615920} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-294615920|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-294615920, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-294615920} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 16:14:22,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In659570250 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In659570250 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In659570250 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In659570250 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out659570250|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In659570250 |P3Thread1of1ForFork2_#t~ite29_Out659570250|) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In659570250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In659570250, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In659570250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In659570250} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out659570250|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In659570250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In659570250, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In659570250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In659570250} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 16:14:22,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L825-->L826: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_In-107473633 ~z$r_buff0_thd4~0_Out-107473633)) (.cse0 (= (mod ~z$w_buff0_used~0_In-107473633 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-107473633 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out-107473633) (not .cse0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-107473633, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-107473633} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-107473633, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-107473633, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-107473633|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 16:14:22,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1567606551 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1567606551 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In1567606551 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1567606551 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out1567606551| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite31_Out1567606551| ~z$r_buff1_thd4~0_In1567606551)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1567606551, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567606551, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1567606551, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1567606551} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1567606551, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567606551, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1567606551, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1567606551, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1567606551|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 16:14:22,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_61) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_61, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 16:14:22,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L851-1-->L857: 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_50) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:14:22,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L857-2-->L857-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1903442575 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1903442575 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1903442575 |ULTIMATE.start_main_#t~ite36_Out1903442575|)) (and (not .cse1) (= ~z$w_buff1~0_In1903442575 |ULTIMATE.start_main_#t~ite36_Out1903442575|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1903442575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1903442575, ~z$w_buff1~0=~z$w_buff1~0_In1903442575, ~z~0=~z~0_In1903442575} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1903442575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1903442575, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1903442575|, ~z$w_buff1~0=~z$w_buff1~0_In1903442575, ~z~0=~z~0_In1903442575} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 16:14:22,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L857-4-->L858: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite36_15|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_6|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 16:14:22,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-712468996 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-712468996 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-712468996| ~z$w_buff0_used~0_In-712468996) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-712468996| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-712468996, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-712468996} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-712468996, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-712468996, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-712468996|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:14:22,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L859-->L859-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-831523246 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-831523246 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-831523246 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-831523246 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-831523246 |ULTIMATE.start_main_#t~ite39_Out-831523246|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-831523246|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-831523246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-831523246, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-831523246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-831523246} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-831523246, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-831523246|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-831523246, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-831523246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-831523246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:14:22,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L860-->L860-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1875035666 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1875035666 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1875035666| ~z$r_buff0_thd0~0_In1875035666) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out1875035666|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1875035666, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1875035666} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1875035666, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1875035666|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1875035666} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 16:14:22,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L861-->L861-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-2124624543 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2124624543 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-2124624543 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2124624543 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-2124624543| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In-2124624543 |ULTIMATE.start_main_#t~ite41_Out-2124624543|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2124624543, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2124624543, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2124624543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2124624543} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2124624543|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2124624543, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2124624543, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2124624543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2124624543} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 16:14:22,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= v_~z$r_buff1_thd0~0_157 |v_ULTIMATE.start_main_#t~ite41_37|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_117) (= v_~__unbuffered_p3_EAX~0_117 1) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_34) (= 0 v_~__unbuffered_p1_EAX~0_26))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_157, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:14:22,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:14:22 BasicIcfg [2019-12-07 16:14:22,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:14:22,712 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:14:22,712 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:14:22,712 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:14:22,713 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:14:02" (3/4) ... [2019-12-07 16:14:22,714 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:14:22,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_99| 0 0))) (and (< 0 |v_#StackHeapBarrier_23|) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~z$r_buff0_thd3~0_325) (= 0 v_~z$r_buff0_thd4~0_238) (= v_~weak$$choice2~0_127 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= 0 |v_ULTIMATE.start_main_~#t949~0.offset_29|) (= v_~z$w_buff0~0_307 0) (= v_~__unbuffered_p3_EAX~0_136 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_136) (= |v_#valid_97| (store .cse0 |v_ULTIMATE.start_main_~#t949~0.base_44| 1)) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_179 0) (= 0 v_~z$r_buff1_thd4~0_175) (= v_~z$w_buff0_used~0_604 0) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t949~0.base_44|) 0) (= v_~z~0_135 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~weak$$choice0~0_20) (= v_~z$w_buff1~0_205 0) (= v_~z$r_buff1_thd1~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_119 0) (= v_~b~0_92 0) (= v_~z$r_buff0_thd2~0_73 0) (= v_~z$r_buff0_thd1~0_73 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t949~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t949~0.base_44|) |v_ULTIMATE.start_main_~#t949~0.offset_29| 0)) |v_#memory_int_29|) (= v_~a~0_119 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_37 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t949~0.base_44| 4)) (= v_~z$w_buff1_used~0_405 0) (= 0 v_~z$flush_delayed~0_40) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd3~0_260) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_31 0) (= v_~__unbuffered_cnt~0_126 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t949~0.base_44|) (= v_~z$mem_tmp~0_21 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_39|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_119, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_119, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_26|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_238, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_136, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_~#t949~0.offset=|v_ULTIMATE.start_main_~#t949~0.offset_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t949~0.base=|v_ULTIMATE.start_main_~#t949~0.base_44|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_85|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_405, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_43|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_26|, ~z$flush_delayed~0=v_~z$flush_delayed~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_119, ~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_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_37, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_175, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_20|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_179, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_604, ~z$w_buff0~0=v_~z$w_buff0~0_307, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_260, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_59|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_136, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_39|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_63|, ~b~0=v_~b~0_92, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_127, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t951~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t949~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t949~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t950~0.offset, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t952~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t952~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t951~0.base, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, 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 16:14:22,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L845-1-->L847: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t950~0.base_12| 4)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12|)) (= |v_ULTIMATE.start_main_~#t950~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t950~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t950~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12|) |v_ULTIMATE.start_main_~#t950~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_12|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t950~0.offset] because there is no mapped edge [2019-12-07 16:14:22,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L847-1-->L849: Formula: (and (= (store |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13| 1) |v_#valid_54|) (= 0 (select |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13|)) (= |v_ULTIMATE.start_main_~#t951~0.offset_11| 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13|) |v_ULTIMATE.start_main_~#t951~0.offset_11| 2))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t951~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t951~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t951~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_11|, #length=|v_#length_23|, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t951~0.offset, #length, ULTIMATE.start_main_~#t951~0.base] because there is no mapped edge [2019-12-07 16:14:22,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L849-1-->L851: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t952~0.base_10| 4)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10|) |v_ULTIMATE.start_main_~#t952~0.offset_9| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t952~0.base_10|) (= |v_ULTIMATE.start_main_~#t952~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t952~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t952~0.base, #length, ULTIMATE.start_main_~#t952~0.offset] because there is no mapped edge [2019-12-07 16:14:22,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L4-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_24 v_~z$r_buff1_thd4~0_12) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14 0)) (= 1 v_~a~0_5) (= v_~__unbuffered_p3_EBX~0_6 v_~b~0_6) (= v_~z$r_buff1_thd1~0_5 v_~z$r_buff0_thd1~0_6) (= v_~z$r_buff0_thd0~0_23 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff1_thd2~0_5 v_~z$r_buff0_thd2~0_6) (= v_~__unbuffered_p3_EAX~0_7 v_~a~0_5) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd4~0_23 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14, ~b~0=v_~b~0_6, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~a~0=v_~a~0_5, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~b~0=v_~b~0_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_5, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_23, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 16:14:22,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_27) (= v_~b~0_68 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~b~0=v_~b~0_68, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 16:14:22,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_19) (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~x~0_30 1) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_15| v_P1Thread1of1ForFork0_~arg.offset_13) (= v_P1Thread1of1ForFork0_~arg.base_13 |v_P1Thread1of1ForFork0_#in~arg.base_15|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_13, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_25, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 16:14:22,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L780-->L780-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1426966662 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1426966662 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In-1426966662 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In-1426966662 256) 0) (and (= (mod ~z$w_buff1_used~0_In-1426966662 256) 0) .cse0))) .cse1 (= |P2Thread1of1ForFork1_#t~ite9_Out-1426966662| |P2Thread1of1ForFork1_#t~ite8_Out-1426966662|) (= ~z$w_buff0~0_In-1426966662 |P2Thread1of1ForFork1_#t~ite8_Out-1426966662|)) (and (= ~z$w_buff0~0_In-1426966662 |P2Thread1of1ForFork1_#t~ite9_Out-1426966662|) (= |P2Thread1of1ForFork1_#t~ite8_In-1426966662| |P2Thread1of1ForFork1_#t~ite8_Out-1426966662|) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1426966662, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426966662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1426966662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426966662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1426966662, ~weak$$choice2~0=~weak$$choice2~0_In-1426966662, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-1426966662|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1426966662, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426966662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1426966662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426966662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1426966662, ~weak$$choice2~0=~weak$$choice2~0_In-1426966662, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-1426966662|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1426966662|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 16:14:22,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L784-->L785: Formula: (and (= v_~z$r_buff0_thd3~0_131 v_~z$r_buff0_thd3~0_130) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_10|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_6|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_38, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 16:14:22,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L787-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~z~0_40 v_~z$mem_tmp~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 16:14:22,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-294615920 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-294615920 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-294615920|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-294615920 |P3Thread1of1ForFork2_#t~ite28_Out-294615920|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-294615920, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-294615920} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-294615920|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-294615920, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-294615920} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 16:14:22,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In659570250 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In659570250 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In659570250 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In659570250 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out659570250|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In659570250 |P3Thread1of1ForFork2_#t~ite29_Out659570250|) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In659570250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In659570250, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In659570250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In659570250} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out659570250|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In659570250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In659570250, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In659570250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In659570250} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 16:14:22,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L825-->L826: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_In-107473633 ~z$r_buff0_thd4~0_Out-107473633)) (.cse0 (= (mod ~z$w_buff0_used~0_In-107473633 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-107473633 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out-107473633) (not .cse0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-107473633, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-107473633} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-107473633, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-107473633, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-107473633|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 16:14:22,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1567606551 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1567606551 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In1567606551 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1567606551 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out1567606551| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite31_Out1567606551| ~z$r_buff1_thd4~0_In1567606551)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1567606551, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567606551, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1567606551, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1567606551} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1567606551, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567606551, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1567606551, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1567606551, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1567606551|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 16:14:22,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_61) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_61, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 16:14:22,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L851-1-->L857: 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_50) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:14:22,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L857-2-->L857-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1903442575 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1903442575 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1903442575 |ULTIMATE.start_main_#t~ite36_Out1903442575|)) (and (not .cse1) (= ~z$w_buff1~0_In1903442575 |ULTIMATE.start_main_#t~ite36_Out1903442575|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1903442575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1903442575, ~z$w_buff1~0=~z$w_buff1~0_In1903442575, ~z~0=~z~0_In1903442575} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1903442575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1903442575, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1903442575|, ~z$w_buff1~0=~z$w_buff1~0_In1903442575, ~z~0=~z~0_In1903442575} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 16:14:22,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L857-4-->L858: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite36_15|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_6|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 16:14:22,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-712468996 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-712468996 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-712468996| ~z$w_buff0_used~0_In-712468996) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-712468996| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-712468996, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-712468996} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-712468996, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-712468996, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-712468996|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:14:22,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L859-->L859-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-831523246 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-831523246 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-831523246 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-831523246 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-831523246 |ULTIMATE.start_main_#t~ite39_Out-831523246|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-831523246|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-831523246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-831523246, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-831523246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-831523246} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-831523246, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-831523246|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-831523246, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-831523246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-831523246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:14:22,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L860-->L860-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1875035666 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1875035666 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1875035666| ~z$r_buff0_thd0~0_In1875035666) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out1875035666|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1875035666, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1875035666} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1875035666, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1875035666|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1875035666} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 16:14:22,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L861-->L861-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-2124624543 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2124624543 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-2124624543 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2124624543 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-2124624543| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In-2124624543 |ULTIMATE.start_main_#t~ite41_Out-2124624543|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2124624543, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2124624543, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2124624543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2124624543} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2124624543|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2124624543, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2124624543, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2124624543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2124624543} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 16:14:22,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= v_~z$r_buff1_thd0~0_157 |v_ULTIMATE.start_main_#t~ite41_37|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_117) (= v_~__unbuffered_p3_EAX~0_117 1) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_34) (= 0 v_~__unbuffered_p1_EAX~0_26))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_157, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:14:22,786 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5b42673b-aeb5-45f4-b76c-9a239103f480/bin/utaipan/witness.graphml [2019-12-07 16:14:22,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:14:22,788 INFO L168 Benchmark]: Toolchain (without parser) took 20803.43 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 937.2 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 670.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:14:22,788 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:14:22,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:14:22,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:14:22,789 INFO L168 Benchmark]: Boogie Preprocessor took 24.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:14:22,789 INFO L168 Benchmark]: RCFGBuilder took 377.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.8 MB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:14:22,790 INFO L168 Benchmark]: TraceAbstraction took 19868.21 ms. Allocated memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 997.8 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 627.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:14:22,790 INFO L168 Benchmark]: Witness Printer took 74.47 ms. Allocated memory is still 3.7 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:14:22,792 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 377.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.8 MB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19868.21 ms. Allocated memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 997.8 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 627.9 MB. Max. memory is 11.5 GB. * Witness Printer took 74.47 ms. Allocated memory is still 3.7 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 171 ProgramPointsBefore, 79 ProgramPointsAfterwards, 193 TransitionsBefore, 87 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 19 ChoiceCompositions, 5629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 54 SemBasedMoverChecksPositive, 182 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 48496 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L847] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L849] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 1 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L822] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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=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] [L772] 3 y = 1 [L775] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 3 z$flush_delayed = weak$$choice2 [L778] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, 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] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, 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 = !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) [L780] 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)) [L781] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=1, y=1, 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] [L781] 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)) [L782] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=1, y=1, 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] [L782] 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)) [L783] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=1, y=1, 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] [L783] 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)) [L785] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=1, y=1, 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] [L785] 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)) [L786] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, 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] [L822] 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) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 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 [L857] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, 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] [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 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, 159 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2673 SDtfs, 3000 SDslu, 5908 SDs, 0 SdLazy, 3279 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39262occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 25839 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 91643 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...