./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/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 2d4d6eb1ed3fefbef7182528ab233a0014807c05 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:01:44,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:01:44,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:01:44,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:01:44,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:01:44,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:01:44,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:01:44,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:01:44,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:01:44,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:01:44,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:01:44,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:01:44,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:01:44,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:01:44,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:01:44,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:01:44,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:01:44,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:01:44,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:01:44,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:01:44,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:01:44,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:01:44,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:01:44,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:01:44,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:01:44,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:01:44,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:01:44,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:01:44,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:01:44,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:01:44,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:01:44,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:01:44,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:01:44,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:01:44,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:01:44,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:01:44,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:01:44,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:01:44,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:01:44,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:01:44,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:01:44,208 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:01:44,217 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:01:44,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:01:44,218 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:01:44,218 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:01:44,218 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:01:44,218 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:01:44,218 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:01:44,218 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:01:44,218 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:01:44,218 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:01:44,219 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:01:44,219 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:01:44,219 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:01:44,219 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:01:44,219 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:01:44,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:01:44,219 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:01:44,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:01:44,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:01:44,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:01:44,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:01:44,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:01:44,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:01:44,220 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:01:44,220 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:01:44,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:01:44,220 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:01:44,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:01:44,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:01:44,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:01:44,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:01:44,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:01:44,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:01:44,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:01:44,222 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:01:44,222 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:01:44,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:01:44,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:01:44,222 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:01:44,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:01:44,222 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_f3e2d93d-5688-48f5-922b-a9f773f3f812/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 -> 2d4d6eb1ed3fefbef7182528ab233a0014807c05 [2019-12-07 11:01:44,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:01:44,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:01:44,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:01:44,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:01:44,333 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:01:44,333 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc.i [2019-12-07 11:01:44,369 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/bin/utaipan/data/adfb97597/e56519a8f0bc47d6a7365eaac3903207/FLAG4488b8d59 [2019-12-07 11:01:44,864 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:01:44,864 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc.i [2019-12-07 11:01:44,876 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/bin/utaipan/data/adfb97597/e56519a8f0bc47d6a7365eaac3903207/FLAG4488b8d59 [2019-12-07 11:01:45,353 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/bin/utaipan/data/adfb97597/e56519a8f0bc47d6a7365eaac3903207 [2019-12-07 11:01:45,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:01:45,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:01:45,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:01:45,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:01:45,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:01:45,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:01:45" (1/1) ... [2019-12-07 11:01:45,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a7eda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45, skipping insertion in model container [2019-12-07 11:01:45,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:01:45" (1/1) ... [2019-12-07 11:01:45,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:01:45,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:01:45,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:01:45,643 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:01:45,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:01:45,728 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:01:45,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45 WrapperNode [2019-12-07 11:01:45,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:01:45,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:01:45,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:01:45,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:01:45,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45" (1/1) ... [2019-12-07 11:01:45,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45" (1/1) ... [2019-12-07 11:01:45,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:01:45,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:01:45,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:01:45,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:01:45,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45" (1/1) ... [2019-12-07 11:01:45,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45" (1/1) ... [2019-12-07 11:01:45,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45" (1/1) ... [2019-12-07 11:01:45,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45" (1/1) ... [2019-12-07 11:01:45,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45" (1/1) ... [2019-12-07 11:01:45,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45" (1/1) ... [2019-12-07 11:01:45,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45" (1/1) ... [2019-12-07 11:01:45,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:01:45,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:01:45,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:01:45,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:01:45,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/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 11:01:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:01:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:01:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:01:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:01:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:01:45,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:01:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:01:45,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:01:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:01:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:01:45,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:01:45,832 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 11:01:46,174 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:01:46,174 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:01:46,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:01:46 BoogieIcfgContainer [2019-12-07 11:01:46,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:01:46,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:01:46,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:01:46,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:01:46,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:01:45" (1/3) ... [2019-12-07 11:01:46,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585fe424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:01:46, skipping insertion in model container [2019-12-07 11:01:46,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:45" (2/3) ... [2019-12-07 11:01:46,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585fe424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:01:46, skipping insertion in model container [2019-12-07 11:01:46,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:01:46" (3/3) ... [2019-12-07 11:01:46,180 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.oepc.i [2019-12-07 11:01:46,186 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:01:46,187 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:01:46,192 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:01:46,192 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:01:46,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,224 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,224 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:46,245 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 11:01:46,258 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:01:46,258 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:01:46,258 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:01:46,258 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:01:46,258 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:01:46,258 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:01:46,258 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:01:46,258 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:01:46,269 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-07 11:01:46,270 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 11:01:46,316 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 11:01:46,317 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:01:46,325 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 575 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 11:01:46,336 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 11:01:46,361 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 11:01:46,361 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:01:46,368 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 575 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 11:01:46,377 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 11:01:46,378 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:01:48,815 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 11:01:49,178 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76598 [2019-12-07 11:01:49,179 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 11:01:49,181 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-07 11:01:49,552 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 11:01:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 11:01:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:01:49,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:49,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:01:49,559 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:49,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:49,563 INFO L82 PathProgramCache]: Analyzing trace with hash 791334, now seen corresponding path program 1 times [2019-12-07 11:01:49,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:49,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258793560] [2019-12-07 11:01:49,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:49,718 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 11:01:49,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258793560] [2019-12-07 11:01:49,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:49,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:01:49,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804264480] [2019-12-07 11:01:49,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:49,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:49,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:49,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:49,740 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 11:01:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:49,904 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-07 11:01:49,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:49,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:01:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:49,967 INFO L225 Difference]: With dead ends: 8506 [2019-12-07 11:01:49,967 INFO L226 Difference]: Without dead ends: 7522 [2019-12-07 11:01:49,968 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 11:01:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-07 11:01:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-07 11:01:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-07 11:01:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-07 11:01:50,219 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-07 11:01:50,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:50,219 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-07 11:01:50,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-07 11:01:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:01:50,222 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:50,222 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:50,222 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash -894599256, now seen corresponding path program 1 times [2019-12-07 11:01:50,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:50,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748464836] [2019-12-07 11:01:50,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:50,282 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 11:01:50,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748464836] [2019-12-07 11:01:50,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:50,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:01:50,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284073415] [2019-12-07 11:01:50,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:01:50,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:50,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:01:50,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:01:50,284 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 4 states. [2019-12-07 11:01:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:50,530 INFO L93 Difference]: Finished difference Result 11740 states and 36692 transitions. [2019-12-07 11:01:50,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:01:50,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 11:01:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:50,588 INFO L225 Difference]: With dead ends: 11740 [2019-12-07 11:01:50,588 INFO L226 Difference]: Without dead ends: 11726 [2019-12-07 11:01:50,588 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 11:01:50,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11726 states. [2019-12-07 11:01:50,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11726 to 10436. [2019-12-07 11:01:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10436 states. [2019-12-07 11:01:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10436 states to 10436 states and 33285 transitions. [2019-12-07 11:01:50,856 INFO L78 Accepts]: Start accepts. Automaton has 10436 states and 33285 transitions. Word has length 11 [2019-12-07 11:01:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:50,856 INFO L462 AbstractCegarLoop]: Abstraction has 10436 states and 33285 transitions. [2019-12-07 11:01:50,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:01:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 10436 states and 33285 transitions. [2019-12-07 11:01:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:01:50,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:50,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:50,861 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:50,861 INFO L82 PathProgramCache]: Analyzing trace with hash 253726612, now seen corresponding path program 1 times [2019-12-07 11:01:50,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:50,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459466296] [2019-12-07 11:01:50,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:50,895 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 11:01:50,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459466296] [2019-12-07 11:01:50,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:50,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:01:50,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448221487] [2019-12-07 11:01:50,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:50,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:50,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:50,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:50,896 INFO L87 Difference]: Start difference. First operand 10436 states and 33285 transitions. Second operand 3 states. [2019-12-07 11:01:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:50,975 INFO L93 Difference]: Finished difference Result 15866 states and 49520 transitions. [2019-12-07 11:01:50,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:50,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 11:01:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:51,007 INFO L225 Difference]: With dead ends: 15866 [2019-12-07 11:01:51,007 INFO L226 Difference]: Without dead ends: 15866 [2019-12-07 11:01:51,007 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 11:01:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15866 states. [2019-12-07 11:01:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15866 to 11795. [2019-12-07 11:01:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11795 states. [2019-12-07 11:01:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11795 states to 11795 states and 37291 transitions. [2019-12-07 11:01:51,243 INFO L78 Accepts]: Start accepts. Automaton has 11795 states and 37291 transitions. Word has length 14 [2019-12-07 11:01:51,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:51,244 INFO L462 AbstractCegarLoop]: Abstraction has 11795 states and 37291 transitions. [2019-12-07 11:01:51,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:51,244 INFO L276 IsEmpty]: Start isEmpty. Operand 11795 states and 37291 transitions. [2019-12-07 11:01:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:01:51,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:51,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:51,246 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:51,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:51,246 INFO L82 PathProgramCache]: Analyzing trace with hash 164472776, now seen corresponding path program 1 times [2019-12-07 11:01:51,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:51,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683105617] [2019-12-07 11:01:51,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:51,286 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 11:01:51,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683105617] [2019-12-07 11:01:51,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:51,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:01:51,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216212377] [2019-12-07 11:01:51,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:01:51,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:51,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:01:51,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:01:51,287 INFO L87 Difference]: Start difference. First operand 11795 states and 37291 transitions. Second operand 4 states. [2019-12-07 11:01:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:51,436 INFO L93 Difference]: Finished difference Result 14131 states and 44142 transitions. [2019-12-07 11:01:51,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:01:51,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:01:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:51,457 INFO L225 Difference]: With dead ends: 14131 [2019-12-07 11:01:51,457 INFO L226 Difference]: Without dead ends: 14131 [2019-12-07 11:01:51,457 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 11:01:51,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14131 states. [2019-12-07 11:01:51,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14131 to 12855. [2019-12-07 11:01:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12855 states. [2019-12-07 11:01:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12855 states to 12855 states and 40501 transitions. [2019-12-07 11:01:51,690 INFO L78 Accepts]: Start accepts. Automaton has 12855 states and 40501 transitions. Word has length 14 [2019-12-07 11:01:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:51,690 INFO L462 AbstractCegarLoop]: Abstraction has 12855 states and 40501 transitions. [2019-12-07 11:01:51,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:01:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 12855 states and 40501 transitions. [2019-12-07 11:01:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:01:51,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:51,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:51,692 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:51,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:51,692 INFO L82 PathProgramCache]: Analyzing trace with hash 930242268, now seen corresponding path program 1 times [2019-12-07 11:01:51,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:51,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27694806] [2019-12-07 11:01:51,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:51,730 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 11:01:51,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27694806] [2019-12-07 11:01:51,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:51,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:01:51,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378020336] [2019-12-07 11:01:51,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:01:51,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:51,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:01:51,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:01:51,731 INFO L87 Difference]: Start difference. First operand 12855 states and 40501 transitions. Second operand 4 states. [2019-12-07 11:01:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:51,869 INFO L93 Difference]: Finished difference Result 15545 states and 48643 transitions. [2019-12-07 11:01:51,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:01:51,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:01:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:51,888 INFO L225 Difference]: With dead ends: 15545 [2019-12-07 11:01:51,888 INFO L226 Difference]: Without dead ends: 15545 [2019-12-07 11:01:51,888 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 11:01:51,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15545 states. [2019-12-07 11:01:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15545 to 13090. [2019-12-07 11:01:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13090 states. [2019-12-07 11:01:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13090 states to 13090 states and 41334 transitions. [2019-12-07 11:01:52,110 INFO L78 Accepts]: Start accepts. Automaton has 13090 states and 41334 transitions. Word has length 14 [2019-12-07 11:01:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:52,110 INFO L462 AbstractCegarLoop]: Abstraction has 13090 states and 41334 transitions. [2019-12-07 11:01:52,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:01:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 13090 states and 41334 transitions. [2019-12-07 11:01:52,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:01:52,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:52,113 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:52,113 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:52,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:52,113 INFO L82 PathProgramCache]: Analyzing trace with hash 929928555, now seen corresponding path program 1 times [2019-12-07 11:01:52,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:52,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238607770] [2019-12-07 11:01:52,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:52,180 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 11:01:52,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238607770] [2019-12-07 11:01:52,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:52,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:01:52,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405029381] [2019-12-07 11:01:52,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:52,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:52,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:52,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:52,181 INFO L87 Difference]: Start difference. First operand 13090 states and 41334 transitions. Second operand 3 states. [2019-12-07 11:01:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:52,271 INFO L93 Difference]: Finished difference Result 22410 states and 70278 transitions. [2019-12-07 11:01:52,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:52,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 11:01:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:52,293 INFO L225 Difference]: With dead ends: 22410 [2019-12-07 11:01:52,294 INFO L226 Difference]: Without dead ends: 19950 [2019-12-07 11:01:52,294 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 11:01:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19950 states. [2019-12-07 11:01:52,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19950 to 19068. [2019-12-07 11:01:52,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19068 states. [2019-12-07 11:01:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19068 states to 19068 states and 60431 transitions. [2019-12-07 11:01:52,578 INFO L78 Accepts]: Start accepts. Automaton has 19068 states and 60431 transitions. Word has length 16 [2019-12-07 11:01:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:52,578 INFO L462 AbstractCegarLoop]: Abstraction has 19068 states and 60431 transitions. [2019-12-07 11:01:52,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 19068 states and 60431 transitions. [2019-12-07 11:01:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:01:52,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:52,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:52,583 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:52,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1464766405, now seen corresponding path program 1 times [2019-12-07 11:01:52,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:52,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235638843] [2019-12-07 11:01:52,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:52,616 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 11:01:52,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235638843] [2019-12-07 11:01:52,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:52,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:01:52,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874918501] [2019-12-07 11:01:52,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:52,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:52,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:52,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:52,618 INFO L87 Difference]: Start difference. First operand 19068 states and 60431 transitions. Second operand 3 states. [2019-12-07 11:01:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:52,672 INFO L93 Difference]: Finished difference Result 19068 states and 59488 transitions. [2019-12-07 11:01:52,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:52,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 11:01:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:52,694 INFO L225 Difference]: With dead ends: 19068 [2019-12-07 11:01:52,694 INFO L226 Difference]: Without dead ends: 19068 [2019-12-07 11:01:52,695 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 11:01:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19068 states. [2019-12-07 11:01:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19068 to 18980. [2019-12-07 11:01:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18980 states. [2019-12-07 11:01:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18980 states to 18980 states and 59240 transitions. [2019-12-07 11:01:52,972 INFO L78 Accepts]: Start accepts. Automaton has 18980 states and 59240 transitions. Word has length 17 [2019-12-07 11:01:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:52,973 INFO L462 AbstractCegarLoop]: Abstraction has 18980 states and 59240 transitions. [2019-12-07 11:01:52,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 18980 states and 59240 transitions. [2019-12-07 11:01:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:01:52,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:52,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:52,978 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:52,978 INFO L82 PathProgramCache]: Analyzing trace with hash 570123844, now seen corresponding path program 1 times [2019-12-07 11:01:52,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:52,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291862119] [2019-12-07 11:01:52,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:53,007 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 11:01:53,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291862119] [2019-12-07 11:01:53,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:53,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:01:53,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519904131] [2019-12-07 11:01:53,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:53,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:53,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:53,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:53,008 INFO L87 Difference]: Start difference. First operand 18980 states and 59240 transitions. Second operand 3 states. [2019-12-07 11:01:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:53,019 INFO L93 Difference]: Finished difference Result 2388 states and 5347 transitions. [2019-12-07 11:01:53,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:53,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 11:01:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:53,022 INFO L225 Difference]: With dead ends: 2388 [2019-12-07 11:01:53,022 INFO L226 Difference]: Without dead ends: 2388 [2019-12-07 11:01:53,022 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 11:01:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2019-12-07 11:01:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2019-12-07 11:01:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-12-07 11:01:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5347 transitions. [2019-12-07 11:01:53,049 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5347 transitions. Word has length 17 [2019-12-07 11:01:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:53,050 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5347 transitions. [2019-12-07 11:01:53,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5347 transitions. [2019-12-07 11:01:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:01:53,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:53,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:53,052 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1533455323, now seen corresponding path program 1 times [2019-12-07 11:01:53,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:53,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936038521] [2019-12-07 11:01:53,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:53,149 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 11:01:53,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936038521] [2019-12-07 11:01:53,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:53,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:01:53,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676640269] [2019-12-07 11:01:53,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:01:53,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:53,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:01:53,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:01:53,151 INFO L87 Difference]: Start difference. First operand 2388 states and 5347 transitions. Second operand 5 states. [2019-12-07 11:01:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:53,304 INFO L93 Difference]: Finished difference Result 2913 states and 6370 transitions. [2019-12-07 11:01:53,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:01:53,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 11:01:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:53,306 INFO L225 Difference]: With dead ends: 2913 [2019-12-07 11:01:53,306 INFO L226 Difference]: Without dead ends: 2913 [2019-12-07 11:01:53,307 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 11:01:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-12-07 11:01:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2438. [2019-12-07 11:01:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2438 states. [2019-12-07 11:01:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 5449 transitions. [2019-12-07 11:01:53,331 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 5449 transitions. Word has length 25 [2019-12-07 11:01:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:53,331 INFO L462 AbstractCegarLoop]: Abstraction has 2438 states and 5449 transitions. [2019-12-07 11:01:53,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:01:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 5449 transitions. [2019-12-07 11:01:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:01:53,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:53,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:53,333 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:53,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:53,333 INFO L82 PathProgramCache]: Analyzing trace with hash -381413792, now seen corresponding path program 1 times [2019-12-07 11:01:53,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:53,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757602495] [2019-12-07 11:01:53,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:53,354 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 11:01:53,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757602495] [2019-12-07 11:01:53,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:53,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:01:53,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784870820] [2019-12-07 11:01:53,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:53,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:53,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:53,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:53,355 INFO L87 Difference]: Start difference. First operand 2438 states and 5449 transitions. Second operand 3 states. [2019-12-07 11:01:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:53,385 INFO L93 Difference]: Finished difference Result 3081 states and 6522 transitions. [2019-12-07 11:01:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:53,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 11:01:53,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:53,388 INFO L225 Difference]: With dead ends: 3081 [2019-12-07 11:01:53,388 INFO L226 Difference]: Without dead ends: 3081 [2019-12-07 11:01:53,388 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 11:01:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2019-12-07 11:01:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2429. [2019-12-07 11:01:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2019-12-07 11:01:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 5197 transitions. [2019-12-07 11:01:53,413 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 5197 transitions. Word has length 25 [2019-12-07 11:01:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:53,413 INFO L462 AbstractCegarLoop]: Abstraction has 2429 states and 5197 transitions. [2019-12-07 11:01:53,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 5197 transitions. [2019-12-07 11:01:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:01:53,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:53,415 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:53,415 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:53,416 INFO L82 PathProgramCache]: Analyzing trace with hash 501869478, now seen corresponding path program 1 times [2019-12-07 11:01:53,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:53,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123797296] [2019-12-07 11:01:53,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:53,451 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 11:01:53,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123797296] [2019-12-07 11:01:53,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:53,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:01:53,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524156567] [2019-12-07 11:01:53,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:01:53,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:53,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:01:53,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:01:53,453 INFO L87 Difference]: Start difference. First operand 2429 states and 5197 transitions. Second operand 5 states. [2019-12-07 11:01:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:53,592 INFO L93 Difference]: Finished difference Result 2847 states and 6006 transitions. [2019-12-07 11:01:53,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:01:53,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 11:01:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:53,594 INFO L225 Difference]: With dead ends: 2847 [2019-12-07 11:01:53,595 INFO L226 Difference]: Without dead ends: 2847 [2019-12-07 11:01:53,595 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 11:01:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2019-12-07 11:01:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2388. [2019-12-07 11:01:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-12-07 11:01:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5113 transitions. [2019-12-07 11:01:53,615 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5113 transitions. Word has length 26 [2019-12-07 11:01:53,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:53,615 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5113 transitions. [2019-12-07 11:01:53,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:01:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5113 transitions. [2019-12-07 11:01:53,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:01:53,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:53,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:53,618 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:53,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:53,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1516082769, now seen corresponding path program 1 times [2019-12-07 11:01:53,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:53,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234798482] [2019-12-07 11:01:53,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:53,653 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 11:01:53,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234798482] [2019-12-07 11:01:53,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:53,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:01:53,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513493722] [2019-12-07 11:01:53,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:01:53,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:53,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:01:53,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:01:53,655 INFO L87 Difference]: Start difference. First operand 2388 states and 5113 transitions. Second operand 4 states. [2019-12-07 11:01:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:53,664 INFO L93 Difference]: Finished difference Result 1174 states and 2488 transitions. [2019-12-07 11:01:53,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:01:53,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 11:01:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:53,665 INFO L225 Difference]: With dead ends: 1174 [2019-12-07 11:01:53,665 INFO L226 Difference]: Without dead ends: 1142 [2019-12-07 11:01:53,665 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 11:01:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-12-07 11:01:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 795. [2019-12-07 11:01:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-12-07 11:01:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1666 transitions. [2019-12-07 11:01:53,672 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1666 transitions. Word has length 28 [2019-12-07 11:01:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:53,673 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1666 transitions. [2019-12-07 11:01:53,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:01:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1666 transitions. [2019-12-07 11:01:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:01:53,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:53,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:53,674 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1729344618, now seen corresponding path program 1 times [2019-12-07 11:01:53,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:53,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820701394] [2019-12-07 11:01:53,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:53,725 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 11:01:53,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820701394] [2019-12-07 11:01:53,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:53,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:01:53,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201302071] [2019-12-07 11:01:53,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:53,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:53,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:53,727 INFO L87 Difference]: Start difference. First operand 795 states and 1666 transitions. Second operand 3 states. [2019-12-07 11:01:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:53,761 INFO L93 Difference]: Finished difference Result 988 states and 2066 transitions. [2019-12-07 11:01:53,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:53,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 11:01:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:53,762 INFO L225 Difference]: With dead ends: 988 [2019-12-07 11:01:53,762 INFO L226 Difference]: Without dead ends: 988 [2019-12-07 11:01:53,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 11:01:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-12-07 11:01:53,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 772. [2019-12-07 11:01:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-12-07 11:01:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1632 transitions. [2019-12-07 11:01:53,769 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1632 transitions. Word has length 52 [2019-12-07 11:01:53,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:53,769 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1632 transitions. [2019-12-07 11:01:53,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:53,770 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1632 transitions. [2019-12-07 11:01:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 11:01:53,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:53,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:53,771 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:53,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:53,771 INFO L82 PathProgramCache]: Analyzing trace with hash -486023076, now seen corresponding path program 1 times [2019-12-07 11:01:53,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:53,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128838201] [2019-12-07 11:01:53,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:53,842 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 11:01:53,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128838201] [2019-12-07 11:01:53,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:53,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:01:53,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221106817] [2019-12-07 11:01:53,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:01:53,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:53,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:01:53,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:01:53,843 INFO L87 Difference]: Start difference. First operand 772 states and 1632 transitions. Second operand 7 states. [2019-12-07 11:01:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:54,021 INFO L93 Difference]: Finished difference Result 2515 states and 5182 transitions. [2019-12-07 11:01:54,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:01:54,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 11:01:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:54,023 INFO L225 Difference]: With dead ends: 2515 [2019-12-07 11:01:54,023 INFO L226 Difference]: Without dead ends: 1731 [2019-12-07 11:01:54,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:01:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2019-12-07 11:01:54,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 894. [2019-12-07 11:01:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-12-07 11:01:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1873 transitions. [2019-12-07 11:01:54,032 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1873 transitions. Word has length 53 [2019-12-07 11:01:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:54,033 INFO L462 AbstractCegarLoop]: Abstraction has 894 states and 1873 transitions. [2019-12-07 11:01:54,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:01:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1873 transitions. [2019-12-07 11:01:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 11:01:54,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:54,034 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:54,034 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:54,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:54,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1920865598, now seen corresponding path program 2 times [2019-12-07 11:01:54,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:54,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614233170] [2019-12-07 11:01:54,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:01:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:01:54,103 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:01:54,103 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:01:54,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_142 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1609~0.base_31| 1)) (= v_~x$mem_tmp~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= |v_#NULL.offset_6| 0) (= v_~z~0_22 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~__unbuffered_p1_EBX~0_41 0) (= 0 v_~x$w_buff0_used~0_606) (= v_~y~0_95 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$w_buff1~0_160) (= v_~x$r_buff1_thd1~0_109 0) (= 0 v_~x$w_buff0~0_251) (= 0 v_~x$r_buff1_thd2~0_196) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~x$w_buff1_used~0_306) (= 0 v_~weak$$choice2~0_98) (= 0 v_~weak$$choice0~0_22) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1609~0.base_31| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1609~0.base_31|) |v_ULTIMATE.start_main_~#t1609~0.offset_23| 0))) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1609~0.base_31| 4)) (= |v_ULTIMATE.start_main_~#t1609~0.offset_23| 0) (= 0 v_~x$r_buff0_thd2~0_279) (= 0 v_~x~0_116) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1609~0.base_31|) (= v_~x$flush_delayed~0_30 0) (= v_~x$r_buff0_thd0~0_134 0) (= v_~x$r_buff0_thd1~0_174 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1609~0.base_31|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_251, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_174, ~x$flush_delayed~0=v_~x$flush_delayed~0_30, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~x$mem_tmp~0=v_~x$mem_tmp~0_23, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_371|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_90|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t1610~0.base=|v_ULTIMATE.start_main_~#t1610~0.base_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, ULTIMATE.start_main_~#t1610~0.offset=|v_ULTIMATE.start_main_~#t1610~0.offset_15|, #length=|v_#length_19|, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ULTIMATE.start_main_~#t1609~0.offset=|v_ULTIMATE.start_main_~#t1609~0.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_196, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_279, ULTIMATE.start_main_~#t1609~0.base=|v_ULTIMATE.start_main_~#t1609~0.base_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~x~0=v_~x~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1610~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1610~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1609~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1609~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:01:54,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= 1 ~x$r_buff0_thd1~0_Out197766721) (= ~y~0_Out197766721 1) (= ~x$r_buff0_thd0~0_In197766721 ~x$r_buff1_thd0~0_Out197766721) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In197766721 0)) (= ~x$r_buff0_thd2~0_In197766721 ~x$r_buff1_thd2~0_Out197766721) (= ~x$r_buff1_thd1~0_Out197766721 ~x$r_buff0_thd1~0_In197766721)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In197766721, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In197766721, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In197766721, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In197766721} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In197766721, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out197766721, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In197766721, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out197766721, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out197766721, ~y~0=~y~0_Out197766721, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In197766721, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out197766721} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:01:54,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L802-1-->L804: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1610~0.base_11|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1610~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1610~0.base_11| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1610~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1610~0.offset_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1610~0.base_11| 1)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1610~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1610~0.base_11|) |v_ULTIMATE.start_main_~#t1610~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1610~0.base=|v_ULTIMATE.start_main_~#t1610~0.base_11|, ULTIMATE.start_main_~#t1610~0.offset=|v_ULTIMATE.start_main_~#t1610~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1610~0.base, ULTIMATE.start_main_~#t1610~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 11:01:54,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-746861885 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-746861885 256) 0))) (or (and (= ~x$w_buff0_used~0_In-746861885 |P0Thread1of1ForFork0_#t~ite5_Out-746861885|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-746861885|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-746861885, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-746861885} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-746861885|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-746861885, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-746861885} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 11:01:54,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In807054505 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In807054505 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In807054505 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In807054505 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In807054505 |P0Thread1of1ForFork0_#t~ite6_Out807054505|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out807054505|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In807054505, ~x$w_buff1_used~0=~x$w_buff1_used~0_In807054505, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In807054505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In807054505} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out807054505|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In807054505, ~x$w_buff1_used~0=~x$w_buff1_used~0_In807054505, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In807054505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In807054505} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 11:01:54,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-529847084 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-529847084 256))) (.cse0 (= ~x$r_buff0_thd1~0_Out-529847084 ~x$r_buff0_thd1~0_In-529847084))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out-529847084) (not .cse2)) (and .cse2 .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-529847084, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-529847084} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-529847084, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-529847084|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-529847084} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 11:01:54,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In2121363527 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In2121363527 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In2121363527 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2121363527 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out2121363527| ~x$r_buff1_thd1~0_In2121363527) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out2121363527| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2121363527, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2121363527, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2121363527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2121363527} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2121363527, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2121363527|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2121363527, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2121363527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2121363527} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 11:01:54,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L744-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 11:01:54,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_25, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 11:01:54,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-556465893 256) 0))) (or (and (= ~x$r_buff1_thd2~0_In-556465893 |P1Thread1of1ForFork1_#t~ite30_Out-556465893|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-556465893| |P1Thread1of1ForFork1_#t~ite29_Out-556465893|)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-556465893 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-556465893 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-556465893 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-556465893 256))))) (= ~x$r_buff1_thd2~0_In-556465893 |P1Thread1of1ForFork1_#t~ite29_Out-556465893|) (= |P1Thread1of1ForFork1_#t~ite30_Out-556465893| |P1Thread1of1ForFork1_#t~ite29_Out-556465893|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-556465893|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-556465893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-556465893, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-556465893, ~weak$$choice2~0=~weak$$choice2~0_In-556465893, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-556465893} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-556465893|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-556465893|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-556465893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-556465893, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-556465893, ~weak$$choice2~0=~weak$$choice2~0_In-556465893, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-556465893} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 11:01:54,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_6 v_~x~0_27) (not (= (mod v_~x$flush_delayed~0_9 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-07 11:01:54,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-697821869 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-697821869 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-697821869| ~x$w_buff1~0_In-697821869)) (and (= ~x~0_In-697821869 |P1Thread1of1ForFork1_#t~ite32_Out-697821869|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-697821869, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-697821869, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-697821869, ~x~0=~x~0_In-697821869} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-697821869, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-697821869, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-697821869, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-697821869|, ~x~0=~x~0_In-697821869} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:01:54,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_39 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 11:01:54,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-20780897 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-20780897 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-20780897| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-20780897| ~x$w_buff0_used~0_In-20780897) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-20780897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-20780897} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-20780897|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-20780897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-20780897} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:01:54,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2114624376 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2114624376 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2114624376 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-2114624376 256)))) (or (and (= ~x$w_buff1_used~0_In-2114624376 |P1Thread1of1ForFork1_#t~ite35_Out-2114624376|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-2114624376|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2114624376, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2114624376, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2114624376, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2114624376} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2114624376, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2114624376, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2114624376|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2114624376, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2114624376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:01:54,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1551415730 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1551415730 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1551415730| ~x$r_buff0_thd2~0_In-1551415730)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1551415730| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1551415730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1551415730} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1551415730, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1551415730|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1551415730} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:01:54,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-629745605 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-629745605 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-629745605 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-629745605 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-629745605|)) (and (= ~x$r_buff1_thd2~0_In-629745605 |P1Thread1of1ForFork1_#t~ite37_Out-629745605|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-629745605, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-629745605, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-629745605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-629745605} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-629745605, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-629745605, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-629745605, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-629745605|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-629745605} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:01:54,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= v_~x$r_buff1_thd2~0_91 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_91, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:01:54,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 11:01:54,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite41_Out-1644589727| |ULTIMATE.start_main_#t~ite40_Out-1644589727|)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1644589727 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1644589727 256)))) (or (and (not .cse0) .cse1 (= ~x$w_buff1~0_In-1644589727 |ULTIMATE.start_main_#t~ite40_Out-1644589727|) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1644589727| ~x~0_In-1644589727) .cse1 (or .cse0 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1644589727, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1644589727, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1644589727, ~x~0=~x~0_In-1644589727} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1644589727|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1644589727|, ~x$w_buff1~0=~x$w_buff1~0_In-1644589727, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1644589727, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1644589727, ~x~0=~x~0_In-1644589727} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:01:54,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In2105048073 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In2105048073 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2105048073| 0)) (and (= |ULTIMATE.start_main_#t~ite42_Out2105048073| ~x$w_buff0_used~0_In2105048073) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2105048073, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2105048073} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2105048073, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2105048073|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2105048073} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:01:54,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In654265737 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In654265737 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In654265737 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In654265737 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out654265737|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In654265737 |ULTIMATE.start_main_#t~ite43_Out654265737|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In654265737, ~x$w_buff1_used~0=~x$w_buff1_used~0_In654265737, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In654265737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In654265737} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In654265737, ~x$w_buff1_used~0=~x$w_buff1_used~0_In654265737, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out654265737|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In654265737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In654265737} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:01:54,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1113003066 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1113003066 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1113003066| ~x$r_buff0_thd0~0_In-1113003066) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1113003066| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1113003066, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1113003066} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1113003066, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1113003066|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1113003066} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:01:54,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1156692785 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1156692785 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1156692785 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1156692785 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1156692785|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1156692785| ~x$r_buff1_thd0~0_In1156692785)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1156692785, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1156692785, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1156692785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1156692785} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1156692785, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1156692785, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1156692785, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1156692785|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1156692785} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:01:54,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_96 |v_ULTIMATE.start_main_#t~ite45_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~y~0_57 2) (= v_~__unbuffered_p1_EBX~0_23 0))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_53|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_57, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_96, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_52|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:01:54,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:01:54 BasicIcfg [2019-12-07 11:01:54,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:01:54,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:01:54,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:01:54,157 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:01:54,157 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:01:46" (3/4) ... [2019-12-07 11:01:54,159 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:01:54,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_142 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1609~0.base_31| 1)) (= v_~x$mem_tmp~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= |v_#NULL.offset_6| 0) (= v_~z~0_22 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~__unbuffered_p1_EBX~0_41 0) (= 0 v_~x$w_buff0_used~0_606) (= v_~y~0_95 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$w_buff1~0_160) (= v_~x$r_buff1_thd1~0_109 0) (= 0 v_~x$w_buff0~0_251) (= 0 v_~x$r_buff1_thd2~0_196) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~x$w_buff1_used~0_306) (= 0 v_~weak$$choice2~0_98) (= 0 v_~weak$$choice0~0_22) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1609~0.base_31| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1609~0.base_31|) |v_ULTIMATE.start_main_~#t1609~0.offset_23| 0))) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1609~0.base_31| 4)) (= |v_ULTIMATE.start_main_~#t1609~0.offset_23| 0) (= 0 v_~x$r_buff0_thd2~0_279) (= 0 v_~x~0_116) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1609~0.base_31|) (= v_~x$flush_delayed~0_30 0) (= v_~x$r_buff0_thd0~0_134 0) (= v_~x$r_buff0_thd1~0_174 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1609~0.base_31|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_251, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_174, ~x$flush_delayed~0=v_~x$flush_delayed~0_30, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~x$mem_tmp~0=v_~x$mem_tmp~0_23, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_371|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_90|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t1610~0.base=|v_ULTIMATE.start_main_~#t1610~0.base_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, ULTIMATE.start_main_~#t1610~0.offset=|v_ULTIMATE.start_main_~#t1610~0.offset_15|, #length=|v_#length_19|, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ULTIMATE.start_main_~#t1609~0.offset=|v_ULTIMATE.start_main_~#t1609~0.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_196, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_279, ULTIMATE.start_main_~#t1609~0.base=|v_ULTIMATE.start_main_~#t1609~0.base_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~x~0=v_~x~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1610~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1610~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1609~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1609~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:01:54,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= 1 ~x$r_buff0_thd1~0_Out197766721) (= ~y~0_Out197766721 1) (= ~x$r_buff0_thd0~0_In197766721 ~x$r_buff1_thd0~0_Out197766721) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In197766721 0)) (= ~x$r_buff0_thd2~0_In197766721 ~x$r_buff1_thd2~0_Out197766721) (= ~x$r_buff1_thd1~0_Out197766721 ~x$r_buff0_thd1~0_In197766721)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In197766721, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In197766721, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In197766721, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In197766721} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In197766721, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out197766721, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In197766721, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out197766721, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out197766721, ~y~0=~y~0_Out197766721, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In197766721, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out197766721} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:01:54,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L802-1-->L804: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1610~0.base_11|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1610~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1610~0.base_11| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1610~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1610~0.offset_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1610~0.base_11| 1)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1610~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1610~0.base_11|) |v_ULTIMATE.start_main_~#t1610~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1610~0.base=|v_ULTIMATE.start_main_~#t1610~0.base_11|, ULTIMATE.start_main_~#t1610~0.offset=|v_ULTIMATE.start_main_~#t1610~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1610~0.base, ULTIMATE.start_main_~#t1610~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 11:01:54,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-746861885 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-746861885 256) 0))) (or (and (= ~x$w_buff0_used~0_In-746861885 |P0Thread1of1ForFork0_#t~ite5_Out-746861885|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-746861885|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-746861885, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-746861885} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-746861885|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-746861885, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-746861885} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 11:01:54,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In807054505 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In807054505 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In807054505 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In807054505 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In807054505 |P0Thread1of1ForFork0_#t~ite6_Out807054505|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out807054505|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In807054505, ~x$w_buff1_used~0=~x$w_buff1_used~0_In807054505, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In807054505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In807054505} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out807054505|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In807054505, ~x$w_buff1_used~0=~x$w_buff1_used~0_In807054505, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In807054505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In807054505} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 11:01:54,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-529847084 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-529847084 256))) (.cse0 (= ~x$r_buff0_thd1~0_Out-529847084 ~x$r_buff0_thd1~0_In-529847084))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out-529847084) (not .cse2)) (and .cse2 .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-529847084, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-529847084} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-529847084, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-529847084|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-529847084} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 11:01:54,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In2121363527 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In2121363527 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In2121363527 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2121363527 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out2121363527| ~x$r_buff1_thd1~0_In2121363527) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out2121363527| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2121363527, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2121363527, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2121363527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2121363527} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2121363527, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2121363527|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2121363527, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2121363527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2121363527} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 11:01:54,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L744-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 11:01:54,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_25, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 11:01:54,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-556465893 256) 0))) (or (and (= ~x$r_buff1_thd2~0_In-556465893 |P1Thread1of1ForFork1_#t~ite30_Out-556465893|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-556465893| |P1Thread1of1ForFork1_#t~ite29_Out-556465893|)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-556465893 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-556465893 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-556465893 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-556465893 256))))) (= ~x$r_buff1_thd2~0_In-556465893 |P1Thread1of1ForFork1_#t~ite29_Out-556465893|) (= |P1Thread1of1ForFork1_#t~ite30_Out-556465893| |P1Thread1of1ForFork1_#t~ite29_Out-556465893|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-556465893|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-556465893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-556465893, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-556465893, ~weak$$choice2~0=~weak$$choice2~0_In-556465893, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-556465893} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-556465893|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-556465893|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-556465893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-556465893, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-556465893, ~weak$$choice2~0=~weak$$choice2~0_In-556465893, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-556465893} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 11:01:54,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_6 v_~x~0_27) (not (= (mod v_~x$flush_delayed~0_9 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-07 11:01:54,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-697821869 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-697821869 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-697821869| ~x$w_buff1~0_In-697821869)) (and (= ~x~0_In-697821869 |P1Thread1of1ForFork1_#t~ite32_Out-697821869|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-697821869, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-697821869, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-697821869, ~x~0=~x~0_In-697821869} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-697821869, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-697821869, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-697821869, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-697821869|, ~x~0=~x~0_In-697821869} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:01:54,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_39 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 11:01:54,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-20780897 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-20780897 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-20780897| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-20780897| ~x$w_buff0_used~0_In-20780897) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-20780897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-20780897} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-20780897|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-20780897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-20780897} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:01:54,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2114624376 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2114624376 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2114624376 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-2114624376 256)))) (or (and (= ~x$w_buff1_used~0_In-2114624376 |P1Thread1of1ForFork1_#t~ite35_Out-2114624376|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-2114624376|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2114624376, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2114624376, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2114624376, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2114624376} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2114624376, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2114624376, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2114624376|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2114624376, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2114624376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:01:54,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1551415730 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1551415730 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1551415730| ~x$r_buff0_thd2~0_In-1551415730)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1551415730| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1551415730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1551415730} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1551415730, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1551415730|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1551415730} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:01:54,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-629745605 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-629745605 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-629745605 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-629745605 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-629745605|)) (and (= ~x$r_buff1_thd2~0_In-629745605 |P1Thread1of1ForFork1_#t~ite37_Out-629745605|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-629745605, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-629745605, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-629745605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-629745605} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-629745605, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-629745605, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-629745605, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-629745605|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-629745605} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:01:54,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= v_~x$r_buff1_thd2~0_91 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_91, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:01:54,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 11:01:54,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite41_Out-1644589727| |ULTIMATE.start_main_#t~ite40_Out-1644589727|)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1644589727 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1644589727 256)))) (or (and (not .cse0) .cse1 (= ~x$w_buff1~0_In-1644589727 |ULTIMATE.start_main_#t~ite40_Out-1644589727|) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1644589727| ~x~0_In-1644589727) .cse1 (or .cse0 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1644589727, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1644589727, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1644589727, ~x~0=~x~0_In-1644589727} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1644589727|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1644589727|, ~x$w_buff1~0=~x$w_buff1~0_In-1644589727, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1644589727, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1644589727, ~x~0=~x~0_In-1644589727} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:01:54,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In2105048073 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In2105048073 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2105048073| 0)) (and (= |ULTIMATE.start_main_#t~ite42_Out2105048073| ~x$w_buff0_used~0_In2105048073) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2105048073, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2105048073} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2105048073, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2105048073|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2105048073} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:01:54,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In654265737 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In654265737 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In654265737 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In654265737 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out654265737|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In654265737 |ULTIMATE.start_main_#t~ite43_Out654265737|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In654265737, ~x$w_buff1_used~0=~x$w_buff1_used~0_In654265737, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In654265737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In654265737} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In654265737, ~x$w_buff1_used~0=~x$w_buff1_used~0_In654265737, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out654265737|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In654265737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In654265737} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:01:54,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1113003066 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1113003066 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1113003066| ~x$r_buff0_thd0~0_In-1113003066) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1113003066| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1113003066, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1113003066} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1113003066, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1113003066|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1113003066} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:01:54,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1156692785 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1156692785 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1156692785 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1156692785 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1156692785|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1156692785| ~x$r_buff1_thd0~0_In1156692785)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1156692785, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1156692785, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1156692785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1156692785} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1156692785, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1156692785, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1156692785, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1156692785|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1156692785} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:01:54,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_96 |v_ULTIMATE.start_main_#t~ite45_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~y~0_57 2) (= v_~__unbuffered_p1_EBX~0_23 0))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_53|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_57, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_96, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_52|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:01:54,217 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f3e2d93d-5688-48f5-922b-a9f773f3f812/bin/utaipan/witness.graphml [2019-12-07 11:01:54,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:01:54,218 INFO L168 Benchmark]: Toolchain (without parser) took 8862.15 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 461.9 MB). Free memory was 937.1 MB in the beginning and 978.7 MB in the end (delta: -41.6 MB). Peak memory consumption was 420.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:54,218 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:01:54,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -133.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:54,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.67 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 11:01:54,219 INFO L168 Benchmark]: Boogie Preprocessor took 24.03 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 11:01:54,219 INFO L168 Benchmark]: RCFGBuilder took 386.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:54,220 INFO L168 Benchmark]: TraceAbstraction took 7980.43 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 360.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.2 MB). Peak memory consumption was 371.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:54,220 INFO L168 Benchmark]: Witness Printer took 60.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 978.7 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:54,221 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -133.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.67 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.03 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 386.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7980.43 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 360.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.2 MB). Peak memory consumption was 371.0 MB. Max. memory is 11.5 GB. * Witness Printer took 60.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 978.7 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 25 ChoiceCompositions, 4597 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 76598 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1609, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1610, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1797 SDtfs, 1225 SDslu, 2862 SDs, 0 SdLazy, 1089 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19068occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 13048 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 301 ConstructedInterpolants, 0 QuantifiedInterpolants, 25955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...