./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_rmo.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_b6830e07-8795-4292-8f70-6d036c6f5146/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/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 66bd96ca17eda037d6b50686600c4452437b4688 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:42:57,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:42:57,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:42:57,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:42:57,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:42:57,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:42:57,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:42:57,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:42:57,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:42:57,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:42:57,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:42:57,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:42:57,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:42:57,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:42:57,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:42:57,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:42:57,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:42:57,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:42:57,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:42:57,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:42:57,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:42:57,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:42:57,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:42:57,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:42:57,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:42:57,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:42:57,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:42:57,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:42:57,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:42:57,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:42:57,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:42:57,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:42:57,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:42:57,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:42:57,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:42:57,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:42:57,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:42:57,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:42:57,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:42:57,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:42:57,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:42:57,989 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:42:57,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:42:57,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:42:58,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:42:58,000 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:42:58,000 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:42:58,000 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:42:58,000 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:42:58,000 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:42:58,000 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:42:58,001 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:42:58,001 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:42:58,001 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:42:58,001 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:42:58,001 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:42:58,001 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:42:58,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:42:58,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:42:58,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:42:58,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:42:58,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:42:58,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:42:58,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:42:58,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:42:58,003 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:42:58,003 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:42:58,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:42:58,003 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:42:58,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:42:58,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:42:58,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:42:58,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:42:58,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:42:58,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:42:58,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:42:58,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:42:58,005 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:42:58,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:42:58,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:42:58,005 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:42:58,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:42:58,005 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_b6830e07-8795-4292-8f70-6d036c6f5146/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 -> 66bd96ca17eda037d6b50686600c4452437b4688 [2019-12-07 16:42:58,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:42:58,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:42:58,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:42:58,120 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:42:58,120 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:42:58,121 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i [2019-12-07 16:42:58,158 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/bin/utaipan/data/ba187dcc8/ed896d01221c444483c60183dede12a5/FLAG82b40e808 [2019-12-07 16:42:58,615 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:42:58,616 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i [2019-12-07 16:42:58,626 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/bin/utaipan/data/ba187dcc8/ed896d01221c444483c60183dede12a5/FLAG82b40e808 [2019-12-07 16:42:58,634 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/bin/utaipan/data/ba187dcc8/ed896d01221c444483c60183dede12a5 [2019-12-07 16:42:58,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:42:58,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:42:58,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:42:58,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:42:58,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:42:58,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:42:58" (1/1) ... [2019-12-07 16:42:58,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:58, skipping insertion in model container [2019-12-07 16:42:58,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:42:58" (1/1) ... [2019-12-07 16:42:58,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:42:58,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:42:58,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:42:58,925 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:42:58,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:42:59,007 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:42:59,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:59 WrapperNode [2019-12-07 16:42:59,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:42:59,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:42:59,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:42:59,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:42:59,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:59" (1/1) ... [2019-12-07 16:42:59,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:59" (1/1) ... [2019-12-07 16:42:59,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:42:59,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:42:59,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:42:59,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:42:59,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:59" (1/1) ... [2019-12-07 16:42:59,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:59" (1/1) ... [2019-12-07 16:42:59,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:59" (1/1) ... [2019-12-07 16:42:59,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:59" (1/1) ... [2019-12-07 16:42:59,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:59" (1/1) ... [2019-12-07 16:42:59,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:59" (1/1) ... [2019-12-07 16:42:59,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:59" (1/1) ... [2019-12-07 16:42:59,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:42:59,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:42:59,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:42:59,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:42:59,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:42:59,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:42:59,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:42:59,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:42:59,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:42:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:42:59,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:42:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:42:59,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:42:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:42:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:42:59,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:42:59,108 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 16:42:59,420 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:42:59,421 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:42:59,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:42:59 BoogieIcfgContainer [2019-12-07 16:42:59,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:42:59,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:42:59,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:42:59,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:42:59,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:42:58" (1/3) ... [2019-12-07 16:42:59,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232f3995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:42:59, skipping insertion in model container [2019-12-07 16:42:59,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:59" (2/3) ... [2019-12-07 16:42:59,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232f3995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:42:59, skipping insertion in model container [2019-12-07 16:42:59,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:42:59" (3/3) ... [2019-12-07 16:42:59,426 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.opt.i [2019-12-07 16:42:59,432 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:42:59,432 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:42:59,436 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:42:59,437 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:42:59,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:59,483 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 16:42:59,495 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:42:59,495 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:42:59,495 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:42:59,496 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:42:59,496 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:42:59,496 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:42:59,496 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:42:59,496 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:42:59,506 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-12-07 16:42:59,507 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-07 16:42:59,550 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-07 16:42:59,550 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:42:59,557 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 16:42:59,568 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-07 16:42:59,589 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-07 16:42:59,589 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:42:59,592 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 16:42:59,601 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 16:42:59,602 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:43:02,069 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 16:43:02,217 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-07 16:43:02,464 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-12-07 16:43:02,464 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-07 16:43:02,467 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-07 16:43:02,705 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-07 16:43:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-07 16:43:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 16:43:02,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:02,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 16:43:02,712 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:02,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:02,716 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-12-07 16:43:02,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:02,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441094251] [2019-12-07 16:43:02,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:02,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441094251] [2019-12-07 16:43:02,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:02,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:43:02,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132952668] [2019-12-07 16:43:02,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:43:02,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:02,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:43:02,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:02,875 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-07 16:43:03,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:03,046 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-12-07 16:43:03,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:43:03,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 16:43:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:03,099 INFO L225 Difference]: With dead ends: 6414 [2019-12-07 16:43:03,099 INFO L226 Difference]: Without dead ends: 6042 [2019-12-07 16:43:03,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-07 16:43:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-07 16:43:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-07 16:43:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-12-07 16:43:03,338 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-12-07 16:43:03,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:03,339 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-12-07 16:43:03,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:43:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-12-07 16:43:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:43:03,342 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:03,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:03,342 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-12-07 16:43:03,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:03,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181012771] [2019-12-07 16:43:03,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:03,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181012771] [2019-12-07 16:43:03,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:03,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:43:03,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331792970] [2019-12-07 16:43:03,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:43:03,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:03,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:43:03,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:03,419 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 4 states. [2019-12-07 16:43:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:03,646 INFO L93 Difference]: Finished difference Result 9128 states and 29363 transitions. [2019-12-07 16:43:03,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:43:03,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 16:43:03,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:03,702 INFO L225 Difference]: With dead ends: 9128 [2019-12-07 16:43:03,702 INFO L226 Difference]: Without dead ends: 9113 [2019-12-07 16:43:03,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:43:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9113 states. [2019-12-07 16:43:03,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9113 to 8369. [2019-12-07 16:43:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2019-12-07 16:43:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 27318 transitions. [2019-12-07 16:43:03,951 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 27318 transitions. Word has length 11 [2019-12-07 16:43:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:03,952 INFO L462 AbstractCegarLoop]: Abstraction has 8369 states and 27318 transitions. [2019-12-07 16:43:03,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:43:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 27318 transitions. [2019-12-07 16:43:03,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:43:03,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:03,956 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:03,957 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:03,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:03,957 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-12-07 16:43:03,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:03,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897278058] [2019-12-07 16:43:03,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:03,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897278058] [2019-12-07 16:43:03,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:03,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:43:03,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243977568] [2019-12-07 16:43:03,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:43:03,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:03,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:43:03,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:03,990 INFO L87 Difference]: Start difference. First operand 8369 states and 27318 transitions. Second operand 3 states. [2019-12-07 16:43:04,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:04,122 INFO L93 Difference]: Finished difference Result 11252 states and 36788 transitions. [2019-12-07 16:43:04,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:43:04,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 16:43:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:04,158 INFO L225 Difference]: With dead ends: 11252 [2019-12-07 16:43:04,159 INFO L226 Difference]: Without dead ends: 11252 [2019-12-07 16:43:04,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11252 states. [2019-12-07 16:43:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11252 to 9819. [2019-12-07 16:43:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9819 states. [2019-12-07 16:43:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9819 states to 9819 states and 32327 transitions. [2019-12-07 16:43:04,369 INFO L78 Accepts]: Start accepts. Automaton has 9819 states and 32327 transitions. Word has length 14 [2019-12-07 16:43:04,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:04,370 INFO L462 AbstractCegarLoop]: Abstraction has 9819 states and 32327 transitions. [2019-12-07 16:43:04,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:43:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 9819 states and 32327 transitions. [2019-12-07 16:43:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:43:04,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:04,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:04,372 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:04,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-12-07 16:43:04,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:04,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361691748] [2019-12-07 16:43:04,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:04,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361691748] [2019-12-07 16:43:04,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:04,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:43:04,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642691229] [2019-12-07 16:43:04,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:43:04,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:04,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:43:04,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:04,412 INFO L87 Difference]: Start difference. First operand 9819 states and 32327 transitions. Second operand 4 states. [2019-12-07 16:43:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:04,535 INFO L93 Difference]: Finished difference Result 11915 states and 38297 transitions. [2019-12-07 16:43:04,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:43:04,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 16:43:04,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:04,558 INFO L225 Difference]: With dead ends: 11915 [2019-12-07 16:43:04,558 INFO L226 Difference]: Without dead ends: 11904 [2019-12-07 16:43:04,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:43:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11904 states. [2019-12-07 16:43:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11904 to 10744. [2019-12-07 16:43:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10744 states. [2019-12-07 16:43:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 35020 transitions. [2019-12-07 16:43:04,815 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 35020 transitions. Word has length 14 [2019-12-07 16:43:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:04,816 INFO L462 AbstractCegarLoop]: Abstraction has 10744 states and 35020 transitions. [2019-12-07 16:43:04,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:43:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 35020 transitions. [2019-12-07 16:43:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:43:04,817 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:04,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:04,818 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:04,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-12-07 16:43:04,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:04,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233991148] [2019-12-07 16:43:04,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:04,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233991148] [2019-12-07 16:43:04,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:04,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:43:04,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274857036] [2019-12-07 16:43:04,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:43:04,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:04,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:43:04,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:04,852 INFO L87 Difference]: Start difference. First operand 10744 states and 35020 transitions. Second operand 4 states. [2019-12-07 16:43:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:04,980 INFO L93 Difference]: Finished difference Result 12870 states and 41385 transitions. [2019-12-07 16:43:04,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:43:04,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 16:43:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:04,998 INFO L225 Difference]: With dead ends: 12870 [2019-12-07 16:43:04,998 INFO L226 Difference]: Without dead ends: 12857 [2019-12-07 16:43:04,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:43:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12857 states. [2019-12-07 16:43:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12857 to 10870. [2019-12-07 16:43:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10870 states. [2019-12-07 16:43:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10870 states to 10870 states and 35539 transitions. [2019-12-07 16:43:05,178 INFO L78 Accepts]: Start accepts. Automaton has 10870 states and 35539 transitions. Word has length 14 [2019-12-07 16:43:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:05,178 INFO L462 AbstractCegarLoop]: Abstraction has 10870 states and 35539 transitions. [2019-12-07 16:43:05,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:43:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 10870 states and 35539 transitions. [2019-12-07 16:43:05,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:43:05,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:05,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:05,181 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:05,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:05,182 INFO L82 PathProgramCache]: Analyzing trace with hash -133127032, now seen corresponding path program 1 times [2019-12-07 16:43:05,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:05,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401749434] [2019-12-07 16:43:05,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:05,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401749434] [2019-12-07 16:43:05,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:05,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:43:05,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074234955] [2019-12-07 16:43:05,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:43:05,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:05,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:43:05,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:05,233 INFO L87 Difference]: Start difference. First operand 10870 states and 35539 transitions. Second operand 3 states. [2019-12-07 16:43:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:05,281 INFO L93 Difference]: Finished difference Result 10914 states and 35611 transitions. [2019-12-07 16:43:05,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:43:05,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 16:43:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:05,294 INFO L225 Difference]: With dead ends: 10914 [2019-12-07 16:43:05,294 INFO L226 Difference]: Without dead ends: 10914 [2019-12-07 16:43:05,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10914 states. [2019-12-07 16:43:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10914 to 10867. [2019-12-07 16:43:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10867 states. [2019-12-07 16:43:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 35530 transitions. [2019-12-07 16:43:05,528 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 35530 transitions. Word has length 16 [2019-12-07 16:43:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:05,529 INFO L462 AbstractCegarLoop]: Abstraction has 10867 states and 35530 transitions. [2019-12-07 16:43:05,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:43:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 35530 transitions. [2019-12-07 16:43:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:43:05,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:05,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:05,534 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1519842378, now seen corresponding path program 1 times [2019-12-07 16:43:05,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:05,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36918125] [2019-12-07 16:43:05,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:05,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36918125] [2019-12-07 16:43:05,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:05,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:43:05,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038309596] [2019-12-07 16:43:05,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:43:05,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:05,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:43:05,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:05,600 INFO L87 Difference]: Start difference. First operand 10867 states and 35530 transitions. Second operand 4 states. [2019-12-07 16:43:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:05,642 INFO L93 Difference]: Finished difference Result 10731 states and 35082 transitions. [2019-12-07 16:43:05,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:43:05,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 16:43:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:05,654 INFO L225 Difference]: With dead ends: 10731 [2019-12-07 16:43:05,654 INFO L226 Difference]: Without dead ends: 10731 [2019-12-07 16:43:05,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:05,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10731 states. [2019-12-07 16:43:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10731 to 10731. [2019-12-07 16:43:05,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10731 states. [2019-12-07 16:43:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10731 states to 10731 states and 35082 transitions. [2019-12-07 16:43:05,820 INFO L78 Accepts]: Start accepts. Automaton has 10731 states and 35082 transitions. Word has length 17 [2019-12-07 16:43:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:05,820 INFO L462 AbstractCegarLoop]: Abstraction has 10731 states and 35082 transitions. [2019-12-07 16:43:05,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:43:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 10731 states and 35082 transitions. [2019-12-07 16:43:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:43:05,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:05,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:05,823 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:05,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash 319851597, now seen corresponding path program 1 times [2019-12-07 16:43:05,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:05,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621699739] [2019-12-07 16:43:05,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:05,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621699739] [2019-12-07 16:43:05,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:05,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:43:05,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623331672] [2019-12-07 16:43:05,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:43:05,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:05,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:43:05,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:05,845 INFO L87 Difference]: Start difference. First operand 10731 states and 35082 transitions. Second operand 3 states. [2019-12-07 16:43:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:05,862 INFO L93 Difference]: Finished difference Result 1658 states and 4055 transitions. [2019-12-07 16:43:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:43:05,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 16:43:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:05,864 INFO L225 Difference]: With dead ends: 1658 [2019-12-07 16:43:05,864 INFO L226 Difference]: Without dead ends: 1658 [2019-12-07 16:43:05,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-12-07 16:43:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2019-12-07 16:43:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2019-12-07 16:43:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 4055 transitions. [2019-12-07 16:43:05,879 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 4055 transitions. Word has length 17 [2019-12-07 16:43:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:05,879 INFO L462 AbstractCegarLoop]: Abstraction has 1658 states and 4055 transitions. [2019-12-07 16:43:05,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:43:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 4055 transitions. [2019-12-07 16:43:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:43:05,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:05,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:05,881 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:05,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:05,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-12-07 16:43:05,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:05,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254360400] [2019-12-07 16:43:05,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:05,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254360400] [2019-12-07 16:43:05,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:05,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:43:05,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746835619] [2019-12-07 16:43:05,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:43:05,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:05,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:43:05,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:43:05,922 INFO L87 Difference]: Start difference. First operand 1658 states and 4055 transitions. Second operand 5 states. [2019-12-07 16:43:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:06,043 INFO L93 Difference]: Finished difference Result 2281 states and 5454 transitions. [2019-12-07 16:43:06,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:43:06,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 16:43:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:06,045 INFO L225 Difference]: With dead ends: 2281 [2019-12-07 16:43:06,045 INFO L226 Difference]: Without dead ends: 2279 [2019-12-07 16:43:06,046 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 16:43:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2019-12-07 16:43:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1826. [2019-12-07 16:43:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-12-07 16:43:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 4431 transitions. [2019-12-07 16:43:06,066 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 4431 transitions. Word has length 26 [2019-12-07 16:43:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:06,066 INFO L462 AbstractCegarLoop]: Abstraction has 1826 states and 4431 transitions. [2019-12-07 16:43:06,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:43:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 4431 transitions. [2019-12-07 16:43:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:43:06,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:06,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:06,068 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:06,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:06,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2141135354, now seen corresponding path program 1 times [2019-12-07 16:43:06,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:06,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099579099] [2019-12-07 16:43:06,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:06,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099579099] [2019-12-07 16:43:06,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:06,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:43:06,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512425012] [2019-12-07 16:43:06,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:43:06,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:06,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:43:06,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:43:06,115 INFO L87 Difference]: Start difference. First operand 1826 states and 4431 transitions. Second operand 5 states. [2019-12-07 16:43:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:06,357 INFO L93 Difference]: Finished difference Result 2640 states and 6289 transitions. [2019-12-07 16:43:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:43:06,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 16:43:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:06,359 INFO L225 Difference]: With dead ends: 2640 [2019-12-07 16:43:06,360 INFO L226 Difference]: Without dead ends: 2640 [2019-12-07 16:43:06,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:43:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2019-12-07 16:43:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2242. [2019-12-07 16:43:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2019-12-07 16:43:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 5384 transitions. [2019-12-07 16:43:06,381 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 5384 transitions. Word has length 26 [2019-12-07 16:43:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:06,381 INFO L462 AbstractCegarLoop]: Abstraction has 2242 states and 5384 transitions. [2019-12-07 16:43:06,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:43:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 5384 transitions. [2019-12-07 16:43:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:43:06,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:06,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] [2019-12-07 16:43:06,384 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:06,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:06,384 INFO L82 PathProgramCache]: Analyzing trace with hash 225797087, now seen corresponding path program 1 times [2019-12-07 16:43:06,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:06,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209086010] [2019-12-07 16:43:06,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:06,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209086010] [2019-12-07 16:43:06,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:06,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:43:06,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245773344] [2019-12-07 16:43:06,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:43:06,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:06,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:43:06,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:43:06,431 INFO L87 Difference]: Start difference. First operand 2242 states and 5384 transitions. Second operand 5 states. [2019-12-07 16:43:06,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:06,552 INFO L93 Difference]: Finished difference Result 2764 states and 6541 transitions. [2019-12-07 16:43:06,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:43:06,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 16:43:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:06,554 INFO L225 Difference]: With dead ends: 2764 [2019-12-07 16:43:06,554 INFO L226 Difference]: Without dead ends: 2762 [2019-12-07 16:43:06,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:43:06,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2019-12-07 16:43:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2146. [2019-12-07 16:43:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2019-12-07 16:43:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 5163 transitions. [2019-12-07 16:43:06,574 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 5163 transitions. Word has length 27 [2019-12-07 16:43:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:06,574 INFO L462 AbstractCegarLoop]: Abstraction has 2146 states and 5163 transitions. [2019-12-07 16:43:06,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:43:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 5163 transitions. [2019-12-07 16:43:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:43:06,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:06,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:06,576 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:06,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:06,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1661250727, now seen corresponding path program 1 times [2019-12-07 16:43:06,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:06,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896036570] [2019-12-07 16:43:06,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:06,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896036570] [2019-12-07 16:43:06,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:06,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:43:06,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955300053] [2019-12-07 16:43:06,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:43:06,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:06,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:43:06,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:06,610 INFO L87 Difference]: Start difference. First operand 2146 states and 5163 transitions. Second operand 4 states. [2019-12-07 16:43:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:06,624 INFO L93 Difference]: Finished difference Result 1048 states and 2349 transitions. [2019-12-07 16:43:06,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:43:06,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 16:43:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:06,626 INFO L225 Difference]: With dead ends: 1048 [2019-12-07 16:43:06,626 INFO L226 Difference]: Without dead ends: 1048 [2019-12-07 16:43:06,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-07 16:43:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 945. [2019-12-07 16:43:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-12-07 16:43:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2144 transitions. [2019-12-07 16:43:06,638 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2144 transitions. Word has length 27 [2019-12-07 16:43:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:06,638 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 2144 transitions. [2019-12-07 16:43:06,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:43:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2144 transitions. [2019-12-07 16:43:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 16:43:06,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:06,640 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] [2019-12-07 16:43:06,640 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:06,640 INFO L82 PathProgramCache]: Analyzing trace with hash -310616313, now seen corresponding path program 1 times [2019-12-07 16:43:06,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:06,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961635452] [2019-12-07 16:43:06,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:06,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961635452] [2019-12-07 16:43:06,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:06,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:43:06,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907462593] [2019-12-07 16:43:06,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:43:06,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:06,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:43:06,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:43:06,717 INFO L87 Difference]: Start difference. First operand 945 states and 2144 transitions. Second operand 6 states. [2019-12-07 16:43:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:07,052 INFO L93 Difference]: Finished difference Result 1244 states and 2733 transitions. [2019-12-07 16:43:07,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:43:07,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 16:43:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:07,054 INFO L225 Difference]: With dead ends: 1244 [2019-12-07 16:43:07,054 INFO L226 Difference]: Without dead ends: 1244 [2019-12-07 16:43:07,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:43:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-12-07 16:43:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 980. [2019-12-07 16:43:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-12-07 16:43:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2214 transitions. [2019-12-07 16:43:07,063 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2214 transitions. Word has length 41 [2019-12-07 16:43:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:07,063 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 2214 transitions. [2019-12-07 16:43:07,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:43:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2214 transitions. [2019-12-07 16:43:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 16:43:07,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:07,065 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] [2019-12-07 16:43:07,065 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:07,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:07,065 INFO L82 PathProgramCache]: Analyzing trace with hash 372989159, now seen corresponding path program 2 times [2019-12-07 16:43:07,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:07,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872663224] [2019-12-07 16:43:07,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:07,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:07,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872663224] [2019-12-07 16:43:07,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:07,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:43:07,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862422215] [2019-12-07 16:43:07,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:43:07,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:07,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:43:07,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:07,099 INFO L87 Difference]: Start difference. First operand 980 states and 2214 transitions. Second operand 3 states. [2019-12-07 16:43:07,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:07,108 INFO L93 Difference]: Finished difference Result 978 states and 2209 transitions. [2019-12-07 16:43:07,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:43:07,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 16:43:07,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:07,109 INFO L225 Difference]: With dead ends: 978 [2019-12-07 16:43:07,109 INFO L226 Difference]: Without dead ends: 978 [2019-12-07 16:43:07,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-12-07 16:43:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 907. [2019-12-07 16:43:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-12-07 16:43:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 2072 transitions. [2019-12-07 16:43:07,121 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 2072 transitions. Word has length 41 [2019-12-07 16:43:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:07,121 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 2072 transitions. [2019-12-07 16:43:07,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:43:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 2072 transitions. [2019-12-07 16:43:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 16:43:07,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:07,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:07,123 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:07,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:07,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1722201146, now seen corresponding path program 1 times [2019-12-07 16:43:07,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:07,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801138922] [2019-12-07 16:43:07,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:07,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801138922] [2019-12-07 16:43:07,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:07,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:43:07,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878833031] [2019-12-07 16:43:07,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:43:07,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:07,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:43:07,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:07,159 INFO L87 Difference]: Start difference. First operand 907 states and 2072 transitions. Second operand 4 states. [2019-12-07 16:43:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:07,172 INFO L93 Difference]: Finished difference Result 1563 states and 3600 transitions. [2019-12-07 16:43:07,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:43:07,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 16:43:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:07,173 INFO L225 Difference]: With dead ends: 1563 [2019-12-07 16:43:07,173 INFO L226 Difference]: Without dead ends: 684 [2019-12-07 16:43:07,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:43:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-12-07 16:43:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2019-12-07 16:43:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-12-07 16:43:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1576 transitions. [2019-12-07 16:43:07,179 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1576 transitions. Word has length 42 [2019-12-07 16:43:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:07,179 INFO L462 AbstractCegarLoop]: Abstraction has 684 states and 1576 transitions. [2019-12-07 16:43:07,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:43:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1576 transitions. [2019-12-07 16:43:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 16:43:07,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:07,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:07,180 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:07,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash -146556572, now seen corresponding path program 2 times [2019-12-07 16:43:07,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:07,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757218241] [2019-12-07 16:43:07,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:07,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757218241] [2019-12-07 16:43:07,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:07,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:43:07,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717273502] [2019-12-07 16:43:07,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:43:07,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:43:07,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:43:07,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:43:07,245 INFO L87 Difference]: Start difference. First operand 684 states and 1576 transitions. Second operand 7 states. [2019-12-07 16:43:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:07,370 INFO L93 Difference]: Finished difference Result 1118 states and 2505 transitions. [2019-12-07 16:43:07,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:43:07,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 16:43:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:07,371 INFO L225 Difference]: With dead ends: 1118 [2019-12-07 16:43:07,371 INFO L226 Difference]: Without dead ends: 737 [2019-12-07 16:43:07,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:43:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-07 16:43:07,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 695. [2019-12-07 16:43:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-12-07 16:43:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1581 transitions. [2019-12-07 16:43:07,378 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1581 transitions. Word has length 42 [2019-12-07 16:43:07,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:07,378 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1581 transitions. [2019-12-07 16:43:07,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:43:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1581 transitions. [2019-12-07 16:43:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 16:43:07,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:07,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:07,379 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:43:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 3 times [2019-12-07 16:43:07,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:43:07,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775119312] [2019-12-07 16:43:07,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:43:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:43:07,432 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:43:07,433 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:43:07,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= |v_ULTIMATE.start_main_~#t843~0.offset_26| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (= v_~y$r_buff1_thd0~0_156 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t843~0.base_37| 4)) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37|) |v_ULTIMATE.start_main_~#t843~0.offset_26| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37|)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t843~0.base_37|) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37| 1)) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_main_~#t843~0.base=|v_ULTIMATE.start_main_~#t843~0.base_37|, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ULTIMATE.start_main_~#t843~0.offset=|v_ULTIMATE.start_main_~#t843~0.offset_26|, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t844~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t843~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t844~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t843~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 16:43:07,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t844~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t844~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t844~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12|) |v_ULTIMATE.start_main_~#t844~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t844~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t844~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t844~0.base] because there is no mapped edge [2019-12-07 16:43:07,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-2142529278 0)) (= ~__unbuffered_p1_EBX~0_Out-2142529278 ~a~0_In-2142529278) (= ~z~0_Out-2142529278 1) (= ~y$r_buff0_thd2~0_Out-2142529278 1) (= ~y$r_buff1_thd0~0_Out-2142529278 ~y$r_buff0_thd0~0_In-2142529278) (= ~z~0_Out-2142529278 ~__unbuffered_p1_EAX~0_Out-2142529278) (= ~y$r_buff1_thd2~0_Out-2142529278 ~y$r_buff0_thd2~0_In-2142529278) (= ~y$r_buff0_thd1~0_In-2142529278 ~y$r_buff1_thd1~0_Out-2142529278)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-2142529278, ~a~0=~a~0_In-2142529278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2142529278, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2142529278, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2142529278} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-2142529278, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-2142529278, ~a~0=~a~0_In-2142529278, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-2142529278, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-2142529278, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-2142529278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2142529278, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2142529278, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2142529278, ~z~0=~z~0_Out-2142529278, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2142529278} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 16:43:07,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-68402512 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-68402512 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-68402512|)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-68402512| ~y$w_buff0_used~0_In-68402512) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-68402512, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-68402512} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-68402512, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-68402512, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-68402512|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 16:43:07,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1193234191 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1193234191 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1193234191 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1193234191 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1193234191| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite29_Out-1193234191| ~y$w_buff1_used~0_In-1193234191)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1193234191, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1193234191, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1193234191, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1193234191} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1193234191, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1193234191|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1193234191, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1193234191, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1193234191} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 16:43:07,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 16:43:07,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1728594192 256) 0))) (or (and (not .cse0) (= ~y$r_buff1_thd1~0_In-1728594192 |P0Thread1of1ForFork0_#t~ite24_Out-1728594192|) (= |P0Thread1of1ForFork0_#t~ite23_In-1728594192| |P0Thread1of1ForFork0_#t~ite23_Out-1728594192|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1728594192 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1728594192 256)) (and .cse1 (= (mod ~y$r_buff1_thd1~0_In-1728594192 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1728594192 256))))) (= |P0Thread1of1ForFork0_#t~ite23_Out-1728594192| |P0Thread1of1ForFork0_#t~ite24_Out-1728594192|) (= |P0Thread1of1ForFork0_#t~ite23_Out-1728594192| ~y$r_buff1_thd1~0_In-1728594192) .cse0))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1728594192, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1728594192, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1728594192, ~weak$$choice2~0=~weak$$choice2~0_In-1728594192, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1728594192, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-1728594192|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1728594192, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1728594192, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1728594192, ~weak$$choice2~0=~weak$$choice2~0_In-1728594192, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-1728594192|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-1728594192|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1728594192} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-07 16:43:07,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 16:43:07,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In791670904 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In791670904 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_In791670904 ~y$r_buff0_thd2~0_Out791670904))) (or (and (= 0 ~y$r_buff0_thd2~0_Out791670904) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In791670904, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In791670904} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out791670904|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In791670904, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out791670904} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 16:43:07,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In2145821293 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In2145821293 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2145821293 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2145821293 256)))) (or (and (= ~y$r_buff1_thd2~0_In2145821293 |P1Thread1of1ForFork1_#t~ite31_Out2145821293|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out2145821293|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2145821293, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2145821293, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2145821293, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2145821293} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2145821293, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2145821293, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out2145821293|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2145821293, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2145821293} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 16:43:07,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 16:43:07,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:43:07,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-290232638 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-290232638 256) 0))) (or (and (= ~y$w_buff1~0_In-290232638 |ULTIMATE.start_main_#t~ite34_Out-290232638|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-290232638 |ULTIMATE.start_main_#t~ite34_Out-290232638|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-290232638, ~y~0=~y~0_In-290232638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-290232638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-290232638} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-290232638, ~y~0=~y~0_In-290232638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-290232638, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-290232638|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-290232638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 16:43:07,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 16:43:07,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-189329354 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-189329354 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-189329354| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-189329354| ~y$w_buff0_used~0_In-189329354)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-189329354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-189329354} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-189329354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-189329354, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-189329354|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 16:43:07,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-477999880 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-477999880 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-477999880 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-477999880 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-477999880|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-477999880 |ULTIMATE.start_main_#t~ite37_Out-477999880|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-477999880, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-477999880, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-477999880, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477999880} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-477999880, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-477999880, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-477999880|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-477999880, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477999880} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 16:43:07,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-378151747 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-378151747 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-378151747| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-378151747| ~y$r_buff0_thd0~0_In-378151747)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-378151747, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-378151747} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-378151747, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-378151747, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-378151747|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:43:07,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-871269722 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-871269722 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-871269722 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-871269722 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-871269722| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-871269722 |ULTIMATE.start_main_#t~ite39_Out-871269722|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-871269722, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-871269722, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-871269722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-871269722} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-871269722, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-871269722|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-871269722, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-871269722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-871269722} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:43:07,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:43:07,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:43:07 BasicIcfg [2019-12-07 16:43:07,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:43:07,483 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:43:07,483 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:43:07,483 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:43:07,483 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:42:59" (3/4) ... [2019-12-07 16:43:07,485 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:43:07,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= |v_ULTIMATE.start_main_~#t843~0.offset_26| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (= v_~y$r_buff1_thd0~0_156 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t843~0.base_37| 4)) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37|) |v_ULTIMATE.start_main_~#t843~0.offset_26| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37|)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t843~0.base_37|) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37| 1)) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_main_~#t843~0.base=|v_ULTIMATE.start_main_~#t843~0.base_37|, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ULTIMATE.start_main_~#t843~0.offset=|v_ULTIMATE.start_main_~#t843~0.offset_26|, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t844~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t843~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t844~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t843~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 16:43:07,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t844~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t844~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t844~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12|) |v_ULTIMATE.start_main_~#t844~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t844~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t844~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t844~0.base] because there is no mapped edge [2019-12-07 16:43:07,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-2142529278 0)) (= ~__unbuffered_p1_EBX~0_Out-2142529278 ~a~0_In-2142529278) (= ~z~0_Out-2142529278 1) (= ~y$r_buff0_thd2~0_Out-2142529278 1) (= ~y$r_buff1_thd0~0_Out-2142529278 ~y$r_buff0_thd0~0_In-2142529278) (= ~z~0_Out-2142529278 ~__unbuffered_p1_EAX~0_Out-2142529278) (= ~y$r_buff1_thd2~0_Out-2142529278 ~y$r_buff0_thd2~0_In-2142529278) (= ~y$r_buff0_thd1~0_In-2142529278 ~y$r_buff1_thd1~0_Out-2142529278)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-2142529278, ~a~0=~a~0_In-2142529278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2142529278, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2142529278, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2142529278} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-2142529278, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-2142529278, ~a~0=~a~0_In-2142529278, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-2142529278, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-2142529278, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-2142529278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2142529278, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2142529278, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2142529278, ~z~0=~z~0_Out-2142529278, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2142529278} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 16:43:07,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-68402512 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-68402512 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-68402512|)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-68402512| ~y$w_buff0_used~0_In-68402512) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-68402512, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-68402512} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-68402512, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-68402512, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-68402512|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 16:43:07,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1193234191 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1193234191 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1193234191 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1193234191 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1193234191| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite29_Out-1193234191| ~y$w_buff1_used~0_In-1193234191)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1193234191, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1193234191, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1193234191, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1193234191} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1193234191, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1193234191|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1193234191, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1193234191, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1193234191} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 16:43:07,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 16:43:07,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1728594192 256) 0))) (or (and (not .cse0) (= ~y$r_buff1_thd1~0_In-1728594192 |P0Thread1of1ForFork0_#t~ite24_Out-1728594192|) (= |P0Thread1of1ForFork0_#t~ite23_In-1728594192| |P0Thread1of1ForFork0_#t~ite23_Out-1728594192|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1728594192 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1728594192 256)) (and .cse1 (= (mod ~y$r_buff1_thd1~0_In-1728594192 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1728594192 256))))) (= |P0Thread1of1ForFork0_#t~ite23_Out-1728594192| |P0Thread1of1ForFork0_#t~ite24_Out-1728594192|) (= |P0Thread1of1ForFork0_#t~ite23_Out-1728594192| ~y$r_buff1_thd1~0_In-1728594192) .cse0))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1728594192, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1728594192, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1728594192, ~weak$$choice2~0=~weak$$choice2~0_In-1728594192, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1728594192, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-1728594192|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1728594192, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1728594192, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1728594192, ~weak$$choice2~0=~weak$$choice2~0_In-1728594192, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-1728594192|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-1728594192|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1728594192} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-07 16:43:07,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 16:43:07,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In791670904 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In791670904 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_In791670904 ~y$r_buff0_thd2~0_Out791670904))) (or (and (= 0 ~y$r_buff0_thd2~0_Out791670904) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In791670904, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In791670904} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out791670904|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In791670904, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out791670904} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 16:43:07,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In2145821293 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In2145821293 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2145821293 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2145821293 256)))) (or (and (= ~y$r_buff1_thd2~0_In2145821293 |P1Thread1of1ForFork1_#t~ite31_Out2145821293|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out2145821293|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2145821293, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2145821293, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2145821293, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2145821293} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2145821293, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2145821293, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out2145821293|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2145821293, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2145821293} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 16:43:07,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 16:43:07,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:43:07,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-290232638 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-290232638 256) 0))) (or (and (= ~y$w_buff1~0_In-290232638 |ULTIMATE.start_main_#t~ite34_Out-290232638|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-290232638 |ULTIMATE.start_main_#t~ite34_Out-290232638|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-290232638, ~y~0=~y~0_In-290232638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-290232638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-290232638} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-290232638, ~y~0=~y~0_In-290232638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-290232638, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-290232638|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-290232638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 16:43:07,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 16:43:07,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-189329354 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-189329354 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-189329354| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-189329354| ~y$w_buff0_used~0_In-189329354)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-189329354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-189329354} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-189329354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-189329354, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-189329354|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 16:43:07,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-477999880 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-477999880 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-477999880 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-477999880 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-477999880|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-477999880 |ULTIMATE.start_main_#t~ite37_Out-477999880|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-477999880, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-477999880, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-477999880, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477999880} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-477999880, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-477999880, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-477999880|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-477999880, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477999880} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 16:43:07,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-378151747 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-378151747 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-378151747| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-378151747| ~y$r_buff0_thd0~0_In-378151747)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-378151747, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-378151747} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-378151747, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-378151747, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-378151747|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:43:07,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-871269722 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-871269722 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-871269722 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-871269722 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-871269722| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-871269722 |ULTIMATE.start_main_#t~ite39_Out-871269722|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-871269722, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-871269722, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-871269722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-871269722} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-871269722, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-871269722|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-871269722, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-871269722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-871269722} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:43:07,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:43:07,541 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b6830e07-8795-4292-8f70-6d036c6f5146/bin/utaipan/witness.graphml [2019-12-07 16:43:07,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:43:07,542 INFO L168 Benchmark]: Toolchain (without parser) took 8904.93 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 432.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 279.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:43:07,542 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:43:07,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:43:07,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:43:07,543 INFO L168 Benchmark]: Boogie Preprocessor took 22.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:43:07,543 INFO L168 Benchmark]: RCFGBuilder took 355.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:43:07,543 INFO L168 Benchmark]: TraceAbstraction took 8060.35 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 325.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -87.6 MB). Peak memory consumption was 237.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:43:07,544 INFO L168 Benchmark]: Witness Printer took 58.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:43:07,545 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 369.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 355.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8060.35 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 325.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -87.6 MB). Peak memory consumption was 237.4 MB. Max. memory is 11.5 GB. * Witness Printer took 58.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 139 ProgramPointsBefore, 67 ProgramPointsAfterwards, 167 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 178 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 44937 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t843, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t844, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L818] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1783 SDtfs, 1411 SDslu, 2799 SDs, 0 SdLazy, 1524 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10870occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 7318 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 44364 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...