./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/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 8407640384d9c62c9303a97bf3c167a9bd85dcbe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:26:19,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:26:19,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:26:19,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:26:19,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:26:19,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:26:19,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:26:19,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:26:19,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:26:19,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:26:19,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:26:19,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:26:19,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:26:19,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:26:19,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:26:19,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:26:19,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:26:19,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:26:19,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:26:19,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:26:19,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:26:19,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:26:19,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:26:19,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:26:19,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:26:19,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:26:19,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:26:19,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:26:19,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:26:19,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:26:19,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:26:19,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:26:19,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:26:19,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:26:19,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:26:19,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:26:19,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:26:19,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:26:19,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:26:19,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:26:19,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:26:19,419 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:26:19,429 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:26:19,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:26:19,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:26:19,430 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:26:19,430 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:26:19,430 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:26:19,430 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:26:19,431 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:26:19,431 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:26:19,431 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:26:19,431 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:26:19,431 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:26:19,431 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:26:19,431 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:26:19,431 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:26:19,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:26:19,432 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:26:19,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:26:19,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:26:19,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:26:19,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:26:19,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:26:19,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:26:19,433 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:26:19,433 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:26:19,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:26:19,433 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:26:19,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:26:19,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:26:19,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:26:19,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:26:19,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:26:19,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:26:19,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:26:19,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:26:19,434 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:26:19,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:26:19,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:26:19,434 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:26:19,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:26:19,435 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_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/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 -> 8407640384d9c62c9303a97bf3c167a9bd85dcbe [2019-12-07 12:26:19,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:26:19,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:26:19,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:26:19,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:26:19,545 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:26:19,545 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt.i [2019-12-07 12:26:19,593 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/bin/utaipan/data/9629b8c9f/0c15ad983ca84e149d87f009be87960e/FLAG18379705d [2019-12-07 12:26:20,009 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:26:20,010 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/sv-benchmarks/c/pthread-wmm/mix035_pso.opt.i [2019-12-07 12:26:20,019 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/bin/utaipan/data/9629b8c9f/0c15ad983ca84e149d87f009be87960e/FLAG18379705d [2019-12-07 12:26:20,375 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/bin/utaipan/data/9629b8c9f/0c15ad983ca84e149d87f009be87960e [2019-12-07 12:26:20,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:26:20,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:26:20,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:26:20,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:26:20,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:26:20,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:26:20" (1/1) ... [2019-12-07 12:26:20,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77919ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20, skipping insertion in model container [2019-12-07 12:26:20,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:26:20" (1/1) ... [2019-12-07 12:26:20,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:26:20,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:26:20,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:26:20,687 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:26:20,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:26:20,783 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:26:20,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20 WrapperNode [2019-12-07 12:26:20,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:26:20,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:26:20,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:26:20,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:26:20,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20" (1/1) ... [2019-12-07 12:26:20,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20" (1/1) ... [2019-12-07 12:26:20,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:26:20,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:26:20,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:26:20,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:26:20,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20" (1/1) ... [2019-12-07 12:26:20,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20" (1/1) ... [2019-12-07 12:26:20,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20" (1/1) ... [2019-12-07 12:26:20,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20" (1/1) ... [2019-12-07 12:26:20,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20" (1/1) ... [2019-12-07 12:26:20,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20" (1/1) ... [2019-12-07 12:26:20,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20" (1/1) ... [2019-12-07 12:26:20,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:26:20,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:26:20,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:26:20,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:26:20,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/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 12:26:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:26:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:26:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:26:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:26:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:26:20,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:26:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:26:20,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:26:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:26:20,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:26:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:26:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:26:20,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:26:20,889 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 12:26:21,222 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:26:21,222 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:26:21,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:26:21 BoogieIcfgContainer [2019-12-07 12:26:21,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:26:21,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:26:21,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:26:21,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:26:21,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:26:20" (1/3) ... [2019-12-07 12:26:21,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e3264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:26:21, skipping insertion in model container [2019-12-07 12:26:21,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:20" (2/3) ... [2019-12-07 12:26:21,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e3264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:26:21, skipping insertion in model container [2019-12-07 12:26:21,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:26:21" (3/3) ... [2019-12-07 12:26:21,227 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt.i [2019-12-07 12:26:21,233 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:26:21,234 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:26:21,238 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:26:21,239 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:26:21,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,261 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,262 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,263 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,263 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,275 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,275 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:21,291 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 12:26:21,308 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:26:21,308 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:26:21,308 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:26:21,308 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:26:21,308 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:26:21,309 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:26:21,309 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:26:21,309 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:26:21,319 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 179 transitions [2019-12-07 12:26:21,320 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-12-07 12:26:21,366 INFO L134 PetriNetUnfolder]: 35/176 cut-off events. [2019-12-07 12:26:21,366 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:26:21,374 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 9/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 12:26:21,385 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-12-07 12:26:21,410 INFO L134 PetriNetUnfolder]: 35/176 cut-off events. [2019-12-07 12:26:21,411 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:26:21,414 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 9/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 12:26:21,423 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 12:26:21,424 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:26:24,209 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 12:26:24,305 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44280 [2019-12-07 12:26:24,305 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 12:26:24,307 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 79 transitions [2019-12-07 12:26:24,817 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12302 states. [2019-12-07 12:26:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 12302 states. [2019-12-07 12:26:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:26:24,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:24,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:24,824 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:24,827 INFO L82 PathProgramCache]: Analyzing trace with hash -941376449, now seen corresponding path program 1 times [2019-12-07 12:26:24,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:24,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154787379] [2019-12-07 12:26:24,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:24,981 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 12:26:24,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154787379] [2019-12-07 12:26:24,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:24,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:26:24,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100751313] [2019-12-07 12:26:24,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:26:24,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:24,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:26:24,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:26:24,996 INFO L87 Difference]: Start difference. First operand 12302 states. Second operand 3 states. [2019-12-07 12:26:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:25,182 INFO L93 Difference]: Finished difference Result 11966 states and 45788 transitions. [2019-12-07 12:26:25,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:26:25,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 12:26:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:25,275 INFO L225 Difference]: With dead ends: 11966 [2019-12-07 12:26:25,275 INFO L226 Difference]: Without dead ends: 11270 [2019-12-07 12:26:25,276 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 12:26:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11270 states. [2019-12-07 12:26:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11270 to 11270. [2019-12-07 12:26:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-12-07 12:26:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 43054 transitions. [2019-12-07 12:26:25,683 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 43054 transitions. Word has length 7 [2019-12-07 12:26:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:25,684 INFO L462 AbstractCegarLoop]: Abstraction has 11270 states and 43054 transitions. [2019-12-07 12:26:25,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:26:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 43054 transitions. [2019-12-07 12:26:25,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:26:25,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:25,688 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:25,689 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:25,689 INFO L82 PathProgramCache]: Analyzing trace with hash -941453907, now seen corresponding path program 1 times [2019-12-07 12:26:25,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:25,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181198437] [2019-12-07 12:26:25,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:25,751 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 12:26:25,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181198437] [2019-12-07 12:26:25,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:25,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:26:25,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154010920] [2019-12-07 12:26:25,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:26:25,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:26:25,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:26:25,753 INFO L87 Difference]: Start difference. First operand 11270 states and 43054 transitions. Second operand 4 states. [2019-12-07 12:26:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:26,034 INFO L93 Difference]: Finished difference Result 16970 states and 62500 transitions. [2019-12-07 12:26:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:26:26,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:26:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:26,094 INFO L225 Difference]: With dead ends: 16970 [2019-12-07 12:26:26,094 INFO L226 Difference]: Without dead ends: 16944 [2019-12-07 12:26:26,095 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 12:26:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16944 states. [2019-12-07 12:26:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16944 to 15456. [2019-12-07 12:26:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15456 states. [2019-12-07 12:26:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15456 states to 15456 states and 57661 transitions. [2019-12-07 12:26:26,550 INFO L78 Accepts]: Start accepts. Automaton has 15456 states and 57661 transitions. Word has length 13 [2019-12-07 12:26:26,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:26,551 INFO L462 AbstractCegarLoop]: Abstraction has 15456 states and 57661 transitions. [2019-12-07 12:26:26,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:26:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 15456 states and 57661 transitions. [2019-12-07 12:26:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:26:26,556 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:26,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:26,556 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:26,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:26,556 INFO L82 PathProgramCache]: Analyzing trace with hash 166730424, now seen corresponding path program 1 times [2019-12-07 12:26:26,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:26,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623524621] [2019-12-07 12:26:26,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:26,604 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 12:26:26,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623524621] [2019-12-07 12:26:26,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:26,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:26:26,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008795205] [2019-12-07 12:26:26,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:26:26,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:26,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:26:26,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:26:26,606 INFO L87 Difference]: Start difference. First operand 15456 states and 57661 transitions. Second operand 3 states. [2019-12-07 12:26:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:26,702 INFO L93 Difference]: Finished difference Result 20134 states and 73756 transitions. [2019-12-07 12:26:26,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:26:26,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:26:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:26,782 INFO L225 Difference]: With dead ends: 20134 [2019-12-07 12:26:26,782 INFO L226 Difference]: Without dead ends: 20134 [2019-12-07 12:26:26,783 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 12:26:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20134 states. [2019-12-07 12:26:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20134 to 16742. [2019-12-07 12:26:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16742 states. [2019-12-07 12:26:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16742 states to 16742 states and 62266 transitions. [2019-12-07 12:26:27,203 INFO L78 Accepts]: Start accepts. Automaton has 16742 states and 62266 transitions. Word has length 16 [2019-12-07 12:26:27,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:27,204 INFO L462 AbstractCegarLoop]: Abstraction has 16742 states and 62266 transitions. [2019-12-07 12:26:27,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:26:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 16742 states and 62266 transitions. [2019-12-07 12:26:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:26:27,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:27,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:27,207 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:27,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:27,207 INFO L82 PathProgramCache]: Analyzing trace with hash 166596039, now seen corresponding path program 1 times [2019-12-07 12:26:27,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:27,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608545371] [2019-12-07 12:26:27,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:27,263 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 12:26:27,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608545371] [2019-12-07 12:26:27,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:27,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:26:27,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354830849] [2019-12-07 12:26:27,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:26:27,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:27,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:26:27,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:26:27,265 INFO L87 Difference]: Start difference. First operand 16742 states and 62266 transitions. Second operand 4 states. [2019-12-07 12:26:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:27,410 INFO L93 Difference]: Finished difference Result 20458 states and 74724 transitions. [2019-12-07 12:26:27,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:26:27,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:26:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:27,441 INFO L225 Difference]: With dead ends: 20458 [2019-12-07 12:26:27,441 INFO L226 Difference]: Without dead ends: 20438 [2019-12-07 12:26:27,441 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 12:26:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20438 states. [2019-12-07 12:26:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20438 to 17660. [2019-12-07 12:26:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17660 states. [2019-12-07 12:26:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17660 states to 17660 states and 65445 transitions. [2019-12-07 12:26:27,768 INFO L78 Accepts]: Start accepts. Automaton has 17660 states and 65445 transitions. Word has length 16 [2019-12-07 12:26:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:27,768 INFO L462 AbstractCegarLoop]: Abstraction has 17660 states and 65445 transitions. [2019-12-07 12:26:27,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:26:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 17660 states and 65445 transitions. [2019-12-07 12:26:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:26:27,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:27,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:27,771 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:27,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:27,771 INFO L82 PathProgramCache]: Analyzing trace with hash 289916209, now seen corresponding path program 1 times [2019-12-07 12:26:27,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:27,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622594201] [2019-12-07 12:26:27,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:27,805 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 12:26:27,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622594201] [2019-12-07 12:26:27,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:27,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:26:27,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342482602] [2019-12-07 12:26:27,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:26:27,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:27,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:26:27,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:26:27,807 INFO L87 Difference]: Start difference. First operand 17660 states and 65445 transitions. Second operand 4 states. [2019-12-07 12:26:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:27,965 INFO L93 Difference]: Finished difference Result 22396 states and 81911 transitions. [2019-12-07 12:26:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:26:27,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:26:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:28,004 INFO L225 Difference]: With dead ends: 22396 [2019-12-07 12:26:28,004 INFO L226 Difference]: Without dead ends: 22368 [2019-12-07 12:26:28,005 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 12:26:28,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22368 states. [2019-12-07 12:26:28,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22368 to 18470. [2019-12-07 12:26:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18470 states. [2019-12-07 12:26:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18470 states to 18470 states and 68496 transitions. [2019-12-07 12:26:28,424 INFO L78 Accepts]: Start accepts. Automaton has 18470 states and 68496 transitions. Word has length 16 [2019-12-07 12:26:28,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:28,425 INFO L462 AbstractCegarLoop]: Abstraction has 18470 states and 68496 transitions. [2019-12-07 12:26:28,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:26:28,425 INFO L276 IsEmpty]: Start isEmpty. Operand 18470 states and 68496 transitions. [2019-12-07 12:26:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:26:28,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:28,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:28,430 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:28,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:28,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1946092179, now seen corresponding path program 1 times [2019-12-07 12:26:28,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:28,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759995942] [2019-12-07 12:26:28,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:28,462 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 12:26:28,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759995942] [2019-12-07 12:26:28,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:28,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:26:28,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464947947] [2019-12-07 12:26:28,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:26:28,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:28,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:26:28,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:26:28,463 INFO L87 Difference]: Start difference. First operand 18470 states and 68496 transitions. Second operand 3 states. [2019-12-07 12:26:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:28,528 INFO L93 Difference]: Finished difference Result 18210 states and 67534 transitions. [2019-12-07 12:26:28,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:26:28,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:26:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:28,559 INFO L225 Difference]: With dead ends: 18210 [2019-12-07 12:26:28,559 INFO L226 Difference]: Without dead ends: 18210 [2019-12-07 12:26:28,559 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 12:26:28,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18210 states. [2019-12-07 12:26:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18210 to 18210. [2019-12-07 12:26:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18210 states. [2019-12-07 12:26:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18210 states to 18210 states and 67534 transitions. [2019-12-07 12:26:28,877 INFO L78 Accepts]: Start accepts. Automaton has 18210 states and 67534 transitions. Word has length 18 [2019-12-07 12:26:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:28,878 INFO L462 AbstractCegarLoop]: Abstraction has 18210 states and 67534 transitions. [2019-12-07 12:26:28,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:26:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 18210 states and 67534 transitions. [2019-12-07 12:26:28,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:26:28,883 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:28,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:28,884 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:28,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2042402422, now seen corresponding path program 1 times [2019-12-07 12:26:28,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:28,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542226939] [2019-12-07 12:26:28,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:28,931 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 12:26:28,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542226939] [2019-12-07 12:26:28,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:28,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:26:28,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569377442] [2019-12-07 12:26:28,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:26:28,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:28,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:26:28,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:26:28,933 INFO L87 Difference]: Start difference. First operand 18210 states and 67534 transitions. Second operand 3 states. [2019-12-07 12:26:29,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:29,062 INFO L93 Difference]: Finished difference Result 17234 states and 62998 transitions. [2019-12-07 12:26:29,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:26:29,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 12:26:29,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:29,089 INFO L225 Difference]: With dead ends: 17234 [2019-12-07 12:26:29,089 INFO L226 Difference]: Without dead ends: 17234 [2019-12-07 12:26:29,089 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 12:26:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17234 states. [2019-12-07 12:26:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17234 to 16834. [2019-12-07 12:26:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16834 states. [2019-12-07 12:26:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16834 states to 16834 states and 61638 transitions. [2019-12-07 12:26:29,360 INFO L78 Accepts]: Start accepts. Automaton has 16834 states and 61638 transitions. Word has length 19 [2019-12-07 12:26:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:29,360 INFO L462 AbstractCegarLoop]: Abstraction has 16834 states and 61638 transitions. [2019-12-07 12:26:29,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:26:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 16834 states and 61638 transitions. [2019-12-07 12:26:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:26:29,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:29,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:29,366 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:29,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:29,366 INFO L82 PathProgramCache]: Analyzing trace with hash -815902516, now seen corresponding path program 1 times [2019-12-07 12:26:29,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:29,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613119147] [2019-12-07 12:26:29,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:29,400 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 12:26:29,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613119147] [2019-12-07 12:26:29,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:29,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:26:29,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291197244] [2019-12-07 12:26:29,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:26:29,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:29,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:26:29,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:26:29,401 INFO L87 Difference]: Start difference. First operand 16834 states and 61638 transitions. Second operand 3 states. [2019-12-07 12:26:29,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:29,437 INFO L93 Difference]: Finished difference Result 9767 states and 31138 transitions. [2019-12-07 12:26:29,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:26:29,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:26:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:29,448 INFO L225 Difference]: With dead ends: 9767 [2019-12-07 12:26:29,448 INFO L226 Difference]: Without dead ends: 9767 [2019-12-07 12:26:29,448 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 12:26:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2019-12-07 12:26:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2019-12-07 12:26:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9767 states. [2019-12-07 12:26:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 31138 transitions. [2019-12-07 12:26:29,578 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 31138 transitions. Word has length 20 [2019-12-07 12:26:29,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:29,579 INFO L462 AbstractCegarLoop]: Abstraction has 9767 states and 31138 transitions. [2019-12-07 12:26:29,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:26:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 31138 transitions. [2019-12-07 12:26:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:26:29,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:29,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:29,582 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2077257817, now seen corresponding path program 1 times [2019-12-07 12:26:29,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:29,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131587143] [2019-12-07 12:26:29,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:29,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131587143] [2019-12-07 12:26:29,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:29,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:26:29,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311670237] [2019-12-07 12:26:29,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:26:29,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:29,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:26:29,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:26:29,613 INFO L87 Difference]: Start difference. First operand 9767 states and 31138 transitions. Second operand 4 states. [2019-12-07 12:26:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:29,629 INFO L93 Difference]: Finished difference Result 1943 states and 5093 transitions. [2019-12-07 12:26:29,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:26:29,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 12:26:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:29,632 INFO L225 Difference]: With dead ends: 1943 [2019-12-07 12:26:29,632 INFO L226 Difference]: Without dead ends: 1943 [2019-12-07 12:26:29,632 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 12:26:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-07 12:26:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1943. [2019-12-07 12:26:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1943 states. [2019-12-07 12:26:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 5093 transitions. [2019-12-07 12:26:29,650 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 5093 transitions. Word has length 21 [2019-12-07 12:26:29,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:29,650 INFO L462 AbstractCegarLoop]: Abstraction has 1943 states and 5093 transitions. [2019-12-07 12:26:29,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:26:29,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 5093 transitions. [2019-12-07 12:26:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:26:29,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:29,652 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] [2019-12-07 12:26:29,652 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash -45017831, now seen corresponding path program 1 times [2019-12-07 12:26:29,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:29,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458534334] [2019-12-07 12:26:29,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:29,699 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 12:26:29,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458534334] [2019-12-07 12:26:29,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:29,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:26:29,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701773250] [2019-12-07 12:26:29,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:26:29,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:29,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:26:29,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:26:29,700 INFO L87 Difference]: Start difference. First operand 1943 states and 5093 transitions. Second operand 5 states. [2019-12-07 12:26:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:29,817 INFO L93 Difference]: Finished difference Result 2686 states and 6864 transitions. [2019-12-07 12:26:29,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:26:29,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 12:26:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:29,819 INFO L225 Difference]: With dead ends: 2686 [2019-12-07 12:26:29,820 INFO L226 Difference]: Without dead ends: 2684 [2019-12-07 12:26:29,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 12:26:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-12-07 12:26:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2095. [2019-12-07 12:26:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2095 states. [2019-12-07 12:26:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 5475 transitions. [2019-12-07 12:26:29,840 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 5475 transitions. Word has length 29 [2019-12-07 12:26:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:29,840 INFO L462 AbstractCegarLoop]: Abstraction has 2095 states and 5475 transitions. [2019-12-07 12:26:29,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:26:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 5475 transitions. [2019-12-07 12:26:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:26:29,842 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:29,843 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] [2019-12-07 12:26:29,843 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:29,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:29,843 INFO L82 PathProgramCache]: Analyzing trace with hash 856751491, now seen corresponding path program 1 times [2019-12-07 12:26:29,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:29,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136301327] [2019-12-07 12:26:29,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:29,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136301327] [2019-12-07 12:26:29,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:29,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:26:29,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592110458] [2019-12-07 12:26:29,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:26:29,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:29,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:26:29,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:26:29,869 INFO L87 Difference]: Start difference. First operand 2095 states and 5475 transitions. Second operand 3 states. [2019-12-07 12:26:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:29,897 INFO L93 Difference]: Finished difference Result 2610 states and 6578 transitions. [2019-12-07 12:26:29,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:26:29,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 12:26:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:29,899 INFO L225 Difference]: With dead ends: 2610 [2019-12-07 12:26:29,899 INFO L226 Difference]: Without dead ends: 2610 [2019-12-07 12:26:29,899 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 12:26:29,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2019-12-07 12:26:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2137. [2019-12-07 12:26:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2019-12-07 12:26:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 5406 transitions. [2019-12-07 12:26:29,920 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 5406 transitions. Word has length 29 [2019-12-07 12:26:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:29,920 INFO L462 AbstractCegarLoop]: Abstraction has 2137 states and 5406 transitions. [2019-12-07 12:26:29,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:26:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 5406 transitions. [2019-12-07 12:26:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:26:29,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:29,922 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] [2019-12-07 12:26:29,922 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash -85244973, now seen corresponding path program 1 times [2019-12-07 12:26:29,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:29,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256442991] [2019-12-07 12:26:29,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:29,966 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 12:26:29,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256442991] [2019-12-07 12:26:29,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:29,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:26:29,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110494274] [2019-12-07 12:26:29,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:26:29,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:26:29,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:26:29,967 INFO L87 Difference]: Start difference. First operand 2137 states and 5406 transitions. Second operand 5 states. [2019-12-07 12:26:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:30,092 INFO L93 Difference]: Finished difference Result 2625 states and 6552 transitions. [2019-12-07 12:26:30,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:26:30,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 12:26:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:30,095 INFO L225 Difference]: With dead ends: 2625 [2019-12-07 12:26:30,095 INFO L226 Difference]: Without dead ends: 2623 [2019-12-07 12:26:30,095 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 12:26:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2019-12-07 12:26:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2017. [2019-12-07 12:26:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2019-12-07 12:26:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 5107 transitions. [2019-12-07 12:26:30,122 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 5107 transitions. Word has length 30 [2019-12-07 12:26:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:30,122 INFO L462 AbstractCegarLoop]: Abstraction has 2017 states and 5107 transitions. [2019-12-07 12:26:30,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:26:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 5107 transitions. [2019-12-07 12:26:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:26:30,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:30,124 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] [2019-12-07 12:26:30,124 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:30,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:30,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1272719188, now seen corresponding path program 1 times [2019-12-07 12:26:30,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:30,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250298614] [2019-12-07 12:26:30,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:30,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250298614] [2019-12-07 12:26:30,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:30,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:26:30,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371915142] [2019-12-07 12:26:30,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:26:30,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:30,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:26:30,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:26:30,155 INFO L87 Difference]: Start difference. First operand 2017 states and 5107 transitions. Second operand 5 states. [2019-12-07 12:26:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:30,177 INFO L93 Difference]: Finished difference Result 1198 states and 3156 transitions. [2019-12-07 12:26:30,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:26:30,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 12:26:30,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:30,179 INFO L225 Difference]: With dead ends: 1198 [2019-12-07 12:26:30,179 INFO L226 Difference]: Without dead ends: 1198 [2019-12-07 12:26:30,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:26:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2019-12-07 12:26:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2019-12-07 12:26:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-12-07 12:26:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 3156 transitions. [2019-12-07 12:26:30,195 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 3156 transitions. Word has length 30 [2019-12-07 12:26:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:30,195 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 3156 transitions. [2019-12-07 12:26:30,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:26:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 3156 transitions. [2019-12-07 12:26:30,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:26:30,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:30,197 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] [2019-12-07 12:26:30,198 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:30,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:30,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1405116581, now seen corresponding path program 1 times [2019-12-07 12:26:30,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:30,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969029288] [2019-12-07 12:26:30,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:30,450 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 12:26:30,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969029288] [2019-12-07 12:26:30,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:30,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:26:30,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351267998] [2019-12-07 12:26:30,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 12:26:30,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:30,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 12:26:30,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:26:30,451 INFO L87 Difference]: Start difference. First operand 1198 states and 3156 transitions. Second operand 13 states. [2019-12-07 12:26:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:31,048 INFO L93 Difference]: Finished difference Result 1789 states and 4448 transitions. [2019-12-07 12:26:31,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:26:31,048 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-12-07 12:26:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:31,050 INFO L225 Difference]: With dead ends: 1789 [2019-12-07 12:26:31,050 INFO L226 Difference]: Without dead ends: 1731 [2019-12-07 12:26:31,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:26:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2019-12-07 12:26:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1237. [2019-12-07 12:26:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-12-07 12:26:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 3247 transitions. [2019-12-07 12:26:31,063 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 3247 transitions. Word has length 45 [2019-12-07 12:26:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:31,063 INFO L462 AbstractCegarLoop]: Abstraction has 1237 states and 3247 transitions. [2019-12-07 12:26:31,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 12:26:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 3247 transitions. [2019-12-07 12:26:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:26:31,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:31,064 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] [2019-12-07 12:26:31,065 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:31,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:31,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1579327745, now seen corresponding path program 2 times [2019-12-07 12:26:31,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:31,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798162363] [2019-12-07 12:26:31,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:31,125 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 12:26:31,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798162363] [2019-12-07 12:26:31,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:31,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:26:31,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294043753] [2019-12-07 12:26:31,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:26:31,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:31,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:26:31,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:26:31,127 INFO L87 Difference]: Start difference. First operand 1237 states and 3247 transitions. Second operand 6 states. [2019-12-07 12:26:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:31,261 INFO L93 Difference]: Finished difference Result 3221 states and 8339 transitions. [2019-12-07 12:26:31,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:26:31,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-07 12:26:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:31,264 INFO L225 Difference]: With dead ends: 3221 [2019-12-07 12:26:31,264 INFO L226 Difference]: Without dead ends: 2687 [2019-12-07 12:26:31,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:26:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2019-12-07 12:26:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 1634. [2019-12-07 12:26:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-12-07 12:26:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 4190 transitions. [2019-12-07 12:26:31,281 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 4190 transitions. Word has length 45 [2019-12-07 12:26:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:31,282 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 4190 transitions. [2019-12-07 12:26:31,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:26:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 4190 transitions. [2019-12-07 12:26:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:26:31,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:31,284 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] [2019-12-07 12:26:31,284 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:31,284 INFO L82 PathProgramCache]: Analyzing trace with hash 157131849, now seen corresponding path program 3 times [2019-12-07 12:26:31,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:31,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132149007] [2019-12-07 12:26:31,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:31,341 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 12:26:31,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132149007] [2019-12-07 12:26:31,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:31,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:26:31,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790350429] [2019-12-07 12:26:31,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:26:31,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:31,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:26:31,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:26:31,342 INFO L87 Difference]: Start difference. First operand 1634 states and 4190 transitions. Second operand 5 states. [2019-12-07 12:26:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:31,376 INFO L93 Difference]: Finished difference Result 2290 states and 5595 transitions. [2019-12-07 12:26:31,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:26:31,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-07 12:26:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:31,376 INFO L225 Difference]: With dead ends: 2290 [2019-12-07 12:26:31,377 INFO L226 Difference]: Without dead ends: 708 [2019-12-07 12:26:31,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:26:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-12-07 12:26:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-12-07 12:26:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-12-07 12:26:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1504 transitions. [2019-12-07 12:26:31,383 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1504 transitions. Word has length 45 [2019-12-07 12:26:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:31,383 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1504 transitions. [2019-12-07 12:26:31,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:26:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1504 transitions. [2019-12-07 12:26:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:26:31,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:31,384 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] [2019-12-07 12:26:31,384 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:31,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:31,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1055766469, now seen corresponding path program 4 times [2019-12-07 12:26:31,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:31,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422813361] [2019-12-07 12:26:31,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:31,417 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 12:26:31,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422813361] [2019-12-07 12:26:31,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:31,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:26:31,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561905878] [2019-12-07 12:26:31,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:26:31,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:31,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:26:31,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:26:31,418 INFO L87 Difference]: Start difference. First operand 708 states and 1504 transitions. Second operand 4 states. [2019-12-07 12:26:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:31,432 INFO L93 Difference]: Finished difference Result 1146 states and 2439 transitions. [2019-12-07 12:26:31,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:26:31,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 12:26:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:31,433 INFO L225 Difference]: With dead ends: 1146 [2019-12-07 12:26:31,434 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 12:26:31,434 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 12:26:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 12:26:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2019-12-07 12:26:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-12-07 12:26:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 970 transitions. [2019-12-07 12:26:31,439 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 970 transitions. Word has length 45 [2019-12-07 12:26:31,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:31,439 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 970 transitions. [2019-12-07 12:26:31,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:26:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 970 transitions. [2019-12-07 12:26:31,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:26:31,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:31,441 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] [2019-12-07 12:26:31,441 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:31,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:31,441 INFO L82 PathProgramCache]: Analyzing trace with hash -252375621, now seen corresponding path program 5 times [2019-12-07 12:26:31,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:31,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237012427] [2019-12-07 12:26:31,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:26:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:26:31,508 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:26:31,508 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:26:31,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~y$w_buff1~0_255 0) (= 0 v_~y$w_buff0~0_383) (= v_~a~0_43 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t922~0.base_38| 4)) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$w_buff0_used~0_658 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_~z~0_82 0) (= v_~y$read_delayed~0_8 0) (= v_~x~0_24 0) (= v_~weak$$choice2~0_156 0) (= v_~__unbuffered_cnt~0_101 0) (= 0 v_~y$r_buff1_thd2~0_256) (= 0 |v_ULTIMATE.start_main_~#t922~0.offset_26|) (= v_~y$w_buff1_used~0_429 0) (= 0 v_~y$r_buff0_thd3~0_155) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) (= 0 v_~y$flush_delayed~0_35) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard0~0_20 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) |v_ULTIMATE.start_main_~#t922~0.offset_26| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p1_EAX~0_63) (= 0 v_~__unbuffered_p2_EAX~0_107) (= v_~y$mem_tmp~0_12 0) (= v_~y~0_134 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$read_delayed_var~0.base_8) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38| 1)) (= 0 v_~y$r_buff0_thd2~0_301) (= v_~y$r_buff1_thd0~0_160 0) (= v_~__unbuffered_p2_EBX~0_107 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38|)) (= 0 v_~y$r_buff1_thd1~0_80) (= 0 v_~y$r_buff1_thd3~0_129) (= v_~y$r_buff0_thd0~0_90 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_20|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_43, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_129, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_79|, ~y$w_buff1~0=v_~y$w_buff1~0_255, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_160, ~x~0=v_~x~0_24, ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_32|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_658, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ULTIMATE.start_main_~#t922~0.offset=|v_ULTIMATE.start_main_~#t922~0.offset_26|, ~y~0=v_~y~0_134, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_66|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_256, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_90, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_19|, ULTIMATE.start_main_~#t922~0.base=|v_ULTIMATE.start_main_~#t922~0.base_38|, ~z~0=v_~z~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t924~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t922~0.offset, ~y~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t923~0.offset, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t923~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, ULTIMATE.start_main_~#t922~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:26:31,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L822-1-->L824: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) |v_ULTIMATE.start_main_~#t923~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t923~0.base_13| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t923~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t923~0.offset_11|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t923~0.offset, #length, ULTIMATE.start_main_~#t923~0.base] because there is no mapped edge [2019-12-07 12:26:31,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L824-1-->L826: Formula: (and (not (= |v_ULTIMATE.start_main_~#t924~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t924~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t924~0.base_12| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12| 1) |v_#valid_34|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) |v_ULTIMATE.start_main_~#t924~0.offset_10| 2))) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t924~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, #length] because there is no mapped edge [2019-12-07 12:26:31,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [606] [606] L4-->L799: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4)) (= v_~__unbuffered_p2_EBX~0_4 v_~a~0_4) (= 1 v_~z~0_3) (= v_~y$r_buff0_thd0~0_18 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_3) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_3) (= v_~y$r_buff0_thd3~0_15 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_23)) InVars {~a~0=v_~a~0_4, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~a~0=v_~a~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_3, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:26:31,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_19) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~a~0_27 1) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_27, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 12:26:31,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-908737971 256)))) (or (and (= ~y$w_buff0~0_In-908737971 |P1Thread1of1ForFork1_#t~ite9_Out-908737971|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In-908737971| |P1Thread1of1ForFork1_#t~ite8_Out-908737971|)) (and (= |P1Thread1of1ForFork1_#t~ite8_Out-908737971| |P1Thread1of1ForFork1_#t~ite9_Out-908737971|) (= ~y$w_buff0~0_In-908737971 |P1Thread1of1ForFork1_#t~ite8_Out-908737971|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-908737971 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-908737971 256) 0)) (and (= (mod ~y$w_buff1_used~0_In-908737971 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-908737971 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-908737971, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-908737971, ~y$w_buff0~0=~y$w_buff0~0_In-908737971, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-908737971, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-908737971|, ~weak$$choice2~0=~weak$$choice2~0_In-908737971, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-908737971} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-908737971, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-908737971, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-908737971|, ~y$w_buff0~0=~y$w_buff0~0_In-908737971, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-908737971, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-908737971|, ~weak$$choice2~0=~weak$$choice2~0_In-908737971, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-908737971} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 12:26:31,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:26:31,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1603045336 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out1603045336| ~y$r_buff1_thd2~0_In1603045336) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1603045336 256)))) (or (= (mod ~y$w_buff0_used~0_In1603045336 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In1603045336 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1603045336 256))))) (= |P1Thread1of1ForFork1_#t~ite23_Out1603045336| |P1Thread1of1ForFork1_#t~ite24_Out1603045336|)) (and (= |P1Thread1of1ForFork1_#t~ite24_Out1603045336| ~y$r_buff1_thd2~0_In1603045336) (= |P1Thread1of1ForFork1_#t~ite23_In1603045336| |P1Thread1of1ForFork1_#t~ite23_Out1603045336|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1603045336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1603045336, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1603045336, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1603045336|, ~weak$$choice2~0=~weak$$choice2~0_In1603045336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1603045336} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1603045336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1603045336, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1603045336, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1603045336|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1603045336|, ~weak$$choice2~0=~weak$$choice2~0_In1603045336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1603045336} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 12:26:31,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [615] [615] L765-->L773: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_14, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 12:26:31,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1502959718 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1502959718 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out1502959718| ~y$w_buff0_used~0_In1502959718)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out1502959718| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1502959718, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1502959718} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1502959718, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1502959718, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1502959718|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 12:26:31,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-321500001 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-321500001 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-321500001 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-321500001 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-321500001| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite29_Out-321500001| ~y$w_buff1_used~0_In-321500001) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-321500001, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-321500001, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-321500001, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-321500001} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-321500001, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-321500001, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-321500001, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-321500001|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-321500001} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 12:26:31,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L802-->L803: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1815064958 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1815064958 256) 0)) (.cse0 (= ~y$r_buff0_thd3~0_Out1815064958 ~y$r_buff0_thd3~0_In1815064958))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd3~0_Out1815064958 0) (not .cse2) (not .cse1)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1815064958, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1815064958} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1815064958, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1815064958|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1815064958} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 12:26:31,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In1441958195 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1441958195 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1441958195 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1441958195 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1441958195|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite31_Out1441958195| ~y$r_buff1_thd3~0_In1441958195)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1441958195, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1441958195, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1441958195, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1441958195} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1441958195, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1441958195, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1441958195|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1441958195, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1441958195} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 12:26:31,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L803-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_47)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:26:31,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L826-1-->L832: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:26:31,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L832-2-->L832-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-455736955 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-455736955 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-455736955| ~y~0_In-455736955)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out-455736955| ~y$w_buff1~0_In-455736955)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-455736955, ~y~0=~y~0_In-455736955, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-455736955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455736955} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-455736955, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-455736955|, ~y~0=~y~0_In-455736955, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-455736955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455736955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 12:26:31,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L832-4-->L833: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite35_32|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 12:26:31,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In614287159 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In614287159 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out614287159| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite37_Out614287159| ~y$w_buff0_used~0_In614287159)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In614287159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In614287159} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In614287159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In614287159, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out614287159|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 12:26:31,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-452979125 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-452979125 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-452979125 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-452979125 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-452979125| ~y$w_buff1_used~0_In-452979125) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite38_Out-452979125| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-452979125, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-452979125, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-452979125, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-452979125} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-452979125, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-452979125, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-452979125|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-452979125, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-452979125} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 12:26:31,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1737548974 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1737548974 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-1737548974 |ULTIMATE.start_main_#t~ite39_Out-1737548974|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1737548974|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1737548974, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1737548974} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1737548974, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1737548974|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1737548974} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 12:26:31,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1749955466 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1749955466 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1749955466 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1749955466 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out1749955466|)) (and (= |ULTIMATE.start_main_#t~ite40_Out1749955466| ~y$r_buff1_thd0~0_In1749955466) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1749955466, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1749955466, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1749955466, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1749955466} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1749955466|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1749955466, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1749955466, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1749955466, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1749955466} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:26:31,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~y$r_buff1_thd0~0_131 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_84 0) (= 1 v_~__unbuffered_p2_EAX~0_84) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p0_EAX~0_34))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_131, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:26:31,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:26:31 BasicIcfg [2019-12-07 12:26:31,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:26:31,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:26:31,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:26:31,566 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:26:31,567 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:26:21" (3/4) ... [2019-12-07 12:26:31,568 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:26:31,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~y$w_buff1~0_255 0) (= 0 v_~y$w_buff0~0_383) (= v_~a~0_43 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t922~0.base_38| 4)) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$w_buff0_used~0_658 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_~z~0_82 0) (= v_~y$read_delayed~0_8 0) (= v_~x~0_24 0) (= v_~weak$$choice2~0_156 0) (= v_~__unbuffered_cnt~0_101 0) (= 0 v_~y$r_buff1_thd2~0_256) (= 0 |v_ULTIMATE.start_main_~#t922~0.offset_26|) (= v_~y$w_buff1_used~0_429 0) (= 0 v_~y$r_buff0_thd3~0_155) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) (= 0 v_~y$flush_delayed~0_35) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard0~0_20 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) |v_ULTIMATE.start_main_~#t922~0.offset_26| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p1_EAX~0_63) (= 0 v_~__unbuffered_p2_EAX~0_107) (= v_~y$mem_tmp~0_12 0) (= v_~y~0_134 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$read_delayed_var~0.base_8) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38| 1)) (= 0 v_~y$r_buff0_thd2~0_301) (= v_~y$r_buff1_thd0~0_160 0) (= v_~__unbuffered_p2_EBX~0_107 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38|)) (= 0 v_~y$r_buff1_thd1~0_80) (= 0 v_~y$r_buff1_thd3~0_129) (= v_~y$r_buff0_thd0~0_90 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_20|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_43, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_129, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_79|, ~y$w_buff1~0=v_~y$w_buff1~0_255, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_160, ~x~0=v_~x~0_24, ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_32|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_658, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ULTIMATE.start_main_~#t922~0.offset=|v_ULTIMATE.start_main_~#t922~0.offset_26|, ~y~0=v_~y~0_134, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_66|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_256, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_90, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_19|, ULTIMATE.start_main_~#t922~0.base=|v_ULTIMATE.start_main_~#t922~0.base_38|, ~z~0=v_~z~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t924~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t922~0.offset, ~y~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t923~0.offset, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t923~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, ULTIMATE.start_main_~#t922~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:26:31,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L822-1-->L824: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) |v_ULTIMATE.start_main_~#t923~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t923~0.base_13| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t923~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t923~0.offset_11|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t923~0.offset, #length, ULTIMATE.start_main_~#t923~0.base] because there is no mapped edge [2019-12-07 12:26:31,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L824-1-->L826: Formula: (and (not (= |v_ULTIMATE.start_main_~#t924~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t924~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t924~0.base_12| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12| 1) |v_#valid_34|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) |v_ULTIMATE.start_main_~#t924~0.offset_10| 2))) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t924~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, #length] because there is no mapped edge [2019-12-07 12:26:31,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [606] [606] L4-->L799: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4)) (= v_~__unbuffered_p2_EBX~0_4 v_~a~0_4) (= 1 v_~z~0_3) (= v_~y$r_buff0_thd0~0_18 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_3) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_3) (= v_~y$r_buff0_thd3~0_15 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_23)) InVars {~a~0=v_~a~0_4, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~a~0=v_~a~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_3, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:26:31,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_19) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~a~0_27 1) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_27, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 12:26:31,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-908737971 256)))) (or (and (= ~y$w_buff0~0_In-908737971 |P1Thread1of1ForFork1_#t~ite9_Out-908737971|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In-908737971| |P1Thread1of1ForFork1_#t~ite8_Out-908737971|)) (and (= |P1Thread1of1ForFork1_#t~ite8_Out-908737971| |P1Thread1of1ForFork1_#t~ite9_Out-908737971|) (= ~y$w_buff0~0_In-908737971 |P1Thread1of1ForFork1_#t~ite8_Out-908737971|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-908737971 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-908737971 256) 0)) (and (= (mod ~y$w_buff1_used~0_In-908737971 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-908737971 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-908737971, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-908737971, ~y$w_buff0~0=~y$w_buff0~0_In-908737971, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-908737971, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-908737971|, ~weak$$choice2~0=~weak$$choice2~0_In-908737971, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-908737971} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-908737971, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-908737971, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-908737971|, ~y$w_buff0~0=~y$w_buff0~0_In-908737971, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-908737971, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-908737971|, ~weak$$choice2~0=~weak$$choice2~0_In-908737971, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-908737971} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 12:26:31,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:26:31,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1603045336 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out1603045336| ~y$r_buff1_thd2~0_In1603045336) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1603045336 256)))) (or (= (mod ~y$w_buff0_used~0_In1603045336 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In1603045336 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1603045336 256))))) (= |P1Thread1of1ForFork1_#t~ite23_Out1603045336| |P1Thread1of1ForFork1_#t~ite24_Out1603045336|)) (and (= |P1Thread1of1ForFork1_#t~ite24_Out1603045336| ~y$r_buff1_thd2~0_In1603045336) (= |P1Thread1of1ForFork1_#t~ite23_In1603045336| |P1Thread1of1ForFork1_#t~ite23_Out1603045336|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1603045336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1603045336, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1603045336, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1603045336|, ~weak$$choice2~0=~weak$$choice2~0_In1603045336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1603045336} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1603045336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1603045336, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1603045336, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1603045336|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1603045336|, ~weak$$choice2~0=~weak$$choice2~0_In1603045336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1603045336} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 12:26:31,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [615] [615] L765-->L773: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_14, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 12:26:31,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1502959718 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1502959718 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out1502959718| ~y$w_buff0_used~0_In1502959718)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out1502959718| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1502959718, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1502959718} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1502959718, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1502959718, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1502959718|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 12:26:31,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-321500001 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-321500001 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-321500001 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-321500001 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-321500001| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite29_Out-321500001| ~y$w_buff1_used~0_In-321500001) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-321500001, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-321500001, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-321500001, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-321500001} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-321500001, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-321500001, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-321500001, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-321500001|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-321500001} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 12:26:31,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L802-->L803: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1815064958 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1815064958 256) 0)) (.cse0 (= ~y$r_buff0_thd3~0_Out1815064958 ~y$r_buff0_thd3~0_In1815064958))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd3~0_Out1815064958 0) (not .cse2) (not .cse1)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1815064958, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1815064958} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1815064958, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1815064958|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1815064958} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 12:26:31,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In1441958195 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1441958195 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1441958195 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1441958195 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1441958195|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite31_Out1441958195| ~y$r_buff1_thd3~0_In1441958195)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1441958195, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1441958195, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1441958195, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1441958195} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1441958195, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1441958195, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1441958195|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1441958195, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1441958195} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 12:26:31,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L803-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_47)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:26:31,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L826-1-->L832: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:26:31,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L832-2-->L832-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-455736955 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-455736955 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-455736955| ~y~0_In-455736955)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out-455736955| ~y$w_buff1~0_In-455736955)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-455736955, ~y~0=~y~0_In-455736955, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-455736955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455736955} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-455736955, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-455736955|, ~y~0=~y~0_In-455736955, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-455736955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455736955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 12:26:31,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L832-4-->L833: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite35_32|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 12:26:31,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In614287159 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In614287159 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out614287159| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite37_Out614287159| ~y$w_buff0_used~0_In614287159)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In614287159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In614287159} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In614287159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In614287159, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out614287159|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 12:26:31,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-452979125 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-452979125 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-452979125 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-452979125 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-452979125| ~y$w_buff1_used~0_In-452979125) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite38_Out-452979125| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-452979125, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-452979125, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-452979125, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-452979125} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-452979125, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-452979125, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-452979125|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-452979125, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-452979125} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 12:26:31,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1737548974 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1737548974 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-1737548974 |ULTIMATE.start_main_#t~ite39_Out-1737548974|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1737548974|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1737548974, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1737548974} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1737548974, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1737548974|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1737548974} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 12:26:31,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1749955466 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1749955466 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1749955466 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1749955466 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out1749955466|)) (and (= |ULTIMATE.start_main_#t~ite40_Out1749955466| ~y$r_buff1_thd0~0_In1749955466) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1749955466, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1749955466, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1749955466, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1749955466} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1749955466|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1749955466, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1749955466, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1749955466, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1749955466} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:26:31,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~y$r_buff1_thd0~0_131 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_84 0) (= 1 v_~__unbuffered_p2_EAX~0_84) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p0_EAX~0_34))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_131, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:26:31,629 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_25616cd1-c8cb-448e-8402-e76c0f5ca5c7/bin/utaipan/witness.graphml [2019-12-07 12:26:31,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:26:31,630 INFO L168 Benchmark]: Toolchain (without parser) took 11252.29 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 757.1 MB). Free memory was 940.8 MB in the beginning and 1.2 GB in the end (delta: -250.9 MB). Peak memory consumption was 506.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:31,630 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:26:31,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:31,631 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.48 ms. Allocated memory is still 1.2 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 12:26:31,631 INFO L168 Benchmark]: Boogie Preprocessor took 23.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:26:31,631 INFO L168 Benchmark]: RCFGBuilder took 378.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:31,632 INFO L168 Benchmark]: TraceAbstraction took 10342.48 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 635.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -173.5 MB). Peak memory consumption was 461.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:31,632 INFO L168 Benchmark]: Witness Printer took 62.81 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:31,633 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.48 ms. Allocated memory is still 1.2 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 23.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 378.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10342.48 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 635.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -173.5 MB). Peak memory consumption was 461.9 MB. Max. memory is 11.5 GB. * Witness Printer took 62.81 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 154 ProgramPointsBefore, 71 ProgramPointsAfterwards, 179 TransitionsBefore, 79 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 21 ChoiceCompositions, 4868 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 174 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 44280 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 1 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L750] 2 x = 1 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)=1, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L832] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1839 SDtfs, 1940 SDslu, 3039 SDs, 0 SdLazy, 1636 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18470occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 15171 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 489 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 427 ConstructedInterpolants, 0 QuantifiedInterpolants, 82557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...